Erdős problem 866
Estimate the least excess forcing integers whose pairwise sums all lie in a dense subset of ; in particular, determine the positive variant .
Sources
Retained excerpts/
VibeMathed
Retained source excerpt
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)$.
Open exact source location