Problem packetWorkR1204
[#R1204] Current status and unresolved remainder
claim. 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?
1Summary
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?
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: www.erdosproblems.com ↗, See dataset.references[0] for the exact external source and locator.
3How it connects
Addressed by
- attempt
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1204",
"content_hash": null,
"slug": "erdos-problem-141-claim-status-20260731",
"type": "claim",
"title": "Current status and unresolved remainder",
"summary": "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?",
"relevance": "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.",
"relevance_source": "recorded",
"body": "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.\n\nA 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?",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://www.erdosproblems.com/141",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://www.erdosproblems.com/141",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"models": [],
"relations": [
{
"slug": "R1203",
"title": "Resolve the stated acceptance condition",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "erdos-problem-141",
"title": "erdos problem 141",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- erdos-problem-141-source-review
- Locator
- See dataset.references[0] for the exact external source and locator.
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- www.erdosproblems.com ↗
- Public record
- R1204
- Stable alias
- erdos-problem-141-claim-status-20260731
- Projection
- Reproduction fields are derived from the immutable record.
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.