Skip to content

Erdős Problem #219

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, additive combinatorics, primes, arithmetic progressions.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

Are there arbitrarily long arithmetic progressions made entirely of prime numbers? For every positive integer \(k\), the question asks whether some prime \(p\) and positive integer step \(d\) satisfy

\[ p,\ p+d,\ldots,p+(k-1)d \]

with all \(k\) terms prime. The primes forming such a progression need not be consecutive in the ordered list of all primes.

A small example

The primes \(5,11,17,23\) form a four-term arithmetic progression with common difference six. The primes \(3,5,7\) form a three-term progression and are also consecutive primes, but consecutive-prime progressions are a much stronger requirement.

If a progression has more terms than a small prime modulus \(q\), then either its common difference is divisible by \(q\), or one of its terms is divisible by \(q\). For sufficiently large terms, the latter is impossible unless that term equals \(q\). This elementary modular obstruction explains why steps in long prime progressions have many small prime divisors. It does not make long progressions impossible.

What is known

PROVED. Ben Green and Terence Tao, The primes contain arbitrarily long arithmetic progressions, Annals of Mathematics 167 (2008), 481–547, established exactly the requested statement. Their argument combines a transference principle for pseudorandom majorants with Szemerédi-type density methods adapted to the primes.

The theorem is existential for every fixed length \(k\). It does not guarantee that those primes are consecutive, does not supply the optimal smallest terminal prime for each \(k\), and does not establish any particular rate for the longest progression below \(N\).

The stronger problem of arbitrarily long progressions of consecutive primes, stated in #141 and related to #218, remains open. The maintained Erdős #219 explicitly separates these formulations.

GCL's current state

Pinned and current status: PROVED. Original source issue #1488. A formal conjecture statement is present upstream, but GCL has not independently re-established the Green–Tao analytical proof or certified a kernel replay on the protected provider.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded successor enumerates primes to 10,000 and finds maximal example progressions of lengths three through five. Acceptance: every proposed term passes an exact primality test and all successive differences are identical; whether terms are consecutive is recorded separately. Stop at finite examples, not an independent proof of arbitrary lengths.

Sources and claim boundaries

No new prime-progression result, full independent proof verification or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1488 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction