Maths Olympiad Prep

Library / /860 of 1394

Geometry Difficulty 5.4 AIME, harder Prove it United States

Problem:

Holden has a collection of polygons. He writes down a list containing the measure of each interior angle of each of his polygons. He writes down the list 3030^{\circ}, 5050^{\circ}, 6060^{\circ}, 7070^{\circ}, 9090^{\circ}, 100100^{\circ}, 120120^{\circ}, 160160^{\circ}, and xx^{\circ}, in some order. Compute xx.

Solution

Solution:

We work in degrees. The sum of all 9 angles is 680+x680 + x. The sum of the angles in a polygon with nn sides is 180(n2)180n180(n - 2) \equiv 180n mod 360360. Since there are 9 angles, the polygons have a total of 9 sides, so the sum of the 9 angles must be 91801809 \cdot 180 \equiv 180 mod 360360. Thus 680+x180680 + x \equiv 180 mod 360360, so x220x \equiv 220 mod 360360. Since 0<x<3600 < x < 360, we know x=220x = \boxed{220}.

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.