Erdős problem 769 · problems.science

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.

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#769
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

construction
VibeMathed
Machine
GPT-5.6 starships (Claude Fable 5 reviewer)
Reported outcome
partial
Open the source record

Reported activity

Search problems.science