Erdős problem 1063 · problems.science

Estimate $n_k$ by finding a better upper bound.

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:40b7f54a3fb9f550922c6ec40788095b248d623602de3ff61b1c5ff5f39e5c48
Metadata: sha256:3691e68119c2d95d84c098f156d6cdf5298b13868e147e738884b53f27e5e34e
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:e5d01c3a836458bac70e003e341eaf41e0eddedf3350ff007083348c2faa648b

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