Euler in Babylon

Sums of totients of powers

April 18, 2015

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)$.


gamwe6

Written by gamwe6 who lives and works in San Francisco building useful things. You should follow him on Twitter