Erdős Problem #866

Erdős problem #866 · erdosproblems.com/866

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

Result

Proved(see note)

Status

Partial result

AI contribution

AI-discovered

Method

Argument

Field

Additive Combinatorics

Posed by

—

Year posed

—

Years open

—

Solved

2026-07-08

Model

Demonstrandum multi-agent pipeline

Vendor

—

Collaborators

—

Verification

Lean-verified

Publication

Announced

Significance

10 / 100*

Disclosed cost

—

Wikipedia

No dedicated article