Erdős problem 769

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

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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

Open exact source location