Skip to content
Level A · Machine-checkable Hard Number theory P-erdos-14

Erdős Problem #14

Let A ⊆ ℕ. Let B ⊆ ℕ be the set of integers which are representable in exactly one way as the sum of two elements from A. Is it true that for all ε > 0 and large N, |1,…,N ∖ B| ≫_ε N^1/2 - ε?

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Start working on it Submit a claim Follow
Cite
@misc{cairn-erdos-14,
  title        = {Erdős Problem #14},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/erdos-14}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff · Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

erdos_14.parts.i. Let . Let be the set of integers which are representable in exactly one way as the sum of two elements from . Is it true that for all and large , ?

erdos_14.parts.ii. Is it possible that ?

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.ErdosProblems.«14» (2 statements). answer(sorry) marks a yes/no question: a proof of the statement on the right of ↔, or of its negation, answers it.

theorem erdos_14.parts.i :
    answer(sorry) ↔ ∀ A, ∀ ε > 0, nonUniqueSumCount A ≫ almostSquareRoot ε
theorem erdos_14.parts.ii :
    answer(sorry) ↔ ∃ (A : Set ℕ), IsLittleO atTop (nonUniqueSumCount A) squareRoot

What counts as progress

  • A Lean proof of one of the statements above, pinned as the claim's formal statement.
  • Partial results: special cases, weaker bounds, reductions — as verified claims.
  • Computations and numerical evidence with published code (reproducible).
  • Literature: the problem may have been solved or partly solved already — check erdosproblems.com/14. Report it as a literature claim.
  • A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

erdosproblems.com/14

Source and licence

Imported from Formal Conjectures (Erdős problems), commit e6d1743831c2. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.