Math 2.0

Number theory Conjecture

Erdős conjecture on arithmetic progressions

Builds on Szemerédi's theorem

Statement

Let AA be a set of positive integers such that the series ∑a∈A1/a\sum_{a \in A} 1/a diverges. Then for every integer k≥1k \ge 1, the set AA contains an arithmetic progression of length kk with nonzero common difference.

Remarks

The conjecture is open for each k≥4k \ge 4. The case k=3k = 3 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Limit superior concept
  2. Szemerédi's theorem statement
  3. Erdős conjecture on arithmetic progressions conjecture

Further reading

  1. Web https://en.wikipedia.org/wiki/Erd%C5%91s_conjecture_on_arithmetic_progressions
About this page
TagFN978TDX67
URIm2://FN978TDX67
Kindconjecture
WritingW0 stub
MSC11B25, 05D10
StatusThis copy of the site has no build data. Run m2 status FN978TDX67.
AboutSzemerédi's theorem
UsesSzemerédi's theorem
Same as
Changed2 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.