Please verify your account before proceeding.

In this lesson, we will learn how to apply the mathematical induction method to prove a summation formula.

Q1:

First, he starts with the basis step substituting 𝑛=1 into each side of the equation. He calculates that the left-hand side, 𝑟, equals 1. Calculate the value of the right-hand side, and, hence, determine if the basis is true.

David assumes that the summation formula is true when 𝑛=𝑘 giving him that 𝑟=𝑘(𝑘+1)2. For the induction step, he needs to show that 𝑟=(𝑘+1)(𝑘+2)2. Using the fact that=+(𝑘+1), substitute in David’s assumption and simplify the result to find an expression for 𝑟.

David then makes the following conclusion:

If our assumption is correct for 𝑛=𝑘, we have shown that the summation formula is correct when 𝑛=𝑘+1. Therefore, as we have shown that the summation formula is true when 𝑛=1, by mathematical induction, the formula is true for all natural numbers 𝑛.

Is David’s conclusion correct?

Q2:

Charlotte is trying to prove the summation formula 𝑟=𝑛(𝑛+1)(2𝑛+1)6.

She has checked that the basis is correct, has assumed that 𝑟=𝑘(𝑘+1)(2𝑘+1)6, and is trying to show that 𝑟=(𝑘+1)(𝑘+2)(2𝑘+3)6.

Charlotte knows that she needs to express 𝑟 in terms of her assumption for the 𝑟, but she cannot quite remember the method. Determine which of the following is correct.

Nagwa uses cookies to ensure you get the best experience on our website. Learn more about our Privacy Policy.