Maths Olympiad Prep

Library / /109 of 196

Geometry Difficulty 5.3 AIME, harder Prove it Soviet Union

Problem:
What is the smallest number of tetrahedrons into which a cube can be partitioned?

Solution

Solution:
Answer: 5.

Tetrahedral faces are triangular, so each cube face requires at least two tetrahedral faces. So at least 12 tetrahedral faces are needed in all. At most three faces of a tetrahedron can be mutually orthogonal (and no two faces can be parallel), so at most 3 faces from each tetrahedron can contribute towards these 12. So we require at least 4 tetrahedra to provide the cube faces. But these tetrahedra each have volume at most 1/61/6 (1/31/3 x face area x 1, and face area is at most 1/21/2). So if we have only 4 tetrahedra in total then their total volume is less than the cube's volume. Contradiction. Hence we need at least 5 tetrahedra.

It can be done with 5: lop off 4 non-adjacent corners to leave a tetrahedron. More precisely, take the cube as ABCDABCDABCD A'B'C'D' with ABCDABCD horizontal, AA' directly under AA, BB' directly under BB and so on. Then the five tetrahedra are AABDAA'BD, CCBCCC'BC, DDACDD'AC', BBACBB'AC', BDACBDA'C'.

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.