Skip to content

Erdős problem 4

Start work

Is it true that, for any C>0C > 0, there infinitely many nn such that: pn+1−pn>Clog⁡log⁡nlog⁡log⁡log⁡log⁡n(log⁡log⁡log⁡n)2log⁡n p_{n + 1} - p_n > C \frac{\log\log n\log\log\log\log n}{(\log\log\log n) ^ 2}\log n

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:3bd1240d13ddaec03c2d46a47900d7a16741ab71eea72d8aca739eccbea6f232
Metadata
sha256:45fb029566d848055c1739340c454f0930a5b2e7cd5d2694a96c30636d650081
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:de194f22ffa448e0eea870cc4ad3654b6c9cd86a02ee5829e0773317897bdddd
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON