Perfectly packing a cube by cubes of nearly harmonic sidelength
Abstract
Let d be an integer greater than 1, and let t be fixed such that 1d < t < 1d-1. We prove that for any n0 chosen sufficiently large depending upon t, the d-dimensional cubes of sidelength n-t for n ≥ n0 can perfectly pack a cube of volume Σn=n0∞ 1ndt. Our work improves upon a previously known result in the three-dimensional case for when 1/3 < t ≤ 4/11 and n0 = 1 and builds upon recent work of Terence Tao in the two-dimensional case.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.