Problem:
A square of side length is dissected into two congruent pentagons. Compute the least upper bound of the perimeter of one of these pentagons.
Solution
Solution:
Let and be the two congruent pentagons. Let denote the perimeter of polygon .
We give an upper bound for . Note that since a square has four sides, at least four sides of and combined lie on the sides of the square. These sides have total length at most , the perimeter of .
Each of the remaining sides has length at most , since the longest possible length of a segment inside is . There are at most remaining sides, so
Since and are congruent, this implies
This least upper bound can be achieved by placing close to and close to , 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.