Erdős conjecture on arithmetic progressions
Builds on Szemerédi's theorem
Statement
Let be a set of positive integers such that the series diverges. Then for every integer , the set contains an arithmetic progression of length with nonzero common difference.
Remarks
The conjecture is open for each . The case was proved by Bloom and Sisask in 2020, using quantitative bounds in Roth's theorem. The set of primes satisfies the hypothesis, since the sum of the reciprocals of the primes diverges. So the Green–Tao theorem is a special case of the conjecture. Every set of positive upper density satisfies the hypothesis, so the conjecture would strengthen Szemerédi's theorem.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Limit superior concept
- Szemerédi's theorem statement
- Erdős conjecture on arithmetic progressions conjecture
Further reading
About this page
| Tag | FN978TDX67 |
|---|---|
| URI | m2://FN978TDX67 |
| Kind | conjecture |
| Writing | W0 stub |
| MSC | 11B25, 05D10 |
| Status | This copy of the site has no build data. Run m2 status FN978TDX67. |
| About | Szemerédi's theorem |
| Uses | Szemerédi's theorem |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.