Maths Olympiad Prep

Library / /30 of 86

Geometry Difficulty 6.3 National Olympiad Prove it United States

Problem:

A square with sides of length 1 cm1~\mathrm{cm} is given. There are many different ways to cut the square into four rectangles. Let SS be the sum of the four rectangles' perimeters. Describe all possible values of SS with justification.

Solution

Solution:

The answer is 6<S106 < S \leq 10. This can be shown by considering several cases, as shown in the 14 figures below.

Figure 1
Square 1
Figure 2
Square 8
Figure 3
Square 2
Figure 4
Square 9
Figure 5
Square 3
Figure 6
Square 10
Figure 7
Square 4
Figure 8
Square 11
Figure 9
Square 5
Figure 10
Square 12
Figure 11
Square 6
Figure 12
Square 13
Figure 13
Square 7
Figure 14
Square 14

Observe that in every case, there is either a horizontal or a vertical line segment of length 11 drawn inside the square, as well as some additional segments. For example, there are three such vertical lines inside Square 1, two inside each of Squares 2-3, and one inside each of Squares 4-7. The figures in the first row are rotated by 9090^{\circ} to give corresponding partitions of the square in the second row, each with a horizontal line cutting through the whole square; except for Square 14, which displays two lines, a horizontal and a vertical one, that pass through the center of the square.

The total perimeter SS of the four rectangles in each case is the original perimeter 44 of the square, plus twice the length of all line segments drawn inside the square since each of these must be counted twice for the two (or more) rectangles that include them in their perimeters. So we must have S=4+21+2a=6+2aS = 4 + 2 \cdot 1 + 2a = 6 + 2a, where 212 \cdot 1 stands for twice a segment that crosses all the way through the square and aa stands for any additional segment(s) inside the square. Since a>0a > 0 in all cases, we have S>6S > 6.

The maximum of S=10S = 10 is achieved by cutting the square into four 1×141 \times \frac{1}{4} rectangles with three parallel cuts, as in Squares 1 and 8.

All values in between can be achieved as well. Indeed, the total perimeters SS are written on top of each of the 14 cases. By shifting left or right the length 11 vertical segments in Squares 2, 3, 4, or by shifting up or down the length 11 horizontal segments in Squares 9, 10, 11, we can make the length xx vary from 00 to 11: 0<x<10 < x < 1. Thus, for example, Square 4 can achieve any total perimeter S=6+4xS = 6 + 4x between 66 and 1010: 6<S<106 < S < 10. In a similar way, Squares 5 and 12 can be drawn with lengths xx and yy varying between 00 and 11, and so these squares can also achieve any perimeter S=6+2x+2yS = 6 + 2x + 2y between 66 and 1010.

Putting everything together, SS can be any number in the interval (6,10](6, 10]; i.e. 6<S106 < S \leq 10.

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.