The board / number theory / #490
Erdős Problem #490
PROVED LEANdatabase updated 2026-05-22
The statement as posed is true, and a proof exists. 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 \{1,\ldots,N\}\) be such that all the products \(ab\) with \(a\in A\) and \(b\in B\) are distinct. Is it true that \[\lvert A\rvert \lvert B\rvert \ll \frac{N^2}{\log N}?\] This would be best possible, for example letting \(A=[1,N/2]\cap \mathbb{N}\) and \(B=\{ N/2<p\leq N: p\textrm{ prime}\}\). This is true, and was proved by Szemerédi [Sz76]. In [Er72] Erdős goes on to ask whether \[\lim_{N\to \infty}\max_{A,B\subseteq [N]}\frac{\lvert A\rvert\lvert B\rvert\log N}{N^2}\] exists, where the maximum is over \(A\) and \(B\) with all the products \(ab\) distinct, and to determine its value. As noted in the comments to [896](https://www.erdosproblems.com/896) by van Doorn, if the limit exists it must be \(\geq 1\). See also [425](https://www.erdosproblems.com/425) and [896](https://www.erdosproblems.com/896).
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/490.Prizenone
Topicsnumber theory
Statement in LeanFormal Conjectures
Solution in Leanyes
OEISA397205
Original pageerdosproblems.com/490
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.