qedbot

Erdős·erdos:42

Erdős Problem 42: Maximal Sidon Sets and Disjoint Difference Sets

problem formal record: solved source: solved (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, sidon sets, additive combinatorics·Source

AI activity

How grades work
Codex, GPT-5.2, GPT-5.2 Pro

19 Jan 2026

Partial result (Lean)

partial A3 V2 F2
Reasoning and sources

Autonomy

AI standalone; human involvement recorded as non-significant

GPT-5.5 Pro

27 Apr 2026·with Harjas Sandhu

Full solution

full A1 V1 F2
Reasoning and sources

Autonomy

AI collaborating with humans

Codex, GPT-5.5 Pro

10 May 2026·supporting task

GPT-5.5 Pro (2026)

full A1 V1 F2
Reasoning and sources

Autonomy

Secondary contribution: formalization

Details

proof to formalize: GPT-5.5 Pro (2026)

Fidelity

How fidelity is graded

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

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

Recorded elsewhere

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

    checked·machine-led·their labels: lean-verified, ai-discovered

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

Cite this record

qed.bot, “Erdős Problem 42: Maximal Sidon Sets and Disjoint Difference Sets”, https://qed.bot/s/erdos-42, as of 30 Sep 2026.

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