Erdős·erdos:1063
Erdős Problem 1063
Machine-checked by Palomar.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
number theory·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Claimed on erdosproblems.com
2Proof claims posted on erdosproblems.com, which says that listing a claim “is no guarantee of proof correctness”. The register records who claims what, with which systems, and links to each claim there. Nobody has examined them, and none counts in the register's totals.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at ba104cbc: Comparator confirmed 2 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.
Erdős Problem 1063: a lower bound for n_k and the structure of the exceptional index
- authors
- Paul Lee
- method
- agent — Claude Opus 5.5 (Anthropic)
- review
- agent-reviewed (Gemini 4 Argon (Google), informal mathematics, a Meta AI model, informal mathematics, Claude Fable 5.1 (Anthropic), informal mathematics and independent search code)
- sorry
- 0 unproved goals declared
- sources
- Proof of the sharper exponent v_p(n − e) ≥ v_p(k) + v_p(C(k − 1, e)) + ⌊log_p max(e, k − 1 − e)⌋ for p | k, in the erdosproblems.com discussion thread for Problem 1063 (10 July 2026) — formalizes, authors not-contacted; The density of admissible n in Erdős–Selfridge problem 1063, with a growth conjecture for n_k (preprint) — formalizes, authors participated; Problem 6447 — background; Cambie's bound n_k ≤ k · lcm(1, …, k − 1), as recorded on the problem page — background, authors not-contacted
- related
- google-deepmind/formal-conjectures/blob/ac02cd5f50407650b37344083b7c1f0f4ed1f96c/FormalConjectures/ErdosProblems/1063.lean — builds-on; Paulee314/erdos1063/blob/6b4f9666c8834395ef1669634536350223fb270f/lean/Erdos1063Lower.lean — supersedes
- divergences
- None known. The definition of n_k is identical to formal-conjectures'. Result (2) assumes only that the other k − 1 elements divide C(n, k), which is weaker than admissibility, so it applies to every admissible n.
- 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 · 5
- lfsong-google/formal-conjectures/blob/ff33e501bb78a90ae4703e22e052f8bb38e10146/FormalConjectures/ErdosProblems/1063.lean#L5524
- lfsong-google/formal-conjectures/blob/ff33e501bb78a90ae4703e22e052f8bb38e10146/FormalConjectures/ErdosProblems/1063.lean#L5533
- lfsong-google/formal-conjectures/blob/ff33e501bb78a90ae4703e22e052f8bb38e10146/FormalConjectures/ErdosProblems/1063.lean#L5537
- lfsong-google/formal-conjectures/blob/ff33e501bb78a90ae4703e22e052f8bb38e10146/FormalConjectures/ErdosProblems/1063.lean#L5541
- lfsong-google/formal-conjectures/blob/ff33e501bb78a90ae4703e22e052f8bb38e10146/FormalConjectures/ErdosProblems/1063.lean#L5545
Also known as · 3
- https://www.erdosproblems.com/1063
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1063.lean
- FormalConjectures/ErdosProblems/1063.lean
Cite this record
qed.bot, “Erdős Problem 1063”, https://qed.bot/s/erdos-1063, as of 20 Nov 2026.