Erdős·erdos:392
Erdős Problem 392
No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.
Fidelity F2: The statement corpus cites this proof against its own statement.
number theory, factorials·Source
AI activity
How grades workTao (2026)
Reasoning and sources
Autonomy
Secondary contribution: formalization
Details
proof to formalize: Tao (2026)
Sources
Tao (2026)
Reasoning and sources
Autonomy
Secondary contribution: rewriting
Details
argument to rewrite: Tao (2026)
Sources
Fidelity
How fidelity is gradedF2 declared. The statement corpus cites this proof against its own statement.
Declared by the projects
1As each project's formalization.yaml states it.
Erdos problem 392: decomposing a factorial into few factors of size at most n^2
- authors
- Terence Tao
- method
- agent — Claude Opus 5 (Anthropic)
- review
- self-assessed (Terence Tao)
- sources
- Erdos problem 392, forum thread — formalizes; Decomposing a factorial into large factors — background
- related
- AlexKontorovich/PrimeNumberTheoremAnd — builds-on
- 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
Also known as · 3
- https://www.erdosproblems.com/392
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/392.lean
- FormalConjectures/ErdosProblems/392.lean
Cite this record
qed.bot, “Erdős Problem 392”, https://qed.bot/s/erdos-392, as of 20 Nov 2026.