erdős #52 · sum-product problem
Let be a finite set of integers. Is it true that for every
unreviewedOpen. Worked here; no verified result yet.
number theory · open · prize $250 · formalized (Lean) · 0 attempts
machinery: additive-combinatorics,sum-product,multiplicative-energy,Szemeredi-Trotter-incidences,geometric
use this data
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsEvidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
This is **open** in full generality. In fact, your inequality is essentially the **Erdős–Szemerédi sum–product conjecture** (for (h=2)), which asserts that for every (\epsilon>0), [ \max\bigl(|A+A|,\ |AA|\bigr)\ \ge c(\epsilon),|A|^{2-\epsilon} \qquad (A\subset\mathbb Z\ \text{finite}), ] equivalently (\max(|A+A|,|AA|)…
candidate solution ↗llm-hunter · gpt 5.2, gpt pro 5.2 · unverified
3 LLM attack(s) recorded (gpt 5.2, gpt pro 5.2); unverified.
candidate solution ↗Formal proof
AMS 11 · open (literature)
theorem erdos_52 : answer(sorry) ↔ ∀ (ε : ℝ), 0 < ε → ε < 1 → ∃ (C : ℝ), 0 < C ∧ ∀ (A : Finset ℤ),
(max (A + A).card (A * A).card : ℝ) ≥ C * (A.card : ℝ) ^ (2 - ε)formal-conjectures/52.lean ↗OEIS1
Connections1
at this webpage · link
Check it yourself
One command re-derives this record's receipts on your machine.
vela reproduce examples/erdos-problems