Using mathematical induction, prove that for all n ∈ N
Answers
Answered by
4
Mathematical Induction
We are given a statement which we are supposed to prove by the Principle of Mathematical Induction.
Let the statement be P(n).
Checking P(1):
Thus, P(1) is true.
Suppose P(k) is true.
We now need to check for P(k+1).
To Prove:
Consider the LHS:
Thus, P(k+1) is true provided P(k) is true.
Now, P(1) is true and P(k) is true P(k+1) is true.
Hence, P(n) is true for all .
Hence Proved, by the Principle of Mathematical Induction.
Similar questions