It can be easily shown that a square may be cut in any number of (not necessarily same-sized) squares, except in 2, 3 or 5 squares. Are there any results regarding the same question for cubes? Is there a maximum number n without a cube-cutting solution?
Asked
Active
Viewed 115 times
1 Answers
1
This seems to give an answer of $47$ with an argument to show why.
Mark Bennet
- 100,194
-
I couldn't find good results in higher dimensions and didn't have time to use the method suggested here. – Mark Bennet Mar 15 '14 at 22:01