Erdős·erdos:1054
Erdős Problem 1054
Machine-checked by Palomar.
Fidelity F3: The project checks its proof with Comparator against a statement from the Erdős collection of a corpus written separately from the proof, and held here.
number theory, divisors·Source
AI activity
How grades workPartial result (Lean)
Reasoning and sources
Autonomy
AI standalone; human involvement recorded as non-significant
Sources
Fidelity
How fidelity is gradedF3 anchored. The project checks its proof with Comparator against a statement from the Erdős collection of a corpus written separately from the proof, and held here.
Checks
1-
verified·Palomar
Registered by Palomar at 0917cd01: Comparator confirmed 21 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
4As each project's formalization.yaml states it.
Erdos 1054: conditional divisor-prefix classification
- authors
- Hyunsik (hschae)
- method
- agent — GPT-6 (Codex)
- review
- self-assessed — self-assessed; local build and three-kernel comparator validation passed (Jason (Codex agent))
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Erdos Problem 1054 verifier — adapts; The ternary Goldbach conjecture is true — background; Approximate formulas for some functions of prime numbers — background
- related
- pntpp:35fa8a2d09a9aa334f89b8eb67e35ee3cba8e4e5 — builds-on
- divergences
- Analytic inputs remain conditional. The two imported admitted prime-counting estimates became explicit theorem parameters, with unchanged mathematical content. Finite large and small ranges use new subset-sum dynamic programs, proved sound, rather than the original native certificate search. Fixed real comparisons use rational exponential bounds. The divisor-prefix conclusion is unchanged.
- checked by
- nobody independent of its authors yet
Erdos 1054: conditional divisor-prefix classification
- authors
- Hyunsik (hschae)
- method
- agent — GPT-6 (Codex)
- review
- self-assessed — self-assessed; local build and three-kernel comparator validation passed (Jason (Codex agent))
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Erdos Problem 1054 verifier — adapts; The ternary Goldbach conjecture is true — background; Approximate formulas for some functions of prime numbers — background
- related
- pntpp:35fa8a2d09a9aa334f89b8eb67e35ee3cba8e4e5 — builds-on
- divergences
- Analytic inputs remain conditional. The two imported admitted prime-counting estimates became explicit theorem parameters, with unchanged mathematical content. Finite large and small ranges use new subset-sum dynamic programs, proved sound, rather than the original native certificate search. Fixed real comparisons use rational exponential bounds. The divisor-prefix conclusion is unchanged.
- checked by
- nobody independent of its authors yet
Erdős 1054: sums of smallest divisors
- authors
- Linmiao Xu
- method
- agent
- review
- agent-reviewed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 21 main results named, checked with Comparator, with an alignment table
- sources
- Principia Erdős 1054 proof and almost-all Goldbach master — adapts, authors not-contacted; The exceptional set in Goldbach's problem — background, authors not-contacted; Erdős Problem 1054: sums of smallest divisors — background
- related
- google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1054.lean — builds-on; ajirving/PrimeNumberTheoremAnd/tree/769d3b81fbff001d9fa7028df0168a8e546cf692 — builds-on; hanwenzhu/LeanArchitect/tree/78dd66840d3efe8c824c699fc03381cec817c271 — builds-on
- divergences
- None. Challenge.lean, Statement.lean, and Solution.lean preserve the exact zero-padded Nat.nth/Nat.find definition of f(n), the Set.HasDensity 1 partial-density expression, and all three original question formulations from FormalConjectures/ErdosProblems/1054.lean, while also proving the stronger subtype-restricted limsup_on_every_density_one and littleO_on_subtype_imp_represented_density_zero.
- checked by
- Palomar
Erdos 1054: conditional divisor-prefix classification
- authors
- Hyunsik (hschae)
- method
- agent — GPT-6 (Codex)
- review
- self-assessed — self-assessed; local build and three-kernel comparator validation passed (Jason (Codex agent))
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- sources
- Erdos Problem 1054 verifier — adapts; The ternary Goldbach conjecture is true — background; Approximate formulas for some functions of prime numbers — background
- related
- pntpp:35fa8a2d09a9aa334f89b8eb67e35ee3cba8e4e5 — builds-on
- divergences
- Analytic inputs remain conditional. The two imported admitted prime-counting estimates became explicit theorem parameters, with unchanged mathematical content. Finite large and small ranges use new subset-sum dynamic programs, proved sound, rather than the original native certificate search. Fixed real comparisons use rational exponential bounds. The divisor-prefix conclusion is unchanged.
- checked by
- nobody independent of its authors yet
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 · 3
Recorded elsewhere
Compare the registries- palomar — Erdős 1054: sums of smallest divisors
Also known as · 3
- https://www.erdosproblems.com/1054
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1054.lean
- FormalConjectures/ErdosProblems/1054.lean
Cite this record
qed.bot, “Erdős Problem 1054”, https://qed.bot/s/erdos-1054, as of 20 Nov 2026.