Maths Olympiad Prep

Library / /11 of 16

Geometry Difficulty 6.5 National Olympiad Prove it Romania

A die is an unitary cube with numbers from 11 to 66 written on its faces, so that each number appears once and the sum of the numbers on any two opposite faces is 77. We construct a large 3×3×33 \times 3 \times 3 cube using 2727 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 66 type I, 1212 type II and 88 type III dice.

The minimum sum is obtained when each type I die shows 11, each type II die shows 11 and 22 and each type III die shows 11, 22 and 33. Its value is Smin=61+123+86=90S_{\min} = 6 \cdot 1 + 12 \cdot 3 + 8 \cdot 6 = 90.

The maximum sum is obtained when each type I die shows 66, each type II die shows 55 and 66 and each type III die shows 44, 55 and 66. Its value is Smax=66+1211+815=288S_{\max} = 6 \cdot 6 + 12 \cdot 11 + 8 \cdot 15 = 288.

We will show that the sum can be any number from 9090 to 288288. In order to do this we will start from the minimum sum and we will rotate the dice so that the sum increases by 11 at each step.

Rotating a type I dice we can increase the total by 11 each time, until this die shows 66. This way we can make each type I die show a 66.

We rotate now a type II die from 1+21+2 to 5+65+6 and, in the same time, we rotate two of the type I dice to 11 and 44 respectively; this way the sum increases by 11. We then rotate back the type I dice, little by little, so they show 66 again, increasing the sum each time by 11. We repeat this move until each type II die shows 5+65+6.

Then we rotate a type III die so it shows 4+5+64+5+6, rotating in the same time two type I dice so they show 22; this increases the total sum by 11. We bring then the type I dice back to 66, and repeat this sequence of moves until each type III die shows 44, 55 and 66. We arrived thus to SmaxS_{\max} and the proof is finished.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.