Skip to content

Erdős problem 867

Is it true that if A={a1<⋯<at}⊆{1,…,N}A=\{a_1<\cdots <a_t\}\subseteq \{1,\ldots,N\} has no solutions to ai+ai+1+⋯+aj∈Aa_i+a_{i+1}+\cdots+a_j\in A then ∣A∣≤N2+O(1)?\lvert A\rvert \leq \frac{N}{2}+O(1)?

Sources

The source's own material, retained exactly.

6 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

867.lean

Retained formal statement4 of 6

The current best bounds are due to Coppersmith and Phillips [CoPh96], who prove that the maximal size of such an AA satisfies ∣A∣≤(23−1512)N+log⁡N.\lvert A\rvert \leq \left(\frac{2}{3}-\frac{1}{512}\right)N+\log N.

FormalConjectures/ErdosProblems/867.leanErdos867.erdos_867.variants.coppersmith_phillips_upper_bound2 linesExact file
∀ᶠ (N : ℕ) in Filter.atTop,  ∀ A ⊆ Finset.Icc 1 N, Erdos867.ConsecutiveSumFree A → ↑A.card ≤ (2 / 3 - 1 / 512) * ↑N + Real.log ↑N
SolvedStatement only, no proof