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
Carmichael has asked whether there is an integer for which has exactly one solution, that is \frac{f_\max(n)}{f_\min(n)} = 1.
sorry ↔ ∃ n > 0, ∃! m, m.totient = nOpenStatement only, no proof