This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MATH 135 Winter 2009 Lectures IV/V Notes Mathematical Induction The second technique of proof at which we’ll look is mathematical induction . This is a technique that is normally used to prove that a statement is true for all positive integers n . Motivation Why would we want to do this? Suppose that we had a sequence { x n } defined by x 1 = 1 and x r +1 = 2 x r + 1 for r ≥ 1. What is x 2 ? x 3 ? x 4 ? Do you see a pattern? (Beware of patterns!) What if we wanted to know x 2008 ? What would we have to do? It doesn’t make sense to calculate x 2 through to x 2007 individually, and it does look like we have a pattern. Is there a way to prove that x n = 2 n − 1 for all positive integers n ? This would allow us to be able to state the value of x 2008 or x 23487 or whatever. This is where induction comes in. Technical Details Induction is a technique for proving statements of the form P ( n ) where n ∈ P . (For example, P ( n ) = “ x n = 2 n − 1”.) This technique relies on Principle of Mathematical Induction (POMI) Let P ( n ) be a statement that depends on n ∈ P . If (i) P (1) is true, and (ii) P ( k ) is true ⇒ P ( k + 1) is true, then P ( n ) is true for all n ∈ P . Why does this work? Suppose that we know (i) and (ii) to be true about P ( n ). (i) says P (1) is true (ii) says “If P (1) is true, then P (2) is true” so P (2) is true (ii) then says “If P (2) is true, then P (3) is true” so P (3) is true Following this along,...
View
Full
Document
This note was uploaded on 06/03/2010 for the course MATH 135 taught by Professor Peter during the Winter '07 term at University of the West.
 Winter '07
 peter
 Math, Integers, Mathematical Induction

Click to edit the document details