CSCA67H3 Lecture Notes - Lecture 12: Mathematical Induction

• School: UTSC
• Department: Computer Science
• Course: CSCA67H3
• Professor: Pancer/ Bretscher( G)

Document Summary

Strong induction or complete induction: p + 1 (k holds for all. If i k then (i)p integer k are equivalent in a sense) holds too, where (k)p is dependant on a positive. Weak induction or simple induction is not the same as strong induction (however, they. 8 a n b a (n) (2) (1) (0) (3) (1) (3) (5) (0) atural numbers, n. : 1 n. Q: given an infinite amount of 4 cents and 7 cents stamps, prove by strong induction that there exists a combination of stamps to make any amount of postage that is 18 cents or more. Induction step: (prove that (k+1) = k + 1 = 4 + ( 4 ( 4 1 we know that k k 2. 1 k b by induction hypothesis. ( 4 = 4 = 7 k + 1 = 4 + ( 4. N atural numbers, b atural numbers, y atural numbers, (k.