qedbot

Erdős·erdos:392

Erdős Problem 392

problem formal record: solved source: proved (Lean) F2 declared

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 work
Various

23 Feb 2026·supporting task

Tao (2026)

full A1 V1
Reasoning and sources

Autonomy

Secondary contribution: formalization

Details

proof to formalize: Tao (2026)

GPT-5.2 Thinking

27 Feb 2026·supporting task

Tao (2026)

full A1 V1
Reasoning and sources

Autonomy

Secondary contribution: rewriting

Details

argument to rewrite: Tao (2026)

F2 declared. The statement corpus cites this proof against its own statement.

reviewed by its authors only

Declared by the projects

1

As each project's formalization.yaml states it.

Erdos problem 392: decomposing a factorial into few factors of size at most n^2teorth/IEANTN/IEANTN/Nodes/Erdos392/v1 · joined by names · no independent check

Read formalization.yaml

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
checked by
nobody independent of its authors yet

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 2
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.

This record as plain text, with each claim, its grades and its sources.