Erdős Problem #1196 — Primitive Sets Above a Threshold
Is it true that, for every , if is a primitive set of integers—meaning that whenever and , the integers and are associated, hence equal—then
where the term tends to as ? Formally, does there exist a function with such that, for every natural number and every primitive set ,
Progress summary
A 2026 paper proves the conjecture, with a stronger error bound,.
The Erdős–Sárközy–Szemerédi conjecture, recorded from 1966, asks whether every primitive set above has weighted reciprocal sum at most . The question is Erdős Problem #1196.
Known results
- Lichtman (2023): upper bound .
- Lichtman (2020): for integers with exactly prime factors, a lower bound with error .
- Gorodetsky, Lichtman, and Wong (2024): asymptotic deficit , with .
2026 quantitative proof
Alexeev, Barreto, Li, Lichtman, Price, Shah, Tang, and Tao state Theorem 1.1: for every primitive , . The method was suggested by GPT-5.4 Pro, while the paper presents the proof as the authors’ work.
Solutions 0
No solutions have been posted yet.