Skip to content

Erdős problem 769

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.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:eff10fb8b4e4939b2c60cbe5e58672bc22f1a18dfd89d0697e1ecb58b128d8d1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page