While you wait, be sure to

make sure you have sound!

Go to Tools – Audio – Audio

Setup Wizard

We will start at 8:00! 

7.04 LIVE LESSON Pre-Calculus

Mathematical Induction
 PRINCIPLE OF MATHEMATICAL INDUCTION
Let Pn be a statement involving the positive integer n. If
1. P1 is true, and
2. 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 validate via the Principle of Mathematical Induction, we need to find Pk+1 for the expression Pk.
 EXAMPLE 1
Using mathematical induction, prove the following:
Sn = 1 + 3 + 5 + ... + (2n - 1) = n2
Step 1: Prove the “anchor” is true:
Step 2: Assume true for Pk and then show true for Pk+1.
 EXAMPLE 2
Show that n2 + n is divisible by 2 for all natural numbers n.
Step 1: Prove the “anchor” is true:
Step 2: Assume true for Pk and then show true for Pk+1.
 7.04 ASSIGNMENT
We will now complete the 7.04 assessment. You should follow along and complete
the work on your own paper or type in a word processing document. You will be
scanning (or taking a clear digital picture of) your work and uploading it to the
assessment. Show your work clearly.

Please note that in order to get full credit, you must participate in the discussion on
the following slides.
 7.04 ASSESSMENT #1
Use mathematical induction to prove the statement is true for all positive integers n, or show why it
is false.
(4 points each.)
 #2
Use mathematical induction to prove the statement is true for all positive integers n, or show why it is false.
(4 points each.)
 #3
For the given statement Pn, write the statements P1, Pk, and Pk+1.
(2 points)
 HOW DO I SUBMIT?
Submit the work for assessment 7.04.
 You should scan or take a clear digital picture of your work. This should be uploaded to
your assessment.

 In the Student Comment Section, type “I attended the Live Lesson on DATE at TIME.” OR
“I watched the recording of this Live Lesson.”