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.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/769.lean

Formal Conjectures

FormalConjectures/ErdosProblems/769.leanErdos769.erdos_7691 lineExact file

1False ↔ Erdos769.Erdos769LowerBound

SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Proof manifests naming this Problem

William Blair Lean proofswilliamjblair:Erdos769.erdos769_lower_bound_false

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

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Proof manifests naming this Problem

Reported activity

Continue

Search problems.science