Erdős problem 688 · problems.science

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

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:6ef2b54bac4d58f720ee3f6aaf9eeec8a9fd74879cc5415cb82e05f5b1bdc08a
Metadata: sha256:3e02171f8fdd29a2a34cbe2d50de883c201005cd85ac6d5e8ea86c895a53ddee
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:9fe5cc9780a0e4f68c8c8293374cf7edcc2ffcd199d6166f0581a7b107fdedf1

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207