The board / number theory / #331
Erdős Problem #331
DISPROVED LEANdatabase updated 2026-01-31
The statement as posed is false. A solution has also been checked by machine, in Lean.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Let \(A,B\subseteq \mathbb{N}\) such that for all large \(N\[\)\lvert A\cap \{1,\ldots,N\}\rvert \gg N^{1/2}\]and\[\lvert B\cap \{1,\ldots,N\}\rvert \gg N^{1/2}.\] Is it true that there are infinitely many solutions to \(a_1-a_2=b_1-b_2\neq 0\) with \(a_1,a_2\in A\) and \(b_1,b_2\in B\)? Ruzsa has observed that there is a simple counterexample: take \(A\) to be the set of numbers whose binary representation has only non-zero digits in even places, and \(B\) similarly but with non-zero digits only in odd places. It is easy to see \(A\) and \(B\) both grow like \(\gg N^{1/2}\) and yet for any \(n\geq 1\) there is exactly one solution to \(n=a+b\) with \(a\in A\) and \(b\in B\). This was formalized in Lean by van Doorn using Aristotle.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 1 further variant / known partial result in the Lean file. The authoritative wording is on erdosproblems.com/331.Prizenone
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/331
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.