Skip to content

Erdős problem 218

There are infinitely many indices nn such that the prime gap at nn is equal to the prime gap at n+1n+1. This is equivalent to the existence of infinitely many arithmetic progressions of length 33, see erdos_141.variants.infinite_three.

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:1f0311d5a43608c8d249c617e2ea21d926286c73fe30a4db53f9408721173550
Metadata
sha256:f367c899b08e7ed0503692dffbe841dbc2d116cdf264481c7af13aa9431687fa
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:26f0511e690437a290a0ecf5fd2e4a71e484d66d25db3c9bed3f796e55217142
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page