Skip to content

Erdős problem 853

Let dn=pn+1pnd_n = p_{n+1} - p_n, where pnp_n is the nnth prime. Let r(x)r(x) be the smallest even integer tt such that dn=td_n = t has no solutions for nxn \le x.

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:9df40aa3384c3dbb0c0b71c84b125be302fa0afcedc25dca2a37c7d5ec05da44
Metadata
sha256:d5d5cf246b193a12190b7b0668462fb3ff79b1b345ae311abfcabe65c107cd45
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:dd19bd482953e3feff405d06f2b91aea0daeb288beef6c8a9defaf434a47b3c0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page