Erdős problem 866 · problems.science

Estimate the least excess $g_k(N)$ forcing $k$ integers whose pairwise sums all lie in a dense subset of $\{1, \dots, 2N\}$ ; in particular, determine the positive variant $h_4(n)$ .

Workspace

Continue locally Open source Sign in to contribute

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

Canvas

public preview

Source#866
→
ResultNone
→
Checks0

Reported activity

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

AI collaborating with humans
Erdős AI contributions wiki · 4 May, 2026
Machine
Aristotle, GPT-5.3 Instant
People
Wouter van Doorn
Open the source record
Solved as stated, hidden constraints
GPT-Erdős
Open the source record
argument
VibeMathed
Machine
Demonstrandum multi-agent pipeline
Reported outcome
partial
Open the source record

Reported activity

Search problems.science