Maths Olympiad Prep

Library / /32 of 43

, 2005

Geometry Difficulty 5.8 AIME, harder Find the answer Italy

Problem:

Given a cube with unit side (see figure), consider the plane containing the edges ABAB and CDCD and the one containing the edges AEAE and FDFD. These two planes cut the cube into four parts. What is the maximum among the volumes of these parts?

Pick one

Solutions — 2

Solution 1

Solution:

The answer is (B). Let GG and HH be the other two vertices of the cube, with AGAG an edge of the cube. Let us fix a Cartesian reference frame, with origin at AA and axes x,yx, y, and zz along AB,AE,AGAB, AE, AG. The four regions are characterized by the conditions {xz;yz},{xz;yz},{xz;yz},{xz;yz}\{x \leqslant z ; y \leqslant z\},\{x \leqslant z ; y \geqslant z\},\{x \geqslant z ; y \leqslant z\},\{x \geqslant z ; y \geqslant z\}. Let us cut the cube with a third plane, passing through AGAG and HDHD. The resulting regions are six and are characterized by the conditions {xyz}\{x \leqslant y \leqslant z\} and similar ones, obtained by permuting the unknowns.

This implies, among other things, that of the four initial regions, two are cut by the third plane (and these are the ones that will turn out to have maximum volume), while the other two are not.

The six regions obtained are all congruent, by symmetry reasons, and therefore each has volume 16\frac{1}{6}. From this it follows that of the four regions described in the question, two have volume 13\frac{1}{3} and two have volume 16\frac{1}{6}.

Solution 2

Solution:

It is easy to verify that the pyramid with base CDFGCDFG and vertex at AA is not cut by the planes in question. Moreover, of the five faces of the pyramid, three are also faces of the cube (or parts of them), while the remaining two are coplanar with the cutting planes.

This means that the pyramid is one of the four regions into which the cube is cut. Similarly, the symmetric pyramid DBAEHDBAEH is another of these regions. Since each of them has volume 13\frac{1}{3}, the remaining two parts cannot have a greater volume, so the maximum of the volumes is 13\frac{1}{3}.

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 translated into English from it; metadata (topic, difficulty) added by this project.