Skip to content

Erdős problem 357

Let f(n)f(n) be the maximal kk such that there exist integers 1a1<<akn1 \le a_1 < \dotsc < a_k \le n such that all sums of the shape uivai\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.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:7dafba7eb77fb4d3ad5dc51312f4c5a74a536a0f02b175b1435120f4de40e259
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page