OpenAI reports Erdős’s totient-fiber conjecture
- Mathematics
For every epsilon > 0, infinitely many positive integers n have more than n^(1-epsilon) preimages under Euler’s totient function.
OpenAI reports Erdős’s totient-fiber conjecture
- Mathematics
For every epsilon > 0, infinitely many positive integers n have more than n^(1-epsilon) preimages under Euler’s totient function.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
For every epsilon > 0, infinitely many positive integers n have more than n^(1-epsilon) preimages under Euler’s totient function.
Why it matters
If correct, attains the optimal power exponent for the largest fibers of Euler’s totient function and resolves Erdős’s conjecture.
What counts as progress
Can Euler’s totient function have more than n^(1-epsilon) preimages for infinitely many n, for every epsilon > 0?
Website timeline
Publication dates and editorial changes.