7.2k views
5 votes
For a proof by induction of the math statement below, identify the correct step for proving the theorem is true for n = k + 1. HELP ASAP THANKS!!

For a proof by induction of the math statement below, identify the correct step for-example-1

1 Answer

4 votes

Answer: Choice A

What we do is simply replace every n with k+1. So (3n)^2 turns into (3(k+1))^2

We see that only choice A has the correct term mentioned on the left hand side, so this must be the answer.

The right hand side is treated the same way. We plug in n = k+1. Your teacher did a bit of algebraic manipulation to get what is shown for choice A.

User Mayte
by
7.6k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.