500
explain the steps for mathematical induction
Let Pn be a statement involving the positive integer n.
1.Show P1 is true 1. Plug 1 in for n
2.Let k = n and assume the truth of Pk
3.Show Pk+1 is a true statement
⟶Then Pn must be true for all positive integers n