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.

Sources

The source's own material, retained exactly.

17 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

357.lean

Retained formal statement13 of 17

Let h(n)h(n) be the maximal kk such that there exist integers 1≤a1≤…≤ak≤n1 \le a_1 \leq \dotsc \leq a_k \le n such that all sums of the shape ∑u≤i≤vai\sum_{u \le i \le v} a_i are distinct. How does h(n)h(n) grow? Can we find a (good) explicit function gg such that h=O(g)h = O(g) ?

FormalConjectures/ErdosProblems/357.leanErdos357.erdos_357.variants.monotone.parts.ii.bigO_version_symm1 lineExact file
(fun n => ↑(Erdos357.h n)) =O[Filter.atTop] sorry
OpenStatement only, no proof