Erdős Problem #866 — Let k≥ 3 and g_k(N) be minimal such that if A⊆ 1,…,2N has lvert Arvert ≥ N+g_k(N) then there exist integers b_1,…,b_k such that all binomk2 pairwise sums…
Statement
Let and be minimal such that if has then there exist integers such that all pairwise sums are in (but the themselves need not be in ). Estimate .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.