31. To prove that the sum of the interior angles of a convex N-sided polygon on a plane is . Below is an incorrect proof, and the first error is ( ).
(A) Step one: For , the polygon is a triangle, and the sum of the three interior angles of a triangle is , which is
(B) Step two: Let be a fixed positive integer greater than 3, assume that the sum of the interior angles of a convex -sided polygon is
(C) Step three: For a convex -sided polygon, we can choose two vertices and connect them with a line segment, dividing it into a convex -sided polygon and a triangle
(D) Step four: The sum of the interior angles of a -sided polygon is
(E) Step five: By mathematical induction, for any integer , the sum of the interior angles of a convex -sided polygon is
Solution
31. (B).
Prove by mathematical induction.
First step: Prove that when , the conclusion holds: First. Second step: Assume that when , the conclusion holds, but (B) states "Assume 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.