# 11_4 - P n is true for all natural numbers n the steps of Mathematical Induction are • For n = 1 prove that P n = P 1 is true • Suppose P n is

This preview shows pages 1–2. Sign up to view the full content.

Section 11.4: Mathematical Induction Instructor: Ms. Hoa Nguyen ([email protected]) 1 Mathematical Induction Mathematical Induction is a useful method for proving mathematical formulas that might be diﬃcult to prove rigorously. Let P n be a mathematical proposition (or formula, statement) for each natural number n ( n = 1 , 2 , 3 , ... ). To prove that

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: P n is true for all natural numbers n , the steps of Mathematical Induction are: • For n = 1, prove that P n = P 1 is true. • Suppose P n is true for n = k ( k is some natural number), prove that P n is true for n = k + 1. 2 Examples Example 1 : Example 2 : Example 3 : 1 Example 4 : Example 5 : 2...
View Full Document

## This note was uploaded on 05/23/2011 for the course MAC 1147 taught by Professor Nuegyen during the Spring '11 term at FSU.

### Page1 / 2

11_4 - P n is true for all natural numbers n the steps of Mathematical Induction are • For n = 1 prove that P n = P 1 is true • Suppose P n is

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

View Full Document
Ask a homework question - tutors are online