Search Problems   RSS Feed
projecteuler.net

Sums of Totients of Powers

 Published on Saturday, 18th April 2015, 10:00 pm and solved by 1982
Difficulty: Level 7 [19%]

Problem 512

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

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

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

$g(100)=2007$.

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



Copied to Clipboard