235Ch5-1Induction离散数学英文版PPT.ppt

Mathematical Induction is Valid Prove that Mathematical Induction is Valid We prove by contradiction: If P(1) is true and P(k) ? P(k+1) is true (for all k ? 1), but there is a smallest n1 (by Well-Ordering Property) such that when n = n1, P(n1) is false but P(n1 – 1) is true By assumption, P(n1 – 1) ? P(n1) is true (for all k ? 1). By modus ponens law, P(n1) is true. This is a contradiction! Induction for Algorithm Correctness Prove that the Sum Algorithm is correct, orsum = a1,+ a2 + ?+ an procedure Sum(a1, ?, an: list, n: positive Integer) sum := 0 for i: = 1 to n sum := sum + ai endfor return sum { sum contains a1,+ a2 + ?+ an} Exercises #7 4.1, P329: 3, 4, 5, 19 4.2, P341: 3, 5 Decide how many terms in H2^(k+1) after 1/2k: there are 2k+1 – 2k = 2k terms * * * * The implication is that, if the smaller of the two stamps is m (3 here), you just need to verify m scenarios starting from the basis (18, 19, 20 here). Because from 18 to 21, you just add 3. From 19 to 22, you just add 3, …, keep going to get any number. * We can understand the second part by letting k =1, 2, … and applying modus ponens k-1 times. Mathematical induction can be applied k-1 times to receive all the premises P(1), P(2), … P(k-1). * Let a = 10 and d = 3. Then for all 10 – 3q =0: q = 3, 2, 1, 0, -1, -2, -3, … S = {1, 4, 7, 10, 13, 16, 19, …} q in S (or r) 3 1 2 4 1 7 0 10 -1 13 -2 16 -3 19 … … * If r – r’ 0, it is not divisible by –d. If it is 0 it is not divisible by d! * * Induction on n. 1 = 1. Assume n = k is correct ? prove n = k+1 is also correct * Chapter 5: Induction and Recursion (Part 1) Elements of Discrete Structures Climbing an Infinite Ladder We can reach step 1. … If we can reach step k, we can reach step k + 1. Then, we can reach any step n Mathematical Induction For a propositional function P(n) and any integers n ≥ b, b is a starting value of n in N (Basis Step) we prove: P(b) is true (Inductive Step) and we prove P(k) ? P(k+1) for any positive integ