Erdős problem 400 · problems.science

Erdős and Graham write that it is easy to show that $g_k(n) \ll_k \log n$ always, but the best possible constant is unknown.

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:94c52f9bd549fe66f6937f9d2a8dbc6c79ffc4289c4622efb777ca07fc292556
Metadata: sha256:500ce05c8eaba8c5cf6cfbd86fe59263e4711fdeb173f04c1e48632b864c4a83
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:60e5d375d8678cc5bb698ad03bd1621f64aede383597e655d2dfc4ca6a705ba4

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