Q. 15

# Prove the f

Answer :

Let the given statement be P(n), as First, we check if it is true for n = 1, It is true for n = 1.

Now we assume that it is true for some positive integer k, such that …………..(1)

We shall prove that P(k + 1)is true,

Solving the left hand side with n = k + 1   [From equation (1)]  Which is equal to the Right hand side for n = k + 1. We proved that P(k + 1) is true.

Hence by principle of mathematical induction it is true for all n N.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation view all courses RELATED QUESTIONS :

Prove that cos α RD Sharma - Mathematics

Prove that sin x RD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove the followiRD Sharma - Mathematics

Prove that <span RD Sharma - Mathematics