Skip to content

Erdős Problem #141

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: 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

For each fixed integer \(k\ge3\), do some \(k\) successive primes, with no other primes between them, form an arithmetic progression? The progression's common difference must be positive. The word consecutive is essential: an arithmetic progression made entirely of primes need not consist of consecutive members of the ordered prime sequence.

A small example

The primes \(3,5,7\) are three consecutive primes, and their common difference is two. Thus the existence question is settled for \(k=3\), but this one example does not answer the question for every arbitrarily large \(k\). Finite searches have found such progressions for \(k\le10\). The related request for infinitely many such progressions is open even when \(k=3\).

What is known

OPEN for arbitrary lengths. Green and Tao proved that the primes contain arithmetic progressions of arbitrary finite length, but those primes are not required to be consecutive in the ordered list of all primes. Thus Green–Tao's theorem does not solve Erdős #141. The maintained problem #141 records the finite search boundary and the distinct infinitely-many question. Neither a finite table of longest examples nor the Green–Tao theorem proves that a consecutive-prime progression exists for every length.

GCL's current state

Pinned status OPEN and original issue #1410. The frozen Formal Conjectures 141 file separately defines successive primes and arithmetic progression. Its finite three-prime test is present, but the general assertion remains a research statement with a proof hole.

The original source assignment has an authenticated RESULT/1 report. This is unadjudicated source evidence, not a proof certificate or accepted article.

What remains

Enumerate consecutive-prime windows of lengths three through six below one million. Acceptance: independently test primality, verify absence of intervening primes, check constant differences, and record the exact largest inspected bound. Avoid claiming general existence or infinitely many occurrences from finite examples.

Sources and claim boundaries

No new prime-progression theorem, general-conjecture solution or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1410 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: PROTECTED_READY_BACKLOG.
  • 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