Recently, I was playing with my two year old brother. There was an old Rubik's cube lying around and my dad posed a simple problem:
How many selections of cubes can be made from a Rubik's cube?
The answer to the above question is and it is so because each corner cube is part of a unique selection.
Now, how many selections of cubes can be made from a ? The answer here is too simple and is .
And the number of selections of a cube from a is .
.... Reminded me of something. This note is an attempt to prove or disprove the following hypothesis.
In an Rubik's cube, the number of selections of solid cubes of edge length is
I am convinced that there is an elegant solution to this problem and that the hypothesis is true.
Please post your ideas. Thanks!
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Consider one dimension first. Given an array of length n, we can place a smaller array of length m in n−m+1 positions. This is the same for all three dimensions, bringing the total number of placings to be (n+m−1)3.
Log in to reply
Great explanation! Thanks!