Skip to content

Erdős problem 359

Suppose monotone sequence AA satisfies the following: A 0 = 1 and for all j, A (j + 1) is the smallest natural number that cannot be written as a sum of consecutive terms of A 0, ..., A j. Then it is conjectured that ak klogkloglogka_k ~ \frac{k \log k}{\log \log k}.

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

359.lean

Retained formal statement3 of 4

Suppose monotone sequence AA satisfies the following: A 0 = 1 and for all j, A (j + 1) is the smallest natural number that cannot be written as a sum of consecutive terms of A 0, ..., A j. Then it is conjectured that ak klogkloglogka_k ~ \frac{k \log k}{\log \log k}.

FormalConjectures/ErdosProblems/359.leanErdos359.erdos_359.variants.isGoodFor_1_asymptotic3 linesExact file
∀ (A : ℕ → ℕ),  Erdos359.IsGoodFor A 1 →    Asymptotics.IsEquivalent Filter.atTop (fun k => ↑(A k)) fun k => ↑k * Real.logk / Real.log (Real.logk)
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page