erdos_358.parts.ii

Let $A=\{a_1 < \cdots\}$ be an infinite sequence of integers. Let $f(n)$ count the number of solutions to \[n=\sum_{u\leq i\leq v}a_i.\] Is there an $A$ such that $f(n)\geq 2$ for all large $n$?

theorem erdos_358.parts.ii :
    answer(sorry) ↔ ∃ A, StrictMono A ∧ ∀ᶠ n in atTop, 2 ≤ f A n

Recent Submissions

No submissions yet. Be the first to attempt this problem.