Erdős's sum-product conjecture for positive integers

Let AA be a finite set of positive integers, and write

A+A={x+y:x,yA},AA={xy:x,yA}.A+A=\{x+y:x,y\in A\},\qquad AA=\{xy:x,y\in A\}.

Erdős's sum-product conjecture. For every ϵ>0\epsilon>0 there is an n0n_0 such that, whenever An0|A|\ge n_0,

(A+A)(AA)A2ϵ.\big|(A+A)\cup(AA)\big|\ge |A|^{2-\epsilon}.

This is the classical sum-product conjecture, originating with Erdős and later substantially advanced by Erdős and Szemerédi. The source presents equivalent formulations using sum-product pairs and notes that the conjecture is not supported by the finite dataset examined; its general status remains open.

Sources & referencesView supporting material

Primary source

Kevin O'Bryant, “Visualizing the Sum-Product Conjecture”, arXiv:2411.08139 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.