Skip to content

Erdős problem 42

Erdős Problem 42: Let M ≥ 1 and N be sufficiently large in terms of M. Is it true that for every maximal Sidon set A ⊆ {1,…,N} there is another Sidon set B ⊆ {1,…,N} of size M such that (A - A) ∩ (B - B) = {0}?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#42
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

  • AI standalone

    Erdős AI contributions wiki · 19 Jan, 2026

    Machine
    Codex, GPT-5.2, GPT-5.2 Pro
    Open the source record
  • AI collaborating with humans

    Erdős AI contributions wiki · 27 Apr, 2026

    Machine
    GPT-5.5 Pro
    People
    Harjas Sandhu
    Open the source record
  • Formalization

    Erdős AI contributions wiki · 10 May, 2026

    Machine
    Codex, GPT-5.5 Pro
    Open the source record
  • argument

    VibeMathed

    Machine
    GPT-5.5 Pro
    People
    Harjas Sandhu
    Reported outcome
    resolved
    Open the source record

Search problems.science

Find a Problem, Result, source, or page