Skip to content

Erdős problem 400

Start work

Erdős and Graham write that it is easy to show that gk(n)≪klog⁡ng_k(n) \ll_k \log n always, but the best possible constant is unknown.

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:94c52f9bd549fe66f6937f9d2a8dbc6c79ffc4289c4622efb777ca07fc292556
Metadata
sha256:500ce05c8eaba8c5cf6cfbd86fe59263e4711fdeb173f04c1e48632b864c4a83
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:60e5d375d8678cc5bb698ad03bd1621f64aede383597e655d2dfc4ca6a705ba4
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON