Skip to content

Erdős problem 853

Let dn=pn+1−pnd_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 n≤xn \le x.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:dd19bd482953e3feff405d06f2b91aea0daeb288beef6c8a9defaf434a47b3c0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb