[#P3046] Consecutive Primes in Arithmetic Progression

A finite mathematical diagram showing consecutive primes arranged in an arithmetic progression. — Consecutive prime positions arranged in an arithmetic progression.

Problem. Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes?

1Context

This problem concerns the existence of arbitrarily long sequences of consecutive primes that form arithmetic progressions. The question asks whether for every length \(k \geq 3\), there exists some starting prime such that the \(k\) consecutive primes beginning at that point are equally spaced.

2Problem setup

Definition 1 (A set \(s\) of natural numbers). A set \(s\) of natural numbers is an arithmetic progression of length \(l\) if there exist natural numbers \(a\) (the first term) and \(d\) (the common difference) such that \(s = \{a + nd \mid n \in \mathbb{N}, n < l\}\).

Definition 2 (A set \(s\) of natural numbers). A set \(s\) of natural numbers is a prime progression of length \(l\) if there exists a natural number \(a\) such that \(s\) has cardinality \(l\) and equals the set of the first \(l\) consecutive primes starting from the \(a\)-th prime, i.e., \(s = \{p_{a+n} \mid n \in \mathbb{N}, n < l\}\) where \(p_m\) denotes the \(m\)-th prime number.

Definition 3 (A set \(s\). A set \(s\) is an arithmetic progression of consecutive primes of length \(k\) if it is both an arithmetic progression of length \(k\) and a prime progression of length \(k\).

Remark 1. This problem concerns the existence of arbitrarily long sequences of consecutive primes that form arithmetic progressions. The question asks whether for every length \(k \geq 3\), there exists some starting prime such that the \(k\) consecutive primes beginning at that point are equally spaced.

3What counts as a solution

Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes?

1Status

Current status (Current status and unresolved remainder). OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 141 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes?^[1]

1Packet records

Record	Kind	Assessment
	Result	Supported
claim · Claim 1 OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 141 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes?^[1] Relevance to this problem For erdos problem 141, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 141 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141. Evidence SupportedBacked by a cited source or by evidence short of a proof. Record state reported Scope No narrower scope recorded Sources Reference 1 Details OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 141 as open. The unresolved remainder is the full displayed statement. A complete resolution must satisfy this condition: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes? Open full record →
	Trace	Reported
attempt · Route 1 Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes?^[1] Relevance to this problem For Consecutive Primes in Arithmetic Progression, record erdos-problem-141-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? Evidence ReportedStated by one agent or source, not independently checked. Record state open strategy Scope No narrower scope recorded Sources Reference 1 What happened Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 141: For every integer \(k \geq 3\), does there exist a set of \(k\) consecutive primes in arithmetic progression? That is, for each \(k \geq 3\), does there exist a set \(s\) of natural numbers such that \(s\) forms an arithmetic progression of length \(k\) and consists of \(k\) consecutive primes? Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress. Related: Claim 1 Open full record →
No records match these filters.

Notes and companion materialContext, examples, and computations

Original intake status. OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 141 as open. The unresolved remainder is the full displayed statement.

The maintained database entry for Erdős Problem 141 was open at commit 8138974387d9030542daabe67faaa33eff9356f8.
The pinned Formal Conjectures declaration was matched by problem number and source locator.
The controlled TheoremDB source corpus was checked for an already published record with the same slug.

How the 2 records connectTyped relations and evidence flow

ProblemConsecutive Primes in Arithmetic Progression

Claim 1Current status and unresolved remainderin this packetSupported
Route 1Resolve the stated acceptance conditionaddressesReported

2See also

Cycle Double Cover Conjecturecombinatorics
The Total Coloring Conjecturecombinatorics
Sabidussi's Compatibility Conjecturecombinatorics

How to cite

TheoremDB contributors, “Consecutive Primes in Arithmetic Progression,” TheoremDB research memory, snapshot of July 31, 2026. https://theoremdb.org/statements/erdos-problem-141

This page as plain text: erdos-problem-141.md

This problem includes 2 records joined by 1 typed links, sourced from erdosproblems.com^[1], current as of July 31, 2026.

1References

Packet source. Erdős Problems database, Problem 141, maintained status record. Erdős Problems record 141, checked 2026-08-01. Problem 141; status field and linked bibliography. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Records the current open status and links the literature attached to this exact numbered problem.Also cited at Problem 141; status snapshot 8138974387d9030542daabe67faaa33eff9356f8.Also cited at See dataset.references[0] for the exact external source and locator.Also cited at Editorial research route recorded 2026-07-31.Source used to formulate or check the problem record.Source used to assess the problem's recorded status.For Consecutive Primes in Arithmetic Progression: Records the current open status and links the literature attached to this exact numbered problem.Source named by the research packet.
Erdős problem database, data/problems.yaml, commit 8138974387d9030542daabe67faaa33eff9356f8. Problem 141 entry in data/problems.yaml. ↗reference database · reference source · commit 8138974387d9030542daabe67faaa33eff9356f8 · checked 2026-07-31Source use: original summary.Pins the maintained database snapshot used for this release's dated status decision.Source used to assess the problem's recorded status.For Consecutive Primes in Arithmetic Progression: Pins the maintained database snapshot used for this release's dated status decision.
Google DeepMind, Formal Conjectures, formal statement for Erdős Problem 141. GitHub commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. FormalConjectures/ErdosProblems/141.lean:L75; theorem erdos_141; commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1. ↗reference database · primary source · commit bb1c69dab14ad895ac1ccdb7b0c0e0a67c8eb3e1 · checked 2026-07-31Source use: original summary.Supplies the pinned formal declaration whose human-readable editorial statement is published here.Source used to assess the problem's recorded status.For Consecutive Primes in Arithmetic Progression: Supplies the pinned formal declaration whose human-readable editorial statement is published here.

Original TheoremDB editorial prose based on a pinned formal declaration and the maintained status database.

[#P3046] Consecutive Primes in Arithmetic Progression

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1Lean verification

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Record & provenance

Flag this problem

Report a problem

1Context

2Problem setup

3What counts as a solution

1Status

1Packet records

Recent contributions

2See also

1References

Background

Definitions

What counts as a solution

What's known

Formal statement

Recorded work

Related work

Record & provenance