Answer:
Assume that Sn is valid for n = k and prove that Sn is valid for n = k + 1.
Step-by-step explanation:
This is the second step in the principal of mathematical induction. The three steps in the principals of mathematical induction are:
1. show that something works for the first case (base or anchor step)
2. assume that it works for any particular step (inductive hypothesis), and then
3. show that it works for the next case (inductive step)
p. 621 in textbook
It's weird that they put steps 2 & 3 together, but it was correct on the test so ¯\_(ツ)_/¯
I’m pretty sure it’s d because 2 is how much the cells have multiplied by hour say you started with 3 and it been three hours you would have 24 cells because it double the amount every time 3*2=6*2=12*2=24
60 is the answer I hope this is right
