By: Jeffrey Bivin Lake Zurich High School

Slides:



Advertisements
Similar presentations
Trig (Polar) Form of a Complex Number
Advertisements

Know what is meant by proof by Induction Learning Outcomes: PROOF BY INDUCTION Be able to use proof by induction to prove statements.
Lesson 10.4: Mathematical Induction
By: Jeffrey Bivin Lake Zurich High School Last Updated: October 11, 2005.
Solving Quadratics by Completing the Square & Quadratic Formula
To prove by induction that 2 n ≥ n 2 for n ≥ 4, n  N Next (c) Project Maths Development Team 2011.
13.4 Mathematical Induction. Mathematical Induction is a common method of proving that each statement of an infinite sequence of mathematical statements.
Determinants of 2 x 2 and 3 x 3 Matrices By: Jeffrey Bivin Lake Zurich High School
Chapter 10 Sequences, Induction, and Probability Copyright © 2014, 2010, 2007 Pearson Education, Inc Mathematical Induction.
Using Fundamental Trig Identities
To prove by induction that (1 + x) n ≥ 1 + nx for x > -1, n  N Next (c) Project Maths Development Team 2011 Note: x>-1. Hence (1+x)>0.
Graphing Parabolas Using the Vertex Axis of Symmetry & y-Intercept By: Jeffrey Bivin Lake Zurich High School Last Updated: October.
Jeff Bivin -- LZHS Graphing Rational Functions Jeffrey Bivin Lake Zurich High School Last Updated: February 18, 2008.
By: Jeffrey Bivin Lake Zurich High School Last Updated: October 30, 2006.
Jeff Bivin -- LZHS Arithmetic Sequences Last UpdatedApril 4, 2012.
Arithmetic Sequences & Series Last Updated: October 11, 2005.
Recursive Functions, Iterates, and Finite Differences By: Jeffrey Bivin Lake Zurich High School Last Updated: May 21, 2008.
Exponential and Logarithmic Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: January 30, 2008.
MATRICES Jeffrey Bivin Lake Zurich High School Last Updated: October 12, 2005.
THE UNIT CIRCLE Initially Developed by LZHS Advanced Math Team (Keith Bullion, Katie Nerroth, Bryan Stortz) Edited and Modified by Jeff Bivin Lake Zurich.
Logarithmic Properties & Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: January 30, 2008.
Graphs of Polynomial Functions
Using Spreadsheets for Linear Programming with The Simplex Method A sample problem By: Jeffrey Bivin Lake Zurich High School Last Updated: October 11,
9.4 Mathematical Induction
Exponential and Logarithmic Functions Section 5.4.
Relations and Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: November 14, 2007.
Graphing Lines slope & y-intercept & x- & y- intercepts Jeffrey Bivin Lake Zurich High School Last Updated: September 6, 2007.
Mathematical Induction Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Mathematical induction is a legitimate method.
To prove by induction that 3 is a factor of 4 n - 1, n  N Next (c) Project Maths Development Team 2011.
Systems of Equations Gaussian Elimination & Row Reduced Echelon Form by Jeffrey Bivin Lake Zurich High School Last Updated: October.
Multiplying Fractions. When we multiply a fraction by an integer we: multiply by the numerator and divide by the denominator For example, × = 54.
 Day 1  Use long division to find (x 2 – 2x – 15) ÷ (x – 5).
Jeff Bivin -- LZHS Last Updated: April 7, 2011 By: Jeffrey Bivin Lake Zurich High School
Binomial Expansion And More
8.4 Mathematical Induction Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Recursively defined sequences Write the first 5.
Exponential and Logarithmic Functions By: Jeffrey Bivin Lake Zurich High School Last Updated: January 2, 2006.
Matrix Working with Scalars by Jeffrey Bivin Lake Zurich High School Last Updated: October 11, 2005.
Rational Expon ents and Radicals By: Jeffrey Bivin Lake Zurich High School Last Updated: December 11, 2007.
THE UNIT CIRCLE Day , (1, 0) (-1, 0) (0, 1) (0, -1)
Matrix Multiplication. Row 1 x Column X 25 = Jeff Bivin -- LZHS.
Inverses By: Jeffrey Bivin Lake Zurich High School Last Updated: November 17, 2005.
Section 8.4 Mathematical Induction. Mathematical Induction In this section we are going to perform a type of mathematical proof called mathematical induction.
Lake Zurich High School
Matrix Multiplication Example 1 Original author: Jeffrey Bivin, Lake Zurich High School.
Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.
Multiplication and Division of Powers
Lake Zurich High School
Solving Linear Equations in One Variable
Jeffrey Bivin Lake Zurich High School
Relations and Functions
Rational Exponents and Radicals
Solving Linear Equations in One Variable
Lake Zurich High School
Lake Zurich High School
Solving Rational Equations
Jeffrey Bivin Lake Zurich High School
Recursive Functions and Finite Differences
By: Jeffrey Bivin Lake Zurich High School
Matrix Multiplication
By: Jeffrey Bivin Lake Zurich High School
Lake Zurich High School
Graphing Linear Inequalities
Lake Zurich High School
To prove by induction that n! > 2n for n > 3, n  N
Mathematical Induction
Exponents and Radicals
(c) Project Maths Development Team 2011
Lake Zurich High School
Jeffrey Bivin Lake Zurich High School
11.4 Mathematical Induction
Presentation transcript:

By: Jeffrey Bivin Lake Zurich High School jeff.bivin@lz95.org Math Induction By: Jeffrey Bivin Lake Zurich High School jeff.bivin@lz95.org Last Updated: March 30, 2011

Before we begin…… If Pk = 1 + 5 + 9 + . . . + (4k-3) find Pk+1. Pk+1 = 1 + 5 + 9 + . . . + (4k-3) + (4(k+1) – 3) Pk+1 = 1 + 5 + 9 + . . . + (4k-3) + (4k+1)

Before we begin…… If Pk = k2(k+1)2 find Pk+1. Pk+1 = (k+1)2(k+1+1)2 = (k+1)2(k+2)2

The Principle of Math Induction Let Pn be a statement involving the positive integer n. If 1. P1 is true the truth of Pk implies the truth of Pk+1 for every positive k then Pn must be true for all positive integers n. To apply the Principle of Math Induction, you need to be able to determine the statement Pk+1 for a given statement Pk. To determine Pk+1, substitute k+1 for k in the statement Pk. Direct Quote: Precalculus with Limits – A Graphin Approach by Larson, Hostetler & Edwards © 2005 by Houghton Mifflin Company

Induction – A three step process Step 1: Show P1 is true APPROACH THE Step 2: Assume Pk is true Step 3: Prove Pk+1 is true A “Bivinism”

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Prove: Show P1: Assume Pk: Prove Pk+1: Q.E.D.

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 1

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 2

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 3

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 4

Prove: Show P1: Assume Pk: Prove Pk+1: Q.E.D.

Prove: Show P1: Assume Pk: Prove Pk+1:

Worksheet Exercise # 5

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 6

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 7

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 8

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.

Worksheet Exercise # 9

Prove: Show P1: Assume Pk: Prove Pk+1:

We need a common denominator to add the fractions. Prove Pk+1: We need a common denominator to add the fractions.

Prove Pk+1: We see that a factor of (k+1) is in the denominator on the left that is not on the right. Maybe the numerator has a (k+1) factor that will cancel with it. We will use synthetic division to check. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .   3 14 19 8 -1 -3 -11 -8 11 Q.E.D.

Worksheet Exercise # 10

Prove: Show P1: Assume Pk: Prove Pk+1:

Prove Pk+1: Q.E.D.