Download presentation

Presentation is loading. Please wait.

1
**Lesson 10.4: Mathematical Induction**

Mathematical Induction is a form of mathematical proof. Principle of Mathematical Induction: Let Pn be a statement involving a positive integer, n. If P1 is true, and The truth of Pk implies the truth of Pk+1, for every positive integer k, then Pn is true for all integers n. [p 688] To apply Mathematical Induction you need to Show the statement is true when n=1 Assume the statement is true for n=k, and then use it to show the statement is true for n=k+1.

2
**1. Let n = , show the statement is true. 1**

Use Mathematical Induction to prove the statement is true positive integer. 1. Let n = , show the statement is true. 1 2a. Let n = , assume the statement below is true. k 2b. Let n = , show the statement is true, using 2a. k+1 Must show that = Sk

3
**Use Mathematical Induction to prove the statement is true positive integer.**

1. Let n = , show the statement is true. 2a. Let n = , assume the statement below is true. 2b. Let n = , show the statement is true, using 2a. Must show that

4
**Mathematical Induction Proofs - Worksheet**

Homework: p693: #11, 15, 17, 21

Similar presentations

© 2021 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google