4 - A proof by mathematical induction(POMI To prove “P(n is true for all n ≥ 1” Base Case Check P(1 Induction Hypothesis Assume that P(k is

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

View Full Document Right Arrow Icon
A proof by mathematical induction (POMI): To prove “ P ( n ) is true for all n 1”: Base Case : Check P (1). Induction Hypothesis : Assume that P ( k ) is true for some k 1. Induction Conclusion : Prove that P ( k + 1) is true using Ind. Hyp. 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Example. 2 n > 4 n for all n 5. Base Case : n = 5 : 2 5 = 32 > 20 = 4 · 5. Induction Hypothesis : Assume that 2 k > 4 k for some k 5. Induction Conclusion : We prove 2 k +1 > 4( k + 1) 2 k +1 = 2 k + 2 k (since k 5 2) 2 k + 2 2 > (by Ind.Hyp. ) 4 k + 4 = 4( k + 1) . 2
Background image of page 2
A proof by strong induction (POSI): To prove “ P ( n ) is true for all n 1”: Base Case : Check P (1). Induction Hypothesis : Assume P (1) , P (2) , . . . , P ( k ) for some k 1. Induction Conclusion : Prove that P ( k + 1) is true using Ind. Hyp. 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
To prove “ P ( n ) is true for all n 1”: Check P (1) , P (2) , . . . P ( m - 1) , and prove by induction P ( n ) is true for all n m Base Case : Check P ( m ). Induction Hypothesis
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/05/2010 for the course MATH 135 taught by Professor Andrewchilds during the Spring '08 term at Waterloo.

Page1 / 11

4 - A proof by mathematical induction(POMI To prove “P(n is true for all n ≥ 1” Base Case Check P(1 Induction Hypothesis Assume that P(k is

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

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