Prove the following by using the principle of mathematical induction for all $$n\in N$$

$$(1+ \dfrac{1}{1})(1+\dfrac{1}{2})(1+\dfrac{1}{3})....(1+\dfrac{1}{n})=(n+1)$$

Asked by Pragya Singh | 1 year ago |  67

##### Solution :-

Let us denote the given equality by P(n), i.e.,

P(n): $$(1+ \dfrac{1}{1})(1+\dfrac{1}{2})(1+\dfrac{1}{3})....(1+\dfrac{1}{n})=(n+1)$$

For n=1,

L.H.S.= $$(1+ \dfrac{1}{1})=2$$

R.H.S.=(1+1) = 2

Therefore, P(n) is true for n=1.

Let us assume that P(k) is true for some positive integer k , i.e.,

$$(1+ \dfrac{1}{1})(1+\dfrac{1}{2})(1+\dfrac{1}{3})....$$

$$(1+\dfrac{1}{k})=(k+1)$$ .........(i)

Now, we have to prove that P(k+1) is also true.

Consider

$$[P(k): (1+ \dfrac{1}{1})(1+\dfrac{1}{2})(1+\dfrac{1}{3})....$$

$$(1+\dfrac{1}{k})] (1+\dfrac{1}{k+1})$$

$$(k+1)(1+\dfrac{1}{k+1})$$ .............[Using (i)]

$$(k+1)[\dfrac{(k+1)+1}{(k+1)}]$$

=(k+1)+1

Therefore, P(k+1) holds whenever P(k) holds.

Hence, the given equality is true for all natural numbers i.e., N by the principle of mathematical induction.

Answered by Pragya Singh | 1 year ago

### Related Questions

#### Given an example of a statement P (n) such that it is true for all n ϵ N.

Given an example of a statement P (n) such that it is true for all n ϵ N.

#### a + (a + d) + (a + 2d) + … + (a + (n-1)d) = n/2 [2a + (n-1)d]

a + (a + d) + (a + 2d) + … + (a + (n-1)d) = $$\dfrac{n}{2}$$ [2a + (n-1)d]

#### 72n + 23n – 3. 3n – 1 is divisible by 25 for all n ϵ N

72n + 23n – 3. 3n – 1 is divisible by 25 for all n ϵ N