Let

In order to prove this by induction, we first need to prove the base case, i.e. prove that P(1) is true:

So, the base case is ok. Now, we need to assume
and prove
.
states that

Since we're assuming
, we can substitute the sum of the first n terms with their expression:

Which terminates the proof, since we showed that

as required
Answer:
A)
Step-by-step explanation:
C. I'm pretty sure that's the answer I hope it helps
Answer:
x = 5
Step-by-step explanation:
Answer: Each time the pentagon is rotated , it maps back onto itself. There are five values of for which the pentagon maps back onto itself. This is the same as the number of sides of the pentagon.