Erdős Problem #769
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, geometry.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
Let c(d) be the smallest integer K such that for EVERY k≥K, the d-dimensional unit cube can be partitioned into exactly k positive-volume cubes homothetic to the original, with possibly unequal sizes. Erdős asked for sharp estimates, particularly whether c(d)≫d^d. The problem remains OPEN, and one must not require all pieces to have the SAME size: that would allow only special counts k=t^d.
A small example
A square can be divided into 2×2 equal quarter squares (k=4). Replacing one of those squares by four squares of half its side yields k=7. These are exact admissible homothetic tilings and illustrate how replacing one cube by 2^d subcubes increases the piece count by 2^d−1. The maintained site gives c(2)=6, which cannot be inferred from just examples k=4 and k=7; it requires proving all k≥6 are possible and k=5 is not.
What is known
Hadwiger obtained lower c(d)≥2^d+2^(d−1); Connor–Marmorino (2018) improved it to c(d)≥2^(d+1)−1 for d≥3. Burgess–Erdős gave c(d)≪d^(d+1); Connor–Marmorino upper c(d)≤e²d^d if d+1 is composite and ≤1.8d^(d+1) if d+1 prime. Neither upper and lower proves c(d)≫d^d. Hudelson provided conditional smaller bounds depending on gcd(2^d−1,3^d−1). Historic original paper and exact tiling boundary conventions not independently checked.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: cube tiling c n geq c n^n open; homothetic unequal cubes. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Give explicit coordinates for d=2 k=4 and k=7 tilings, prove the replacement count k→k+2^d−1 for any admissible cubical partition, and inspect Connor–Marmorino 2018 lower proof and upper arithmetic threshold. Do not extrapolate a d^d lower bound.
Sources and claim boundaries
Maintained Erdős #769; authenticated GCL source return. Full original primary proofs and browser readback is a protected publication verification gate. source-qualified editorial review recorded.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2040 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: FORMAL_SOURCE_REFRESH_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.