Skip to content

Erdős problem 6

There are infinitely many nn such that dn<dn+1<dn+2d_n < d_{n+1} < d_{n+2}, where dd denotes the prime gap function.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:fe317c552c99fc9f5357a53548af88f172d5192b0f45315ea864f97aae3bc588
Metadata
sha256:915835f21f3d30c627c6981678b56746391e7b06d7f4b13f6da018adfce25290
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:db19c0ab960407f5be042b351570d2d3643aa5d100d17b80c57305e4c97b7701
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb