Skip to content

Erdős problem 785

Let A,B⊆NA,B\subseteq \mathbb{N} be infinite sets such that A+BA+B contains all large integers. Let A(x)=∣A∩[1,x]∣A(x)=\lvert A\cap [1,x]\rvert and similarly for B(x)B(x). Is it true that if A(x)B(x)∼xA(x)B(x)\sim x then A(x)B(x)−x→∞A(x)B(x)-x\to \infty as x→∞x\to \infty?

Sources

The source's own material, retained exactly.

10 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

785.lean

Retained formal statement1 of 10

Let A,B⊆NA,B\subseteq \mathbb{N} be infinite sets such that A+BA+B contains all large integers. Let A(x)=∣A∩[1,x]∣A(x)=\lvert A\cap [1,x]\rvert and similarly for B(x)B(x). Is it true that if A(x)B(x)∼xA(x)B(x)\sim x then A(x)B(x)−x→∞A(x)B(x)-x\to \infty as x→∞x\to \infty?

A conjecture of Erdős and Danzer. The answer is yes, proved by Sárközy and Szemerédi [SaSz94], who actually proved that it is impossible for A(x)B(x)−x=o(A(x)).A(x)B(x)-x=o(A(x)).

FormalConjectures/ErdosProblems/785.leanErdos785.erdos_7856 linesExact file
True ↔  ∀ (A B : Set ℕ),    A.Infinite →      B.Infinite →        Erdos785.IsExactAdditiveComplement A B →          Filter.Tendsto (fun x => ↑(Erdos785.counting A x) * ↑(Erdos785.counting B x) - ↑x) Filter.atTop Filter.atTop
SolvedStatement only, no proof