Erdős·erdos:685
Erdős Problem 685
Machine-checked by Palomar.
Fidelity F2: The correspondence is declared through a Comparator challenge and written divergences.
number theory, primes, binomial coefficients·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at c8618095: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
1As each project's formalization.yaml states it.
Distinct prime divisors of central binomial coefficients
- authors
- AItoBit
- method
- agent
- review
- agent-reviewed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Binomial Coefficients and the Distribution of the Primes — formalizes; Some unconventional problems in number theory — background
- related
- google-deepmind/formal-conjectures/blob/9cf29323ff74a2292d32006e9e3fdf23d4cf6dd2/FormalConjectures/ErdosProblems/685.lean — builds-on; AItoBit/erdos-685-elementary-lower-bound/tree/43f03b67f5bd9c8e181255af34f70c9abb4a5ad6 — builds-on
- divergences
- Only the central specialization of the published proportional-binomial theorem is selected. The exact target is the normalized limit with value log 4. The finite values at n=0 and n=1 use Lean's total log and division; the proof uses eventual n>=4 bounds, so these values do not affect the limit.
- checked by
- Palomar
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Cited proofs · 0
No proof artifact cited by the formal record.
Also known as · 3
- https://www.erdosproblems.com/685
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/685.lean
- FormalConjectures/ErdosProblems/685.lean
Cite this record
qed.bot, “Erdős Problem 685”, https://qed.bot/s/erdos-685, as of 20 Nov 2026.