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

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:eeedff03d1f399cece2836043efb36ec29af4b0d8ea202446fe5d770b283c15b
Metadata: sha256:5903986dcae25761b721ccdd8fed9fe5366c744d843a4b2ea0de3283bfe35d61
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:ee2f1bd93d85bb8166b015a5b378c67f4947290d2ffa49be1179d95d61c2561e

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science