In an orthogonal hyperspace of 256 dimensions there is a hypersphere of 6 dimensions that we want to divide into as many pieces as possible with no more than 12 cuts. The pieces cannot be moved from their original positions. Each cut is an orthogonal 5-dimensional Euclidean hyperspace (hyperplane). What is the maximum number of pieces into which the 6-dimensional hypersphere can be cut in this way?
Orthogonal to what?
I don't know what is an orthogonal hyperspace! 11
I got this question from an IQ test. The author says only 100 people in the world have the required knowledge of n-dimensional geometry to solve it without thinking much, because they already learned the necessary mathematical tools for the problem don't be a real problem. While the others would need to discover a way by themselves 11
(at least this is what I understood, or that there are many ways to solve, and that 100 people in the world already know one of those ways... who knows, 11)
Man, I'm getting confused... I think my IQ is low, very very low 111111
"The hero uses his extraordinary powers to help others, while the villain uses his powers for selfish, destructive or ruthless purposes"