Erdős problem 694
Let f_\max(n) be the largest such that , and f_\min(n) be the smallest such , where is Euler's totient function. Investigate \max_{n\leq x}\frac{f_\max(n)}{f_\min(n)}.
Sources
FormalConjectures/ErdosProblems/
694.lean
Retained formal statement
Erdős has proved that if there exists an integer for which has exactly one solution, then there must be infinitely many such .
(∃ n > 0, ∃! m, m.totient = n) → {n | ∃! m, m.totient = n}.InfiniteSolvedStatement only, no proof