A die is an unitary cube with numbers from to written on its faces, so that each number appears once and the sum of the numbers on any two opposite faces is . We construct a large cube using dice. Find all possible values of the sum of numbers which can be seen on the faces of the large cube.
Solution
We will say that a die of the large cube is of type I, type II or type III according to the number of its faces which are visible (e.g. a die sharing a vertex with the large die is a type III die). Every large cube contains type I, type II and type III dice.
The minimum sum is obtained when each type I die shows , each type II die shows and and each type III die shows , and . Its value is .
The maximum sum is obtained when each type I die shows , each type II die shows and and each type III die shows , and . Its value is .
We will show that the sum can be any number from to . In order to do this we will start from the minimum sum and we will rotate the dice so that the sum increases by at each step.
Rotating a type I dice we can increase the total by each time, until this die shows . This way we can make each type I die show a .
We rotate now a type II die from to and, in the same time, we rotate two of the type I dice to and respectively; this way the sum increases by . We then rotate back the type I dice, little by little, so they show again, increasing the sum each time by . We repeat this move until each type II die shows .
Then we rotate a type III die so it shows , rotating in the same time two type I dice so they show ; this increases the total sum by . We bring then the type I dice back to , and repeat this sequence of moves until each type III die shows , and . We arrived thus to and the proof is finished.