ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

A+A={x+y:x,y∈A},AA={xy:x,y∈A}.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 ∣A∣≥n0|A|\ge n_0,

∣(A+A)∪(AA)∣≥∣A∣2−ϵ.\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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.