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)$ .

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Proof manifests naming this Problem

PLBY Lean proofsErdosProblems.Erdos866b

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

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Proof manifests naming this Problem

Reported activity

Continue

Search problems.science