Vela

erdős #52 · sum-product problem

← #51 · #53 (packet.json; erdosproblems.com)

Let be a finite set of integers. Is it true that for every

Worked, still open.

number theory · open · prize $250 · formalized (Lean) · 0 attempts

machinery: additive-combinatorics,sum-product,multiplicative-energy,Szemeredi-Trotter-incidences,geometric

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

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

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 ↗

oeis

status

open

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 d1b1a3c126d2a035d9d7edd6156554b99318c065802bf5fcb4eb0120bbda5531

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.