Erdős Problem #821
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Let g(n)=#{m>=1:phi(m)=n}, the number of positive integer preimages under Euler's totient. Does every epsilon>0 admit infinitely many n with g(n)>n^(1-epsilon)? OPEN. Counting distinct m and allowing all m>=1 is essential.
A small example
phi(3)=phi(4)=phi(6)=2, hence g(2)=3. phi(5)=phi(8)=phi(10)=phi(12)=4, giving g(4)=4. These are finite examples of multiple preimages, not evidence for near-linear fibers along infinitely many n.
What is known
Maintained https://www.erdosproblems.com/latex/821, read 2026-10-14: Pillai proves limsup g(n)=infinity, Erdős [Er35b] some positive power lower infinitely often. Lichtman [Li22], Primes in arithmetic progressions to large moduli and shifted primes without large prime factors (arXiv:2211.09641), gives exponent 0.71568... infinitely often, via smooth shifted primes; it does NOT prove all exponents tending to one. Baker–Harman [BaHa98] earlier; Luca–Pollack [LuPo11] average fibers. The exact numerical decimals and original full papers not independently inspected in this audit.
A finite totient fiber has a useful elementary restriction: if \(\varphi(m)=n\) and \(p\) divides \(m\), then \(p-1\) divides \(n\). For \(n=4\) this leaves possible prime divisors only \(2,3,5\), and a short prime-power check gives exactly \(m=5,8,10,12\). Thus \(g(4)=4\); similarly \(g(2)=3\) comes from \(m=3,4,6\). Finite checks are not an argument for the near-linear infinitely-often conjecture.
The proposed near-linear multiplicity condition is
$$
\forall\varepsilon>0,\ \exists^\infty n: \quad g(n)>n^{1-\varepsilon},\qquad g(n)=#{m\geq1:\varphi(m)=n}.
$$
If \(p\) divides \(m\), the factor \(p-1\) divides \(\varphi(m)\) and hence \(n\). This restriction makes the finite cases \(g(2)=3\) and \(g(4)=4\) exactly checkable, but it does not force fibers of almost-linear size for infinitely many \(n\).
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: open totient fiber near linear multiplicity. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Build exact totient sieve up to a finite cutoff and exhaustively enumerate preimages for n=2 and n=4 with a certified finite candidate bound. Source-lock Lichtman theorem and smooth shifted-prime exponent conversion; do not treat truncated searches as proof of exact global g(n) unless a divisor structure bound is established.
Critical review must independently verify the original primary theorem, hypotheses, quantitative constants and simple examples. Passing source tests does not establish publication or mathematical proof certification.
Sources and claim boundaries
- Erdős problem #821, maintained LaTeX and original authenticated source return, checked 14 October 2026.
- Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml, Git blob 4e60263a80af6207aca494d2e1388e44fa372889. The source comment contains original bibliography and limits of direct proof inspection.
- Editorial acceptance: NONE. Protected merge: NONE. Real-browser MathJax: NOT VERIFIED. Lean/new theorem certification: NOT CLAIMED.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2092 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.