Skip to content

Erdős problem 357

Let f(n)f(n) be the maximal kk such that there exist integers 1≤a1<…<ak≤n1 \le a_1 < \dotsc < a_k \le n such that all sums of the shape ∑u≤i≤vai\sum_{u \le i \le v} a_i are distinct. It is known that f(n)≥(2+o(1))nf(n) \geq (2+o(1))\sqrt{n}. Source: See comment by Desmond Weisenberg here: https://www.erdosproblems.com/forum/thread/357.

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:dc9af4754e223c6246db546d891403ba9e6a73e2be825017396b87e09f2ca6b2
Metadata
sha256:0b60400d645557041dc6a347ef1b149e6e176d46ec86df149ad9f25a9f06ac90
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7dafba7eb77fb4d3ad5dc51312f4c5a74a536a0f02b175b1435120f4de40e259
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb