Skip to content

Erdős problem 688

Erdős claims in [Er80] (p. 106) that it is not difficult to prove ϵn≫log⁡log⁡log⁡nlog⁡log⁡n\epsilon_n \gg \frac{\log\log\log n}{\log\log n}.

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:6ef2b54bac4d58f720ee3f6aaf9eeec8a9fd74879cc5415cb82e05f5b1bdc08a
Metadata
sha256:3e02171f8fdd29a2a34cbe2d50de883c201005cd85ac6d5e8ea86c895a53ddee
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:9fe5cc9780a0e4f68c8c8293374cf7edcc2ffcd199d6166f0581a7b107fdedf1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb