Skip to content

Erdős problem 769

Start work

For the least cutoff c(n)c(n) after which every kk occurs as the number of homothetic cubes in a decomposition of the unit nn-cube, is c(n)≫nnc(n) \gg n^n? The Lean proof shows c(n)=o(nn)c(n) = o(n^n) along odd dimensions.

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:91b17650568d365bab9851c9e1711d1a4864092c543a0ee320ad5b3ef5e6dbaa
Metadata
sha256:598f281a830621adcc999b653e94bb9e04e8578694bbdfd70b74ebee2874de23
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:eff10fb8b4e4939b2c60cbe5e58672bc22f1a18dfd89d0697e1ecb58b128d8d1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON