CMPE16_Notes_Textbook_Chapter5_Concepts
Document Summary
The world is made up of two type of polygons: convex or nonconvex. A form of mathematical induction where the proof goes from specific to general. It is generally the same as mathematical induction, but with strong induction p(n) is true for all positive integers n, the basis step shows that p(1) is true. P(n) is true for all positive integers n, where p(n) is a propositional function, we complete two steps: Basis step: we verify that the proposition p(1) is true. Inductive step: we show that the conditional statement [p(1) and p(2) And and p(k)] -> p(k+1) is true for all positive integers k. Basically we have to show that multiple values are equal to p(k+1): what is the second.
