Skip to content

Erdős problem 866

Start work

Estimate the least excess gk(N)g_k(N) forcing kk integers whose pairwise sums all lie in a dense subset of {1,…,2N}\{1, \dots, 2N\}; in particular, determine the positive variant h4(n)h_4(n).

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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

Exact provenance

Problem row
sha256:eeedff03d1f399cece2836043efb36ec29af4b0d8ea202446fe5d770b283c15b
Metadata
sha256:5903986dcae25761b721ccdd8fed9fe5366c744d843a4b2ea0de3283bfe35d61
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ee2f1bd93d85bb8166b015a5b378c67f4947290d2ffa49be1179d95d61c2561e
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON