Sums of Totients of Powers

Problem Statement

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(2^N)$.

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 icy
49.80 (61)
🥈 shs10978
49.80 (50)
🥉 Nondegon
31.20 (32)
4 jonnytang
8.00 (8)

Data

Stats

Your submissions will appear here

Recent Submissions

1
icy
$g(61)$, $37$ digits 3 weeks, 1 day ago
2
shs10978
$g(50)$, $30$ digits 3 weeks, 1 day ago
3
shs10978
$g(49)$, $29$ digits 3 weeks, 1 day ago
4
shs10978
$g(48)$, $29$ digits 3 weeks, 1 day ago
5
shs10978
$g(47)$, $28$ digits 3 weeks, 1 day ago