The Hadwiger Problem
|The Hadwiger Problem|
|Cubes within cubes within cubes... (+1 Trust)|
Summary[edit | edit source]
Notes[edit | edit source]
In real life, the Hadwiger Problem was proposed by Hugo Hadwiger, and asks "What is the largest number of sub-cubes (not necessarily different) into which a cube cannot be divided by plane cuts?" The answer is 47 (Gardner 1992, pp. 297-298). Note that this is not to be confused with the Hadwiger-Nelson problem of geometric graph theory.
|This article is a stub. You can help Universal Paperclips Wiki by .|