Maths Olympiad Prep

Library / /751 of 1394

Geometry Difficulty 5.3 AIME, harder Prove it United States

Problem:
A square of side length 11 is dissected into two congruent pentagons. Compute the least upper bound of the perimeter of one of these pentagons.

Solution

Solution:
Figure 1
Let P1P_{1} and P2P_{2} be the two congruent pentagons. Let p(P)p(P) denote the perimeter of polygon PP.
We give an upper bound for p(P1)+p(P2)p(P_{1}) + p(P_{2}). Note that since a square has four sides, at least four sides of P1P_{1} and P2P_{2} combined lie on the sides of the square. These sides have total length at most 44, the perimeter of ABCDABCD.
Each of the remaining sides has length at most 2\sqrt{2}, since the longest possible length of a segment inside ABCDABCD is 2\sqrt{2}. There are at most 66 remaining sides, so
p(P1)+p(P2)4+62. p(P_{1}) + p(P_{2}) \leq 4 + 6\sqrt{2}.
Since P1P_{1} and P2P_{2} are congruent, this implies
p(P1)=p(P2)2+32. p(P_{1}) = p(P_{2}) \leq \boxed{2 + 3\sqrt{2}}.
This least upper bound can be achieved by placing XX close to CC and YY close to AA, as seen in the diagram.

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.