This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Sums of totients of powers

Problem 512

Published on 18 April 2015 at 10:00 pm [Server Time]

Let $\varphi(n)$ be Euler's totient function.

Let $f(n)=(\sum_{i=1}^{n}\varphi(n^i)) \text{ mod } (n+1)$.

Let $g(n)=\sum_{i=1}^{n} f(i)$.

$g(100)=2007$.

Find $g(5 \times 10^8)$.


Answer not yet available
Go to back to Problems