Maths Olympiad Prep

Library / /36 of 120

Geometry Difficulty 4.9 AIME Prove it Saudi Arabia

Prove that for each n4n \geq 4 a parallelogram can be dissected in nn cyclic quadrilaterals.

Solution

Let ABCDABCD be a parallelogram. If ABCDABCD is a rectangle, then it is clear that we can dissect it into nn rectangles by parallel lines to its sides.

Assume that ABCDABCD is not a rectangle. Without loss of generality we can assume that ABADAB \geq AD. Let EE and FF be the midpoints of BCBC and ADAD, respectively. There are two cases: A<90\angle A < 90^{\circ} and A>90\angle A > 90^{\circ}. Because the second case is analogous to the first one, we shall study only the situation A<90\angle A < 90^{\circ}.

Figure 1

Construct the isosceles triangle AFGAFG, with AF=FGAF = FG and vertex GG on line ABAB. Because A<90\angle A < 90^{\circ} we have
AG=2AFcosA<2AF=ADAB, AG = 2AF \cos A < 2AF = AD \leq AB,
hence GG belongs to the interior of the segment ABAB. Let GG' be any point in the interior of segment GBGB. Construct the parallelogram GGFFGG'F'F. Then AFFGAFF'G' and GBEFG'BEF' are isosceles trapezoids, hence they are cyclic quadrilaterals. Similarly, we divide FECDF E C D into two isosceles trapezoids, hence ABCDABCD is dissected into 4 isosceles trapezoids.

In order to pass from nn to n+1n+1 cyclic quadrilaterals it is sufficient to notice that an isosceles trapezoid is divided into isosceles trapezoids by a parallel line to the basis.

Figure 1

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 and solution reproduced as published; topic and difficulty added by this site.