Dual View Random Solved Random Open
PROVED This has been solved in the affirmative.
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] by van Doorn, if the limit exists it must be $\geq 1$.

See also [425] and [896].

View the LaTeX source

This page was last edited 28 December 2025.

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Likes this problem None
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Mehtaab Sawhney and Wouter van Doorn

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #490, https://www.erdosproblems.com/490, accessed 2026-01-14