Using mathematical induction prove that :
______________________
Answers
Answered by
6
Step :- 1 For n = 1
Step :- 2 Let assume that P(n) is true for n = k
Step :- 3 Prove that P(n) is true for n = k + 1
Consider,
Hence,
By the process of Principal of Mathematical Induction,
Answered by
2
WE have to prove :⟹
for n = 1
- ⟹
(x)=1
RHS = 1.x^{1-1} = 1
So, LHS = RHS
∴ P(1) is true.
- ∴ P(n) is true for n = 1
⟹ Let P(k) be true for some positive integer k.
Now, to prove that P(k + 1) is also true
⟹ RHS =
⟹
⟹
⟹
⟹
⟹
- ∴ LHS = RHS
Thus, P(k + 1) is true whenever P(k) is true.
Thus, P(k + 1) is true whenever P(k) is true.Therefore, by the principle of mathematical induction, the statement P(n) is true for every positive integer n.
★★
Similar questions