The Answer to the Question
is below this banner.
Here's the Solution to this Question
1) Basis of induction, n=2
2) Induction step, let the statement is true for n=k, i.e.
Considerthe case n=k+1:
= , so statement is true for n=k+1, induction step is verified, therefore the statement is proved by math inductionmethod.