Maths Olympiad Prep

Library / /152 of 520

Geometry Difficulty 5.0 AIME Prove it

31. To prove that the sum of the interior angles of a convex N-sided polygon on a plane is (2N5)180(N>2)(2 N-5) \cdot 180^{\circ} (N>2). Below is an incorrect proof, and the first error is ( ).
(A) Step one: For k=3k=3, the polygon is a triangle, and the sum of the three interior angles of a triangle is 180180^{\circ}, which is (2×35)180(2 \times 3-5) \cdot 180^{\circ} =180=180^{\circ}
(B) Step two: Let kk be a fixed positive integer greater than 3, assume that the sum of the interior angles of a convex kk-sided polygon is (2k5)180(2 k-5) \cdot 180^{\circ}
(C) Step three: For a convex (k+1)(k+1)-sided polygon, we can choose two vertices and connect them with a line segment, dividing it into a convex kk-sided polygon and a triangle
(D) Step four: The sum of the interior angles of a (k+1)(k+1)-sided polygon is [2(k+1)5]180[2(k+1)-5] \cdot 180^{\circ}
(E) Step five: By mathematical induction, for any integer N>2N>2, the sum of the interior angles of a convex NN-sided polygon is [2N5]180[2 N-5] \cdot 180^{\circ}

Solution

31. (B).

Prove by mathematical induction.
First step: Prove that when k=3k=3, the conclusion holds: First. Second step: Assume that when kk 3\geqslant 3, the conclusion holds, but (B) states "Assume k>3k>3 when the conclusion holds," which is the first error.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.