lecture12 - MA1100 Lecture 12 Mathematical Induction Using...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
1 MA1100 Lecture 12 Mathematical Induction Using PMI on other universal sets Strong PMI Variations of strong PMI Chartrand: section 6.4
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 12 2 Other Universal Sets ( " n œ Z )P(n) 1.P(0) is true 2.For all k ¥ 0, if P(k) is true, then P(k+1) is true 3.For all k § 0, if P(k) is true, then P(k - 1) is true Then P(n) is true for all n œ Z P(0) Ø P(1) Ø P(2) Ø Ø P(n)… …P(-n) P(-2) P(-1) P(0) Possible to apply PMI to prove: What about ( " x œ Q + ) P(x) and ( " x œ R + ) P(x) ?
Background image of page 2
Lecture 12 3 Other Universal Sets ( " q œ Q + )P(q) 1.P( 1 ) is true 2.For all k œ N ,ifP( k ) is true, then P( k+1 ) is true Then P(m/n) is true for all m/n œ Q + where m, m n q n = N Fix m œ N Then P(n) is true for all n œ N 3.P(m/ 1 ) is true (from 1 and 2 above) 4.For all k œ N ,ifP(m/ k ) is true, then P(m/ (k+1) ) is true
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 12 4 Other Universal Sets ( " q œ Q + )P(q) P(1) Ø P(2) Ø P(3) Ø Ø P(m) … ) n 2 ( P ) 3 2 ( P ) 2 2 ( P # ) n 1 ( P ) 3 1 ( P ) 2 1 ( P # ) n 3 ( P ) 3 3 ( P ) 2 3 ( P # ) n m ( P ) 3 m ( P ) 2 m ( P # where m, m n q n = N
Background image of page 4
Lecture 12 5 Binary Sum Proposition Every positive integer can be written as the sum of distinct power of 2 . 4 = 2 2 10 = 2 3 + 2 1 45 = 2 5 + 2 3 + 2 2 + 2 0 Example Proof by Mathematical Induction Base case : prove P(1) is true P(n): n is a sum of distinct power of 2 . Since 1 = 2 0 , So P(1) is true. Binary Sum
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 12 6 Binary Sum Inductive step : P(k) P(k+1) for all k ¥ 1 hypothesis P(k): want to get P(k+1): Is knowing P(k) enough to prove P(k+1) ? P(n): n is a sum of distinct power of 2 . k is a sum of distinct power of 2 k + 1 is a sum of distinct power of 2 k = sum of distinct power of 2 k + 1 = (sum of distinct power of 2) + 2 0
Background image of page 6
Lecture 12 7 Strong PMI Let P(n) be a predicate such that: 1.P(1) is true 2.For all k œ N , if P(1), P(2), …, P(k) are true, then P(k+1) is true. Then P(n) is true for all n œ N Theorem ( Strong Principle of Mathematical Induction) The base case may start from another integer
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 12 8 Strong PMI To prove ( " n œ N ) P(n) is true Base case: Prove P(1) is true Inductive Step: Prove " k œ N , [P(1)
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/15/2010 for the course MATHS MA1101R taught by Professor Vt during the Spring '10 term at National University of Singapore.

Page1 / 28

lecture12 - MA1100 Lecture 12 Mathematical Induction Using...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online