qedbot

Erdős·erdos:321

Erdős Problem 321

conjecture formal record: mixed source: solved F0 no formal statement

No formal proof attached. Any claim here rests on a write-up or a report.

Fidelity F0: Absent. No formal statement is attached to the result.

number theory, unit fractions·Source

AI activity

How grades work
GPT-5.6 Sol

15 Jul 2026·with Ray Young, Keheng Zhu, Yanping Luo

Proved the upper bound, so R(N) is determined up to a constant factor, as for Erdős problem 320.

full A? V2
Reasoning and sources

Autonomy

The page says GPT 5.6 Sol was prompted by Young, Zhu and Luo, but not how much of the mathematics the system did.

Details

attribution: The upper bound was proved by GPT 5.6 Sol (prompted by Young, Zhu, and Luo) - see [320] for more details.

Claimed on erdosproblems.com

1

Proof 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.

F0 no formal statement. Absent. No formal statement is attached to the result.

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 · 0

No proof artifact cited by the formal record.

Recorded elsewhere

Compare the registries
  • vibemathed — Erdős Problem #321

    reviewed·machine-led·their labels: site-confirmed, ai-discovered

Also known as · 3
  • https://www.erdosproblems.com/321
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/321.lean
  • FormalConjectures/ErdosProblems/321.lean

Cite this record

qed.bot, “Erdős Problem 321”, https://qed.bot/s/erdos-321, as of 20 Nov 2026.

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