The Answer to the Question
is below this banner.
Here's the Solution to this Question
1) base case: n=1
for n=1, the statement take the next form: . After simplification we get , which means the base case is true.
2) Induction step: under the assupmtion that statement is true for n=k, we will prove that it is true for n=k+1.
for n=k we get
for n=k+1 we get:
The statement has been proven.