Skip to content

Erdős problem 14

Let A⊆NA ⊆ \mathbb{N}. Let B⊆NB ⊆ \mathbb{N} be the set of integers which are representable in exactly one way as the sum of two elements from AA. Is it true that for all ϵ>0\epsilon > 0 and large NN, ∣{1,…,N}∖B∣≫ϵN1/2−ϵ|\{1,\ldots,N\} \setminus B| \gg_\epsilon N^{1/2 - \epsilon}?

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

14.lean

Retained formal statement2 of 2

Is it possible that ∣{1,…,N}∖B∣=o(N12)|\{1,\ldots,N\} \setminus B| = o(N^\frac{1}{2})?

FormalConjectures/ErdosProblems/14.leanErdos14.erdos_14.parts.ii1 lineExact file
True ↔ ∃ A, Erdos14.nonUniqueSumCount A =o[Filter.atTop] Erdos14.squareRoot
OpenStatement only, no proof