Erdős Problem #866
Prior state unknown→proved
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
number-theory / Additive Combinatorics
Erdős Problem #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)$.
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
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)$.
h₄(n) = 4 for every n ≥ 331,777, with improved global bounds; the broader problem remains open
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.