To prove
n
For n=2,
Let's assume that for k> 2 ,
So,
or let's show that ,k>2
Multiply the above inequality by
Rewriting the above inequality as below; shows that the above is true ,
By the extended mathematical induction, the inequality is valid for all n,n
No comments:
Post a Comment