47
This number is a prime.
Just showing those entries submitted by 'Post': (Click here to show all)
![]() |
| © Disney/Pixar |
The Hadwiger problem asks for the largest number of
subcubes (not necessarily different) into which a cube
cannot be divided by plane cuts. The answer is 47. [Post]
(There is one curio for this number that has not yet been approved by an editor.)
Printed from the PrimePages <t5k.org> © G. L. Honaker and Reginald McLean
