Skip to content

Erdős Problem #694

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: solved (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

For a totient value v in the image of Euler's φ, let f_min(v) and f_max(v) be the least and greatest positive m with φ(m)=v. Erdős asks for the largest ratio f_max(v)/f_min(v) among such values v≤x. The maintained catalogue marks the problem SOLVED (externally LEAN-reported) and gives asymptotic (e^γ+o(1))loglog x, attributed to a GPT-5.5 Pro proof directed by Liam Price. This does not settle the separate Carmichael conjecture about a singleton totient fiber.

A small example

The positive solutions of φ(m)=4 are exactly m=5,8,10,12, so f_min(4)=5, f_max(4)=12 and the ratio is 12/5. This can be checked by factoring numbers up to a suitable bound; ruling out larger m uses elementary totient inequalities and is not just a finite exploratory scan.

What is known

The pinned google-deepmind/formal-conjectures@85f863718beeec7b58a3a1926ee92e3472bc2020 file 694.lean explicitly states the (e^γ+o(1))loglog x formula, but its proof body is by sorry. It links to a separate conditional Lean formalization relying on Mertens' product theorem and Linnik's theorem; this external source and its axiom closure were not independently replayed by GCL. The source distinguishes the upper/lower extremal ratio question from Carmichael's conjecture (existence of φ-value with a unique preimage), also open. The primary original Erdős 1979 pages were not inspected.

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: solved asymptotic external generated proof unreplayed; pinned fc main sorry; carmichael singleton distinct open. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Source-lock the asymptotic proof: trace the exact Mertens and Linnik assumptions, check that the max is only over values in the image of φ and that its asymptotic index x is a totient value bound rather than a preimage bound. Prove an exact finite fixture φ^{-1}(4)={5,8,10,12}. Acceptance: theorem-reference and fully audited conditional dependencies; do not infer GCL certification from the pinned sorry theorem or the external model attribution.

Sources and claim boundaries

Maintained #694; https://www.erdosproblems.com/694 ; https://github.com/google-deepmind/formal-conjectures/blob/85f863718beeec7b58a3a1926ee92e3472bc2020/FormalConjectures/ErdosProblems/694.lean ; original [Er79e,p.80] not directly checked. Authenticated original source issue. Full historical source theorem pages and external compiled Lean dependencies not all independently inspected. No new result, protected publication, browser MathJax verification or V2 admission.

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: #1965 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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.

Back to catalogue · Compendium introduction