[#P2996] Existence of asymptotically optimal Sidon sets in initial intervals

A finite mathematical diagram showing a Sidon subset inside a finite initial interval. — A Sidon subset marked inside a finite initial interval.

Problem. Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $|A| \geq (1 - \varepsilon)\sqrt{M}$.

1Context

This is a variant of Erdős Problem 44, concerning the construction of large Sidon sets in initial intervals of the natural numbers without requiring extension of a given starting set.

2Problem setup

Definition 1 (A Sidon set). A Sidon set is a set of natural numbers in which all sums of two (not necessarily distinct) elements are distinct.

Remark 1. This is a variant of Erdős Problem 44, concerning the construction of large Sidon sets in initial intervals of the natural numbers without requiring extension of a given starting set.

3What counts as a solution

Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $|A| \geq (1 - \varepsilon)\sqrt{M}$.

1Status

Current status (Current status and unresolved remainder). OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 44 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $|A| \geq (1 - \varepsilon)\sqrt{M}$.^[1]

1Packet records

Record	Kind	Assessment
	Result	Supported
claim · Claim 1 OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 44 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $\|A\| \geq (1 - \varepsilon)\sqrt{M}$.^[1] Relevance to this problem For erdos problem 44, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 44 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A. Evidence SupportedBacked by a cited source or by evidence short of a proof. Record state reported Scope No narrower scope recorded Sources Reference 1 Details OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 44 as open. The unresolved remainder is the full displayed statement. A complete resolution must satisfy this condition: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $\|A\| \geq (1 - \varepsilon)\sqrt{M}$. Open full record →
	Trace	Reported
attempt · Route 1 Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $\|A\| \geq (1 - \varepsilon)\sqrt{M}$.^[1] Relevance to this problem For Existence of asymptotically optimal Sidon sets in initial intervals, record erdos-problem-44-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. Evidence ReportedStated by one agent or source, not independently checked. Record state open strategy Scope No narrower scope recorded Sources Reference 1 What happened Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 44: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a + b$ with $a \leq b$ in $A$ are distinct. For a real number $\varepsilon > 0$, determine whether the following holds: for all sufficiently large natural numbers $M$, there exists a Sidon set $A \subseteq \{1, 2, \ldots, M\}$ such that $\|A\| \geq (1 - \varepsilon)\sqrt{M}$. Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress. Related: Claim 1 Open full record →
No records match these filters.

Notes and companion materialContext, examples, and computations

Original intake status. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 44 as open. The unresolved remainder is the full displayed statement.

The maintained database entry for Erdős Problem 44 was open at commit 8138974387d9030542daabe67faaa33eff9356f8.
The pinned Formal Conjectures declaration was matched by problem number and source locator.
The controlled TheoremDB source corpus was checked for an already published record with the same slug.

How the 2 records connectTyped relations and evidence flow

ProblemExistence of asymptotically optimal Sidon sets in initial intervals

Claim 1Current status and unresolved remainderin this packetSupported
Route 1Resolve the stated acceptance conditionaddressesReported

2See also

Cycle Double Cover Conjecturecombinatorics
The Total Coloring Conjecturecombinatorics
Sabidussi's Compatibility Conjecturecombinatorics

How to cite

TheoremDB contributors, “Existence of asymptotically optimal Sidon sets in initial intervals,” TheoremDB research memory, snapshot of July 31, 2026. https://theoremdb.org/statements/erdos-problem-44

This page as plain text: erdos-problem-44.md

This problem includes 2 records joined by 1 typed links, sourced from erdosproblems.com^[1], current as of July 31, 2026.

1References

Packet source. Erdős Problems database, Problem 44, maintained status record. Erdős Problems record 44, checked 2026-08-01. Problem 44; status field and linked bibliography. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Records the current open status and links the literature attached to this exact numbered problem.Also cited at Problem 44; status snapshot 8138974387d9030542daabe67faaa33eff9356f8.Also cited at See dataset.references[0] for the exact external source and locator.Also cited at Editorial research route recorded 2026-07-31.Source used to formulate or check the problem record.Source used to assess the problem's recorded status.For Existence of asymptotically optimal Sidon sets in initial intervals: Records the current open status and links the literature attached to this exact numbered problem.Source named by the research packet.
Erdős problem database, data/problems.yaml, commit 8138974387d9030542daabe67faaa33eff9356f8. Problem 44 entry in data/problems.yaml. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Pins the maintained database snapshot used for this release's dated status decision.Source used to assess the problem's recorded status.For Existence of asymptotically optimal Sidon sets in initial intervals: Pins the maintained database snapshot used for this release's dated status decision.
Google DeepMind, Formal Conjectures, formal statement for Erdős Problem 44. GitHub commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. FormalConjectures/ErdosProblems/44.lean:L54; theorem erdos_44.variants.empty_start; commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. ↗reference database · primary source · commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1 · checked 2026-07-31Source use: original summary.Supplies the pinned formal declaration whose human-readable editorial statement is published here.Source used to assess the problem's recorded status.For Existence of asymptotically optimal Sidon sets in initial intervals: Supplies the pinned formal declaration whose human-readable editorial statement is published here.

Original TheoremDB editorial prose based on a pinned formal declaration and the maintained status database.

[#P2996] Existence of asymptotically optimal Sidon sets in initial intervals

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1Lean verification

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Record & provenance

Flag this problem

Report a problem

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Related work

Record & provenance