## Rajasthan Board RBSE Class 11 Maths Chapter 4 Principle of Mathematical Induction Ex 4.1

Question 1.

If statement is P(n) : (n + 3) < 2^{n+3} then write P(4).

Solution:

P(n) : (n + 3) < 2^{n+3}

Putting n = 4

P(4) : (4 + 3) < 2^{4+3}

P(4) : 7 < 2^{7}

P(4) : 7 < 128 is true

Hence, P(4) : 7 < 2^{7}.

Question 2.

If statement

then test the authenticity of P(4).

Solution:

Let the given statement is P(n), where n ∈ N

So, P(n) = 1^{2} + 3^{2} + 5^{2} + … +(2n – 1)^{2}

L.H.S. = R.H.S.

Hence, P(4) is true.

Question 3.

Write nth term of 1 + (1 + 3) + (1 + 3 + 5) + …….

Solution:

1 + (1+ 3) + (1 + 3 + 5)+…….

= 1 + (1 + 3) + (1 + 3 + 5) + ……. + {1 + 3 + 5 + … +(2n – 1)}

T_{n} = a + (n – 1)d = 1 + (n – 1)2 = 1 + 2n – 2

T_{n} = 2n – 1

Hence, nth term = 1 + 3 + 5 + … + (2n – 1).

Question 4.

Write nth term of 1.4.7 + 2.5.8 + 3.6.9 + …….

Solution:

nth term of 1.4.7 + 2.5.8 + 3.6.9 + …….

= (nth term of 1, 2, 3, …).(nth term of 4, 5, 6, …).(nth term of 7, 8, 9, …)

= [1 + (n – 1) – 1].[4 + (n – 1) – 1].[7 + (n – 1)1]

= (1 + n – 1) . (4 + n – 1) . (7 + n – 1).

= n (n + 3) . (n + 6)

Hence, nth term = n.(n + 3).(n + 6).

**For all n ∈ N, by using principle of mathematical induction, then prove that: (Q. 5. to Q. 19)**

Question 5.

1 + 3 + …… + (2n – 1) = n^{2}.

Solution:

Let the given statement is P(n) where n ∈ N

P(n) : 1 + 3 + … + (2n – 1) = n2

when n = 1, P(1) = 1 = 1^{2} = 1

Hence given statement is true for n = 1.

So, P(1) is true

Let given statement is true for n = m i.e.,

P(m) = 1 + 3 + … + (2m – 1) = m^{2} …(i)

Now, we have to prove that given statement is true for n = m + 1, i.e., P (m + 1) is true.

Now, P(m + 1) = 1 + 3 + …… + {2(m + 1) – 1}

= (m + 1 )^{2}

= 1 + 3 + … + ( – 1)

= (m + 1)^{2}

Hence, given statement is also true for n = m + 1 i.e., P (m + 1) is true.

Hence, from the principle of mathematical induction we can say that the given statement is true for each natural number n ∈ N

Hence Proved.

Question 6.

1 + 4 + … + (3n – 2) =

Solution:

Let the given statement is P(n), where n ∈ N.

Hence, by principle of mathematical induction given statement is true for each n.

Hence Proved.

Question 7.

Solution:

Let the given statement is P(n), where n ∈ N

P(n) = 1.3 + 3.5 + 5.7 +……+ (2n – 1)(2n + 1)

Hence, given statement is also true for n = m + 1 i.e., P (m + 1) is true.

Hence, by the principle of mathematical induction we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 8.

1.3 + 2.4 + ……. + n(n + 2) =

Solution:

Let the given statement is P(n), where n ∈ N

So, P(n) = 1.3 + 2.4 + ……. + n(n + 2)

Hence, P(m + 1) is true.

Hence, by the principle of mathematical induction, we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 9.

1.2.3 + 2.3.4 + …… + n(n + 1) (n + 2) =

Solution:

Let given statement is P(x) where n ∈ N. i.e.,

P(n) = 1.2.3 + 2.3.4 +………+ n(n + 1)(n + 2)

Hence, the given statement is also true for n = m + 1, i.e, P(m + 1) is also true.

Hence, by the principle of mathematical induction.

We can say that the given statement is true for each natural numbers n ∈ N.

Hence Proved.

Question 10.

Solution.

Let given statement is P(n) where n ∈ N i.e.,

Hence, given statement is also true for n = m + 1, i.e., P(m + 1) is true.

Hence Proved.

Question 11.

Solution.

Let the given statement is P(n) when n ∈ N

i.e., P(n) = 1^{3} + 2^{3} + 3^{3} + ……. + n^{3} =

Here, given statement is also true for n = m + 1, i.e., P(m + 1) is also true.

Hence, by the principle of mathematical induction, we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 12.

Solution:

Let the given statements is P(n), where n ∈ N,

Hence, the given statement is true for n = m + 1, i.e., P (m + 1) is true.

Hence, by the principle of mathematical induction we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 13.

Solution:

Let the given statement is P(n), i.e.,

Hence, P(m + 1) is also true.

Hence, by the principle of mathematical induction the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 14.

Solution:

Let the given statement is P(n), where n ∈ N.

Hence, the given statement is also true for n = m + 1, i.e., P(m + 1), is true.

Hence, by the principle of mathematical induction, we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 15.

Solution:

Let the given statement is P(n), where n ∈ N,

When n = 1, then

Hence, the given statement is also true for n = m + 1, i.e., P(m + 1), is true.

Hence, by the principle of mathematical induction, we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 16.

Solution:

Let the given statement is P(n), where n ∈ N

P(n) = 1.3 + 2.3^{2} + 3.3^{3} + … + n.3^{n}

Hence, the given statement is also true for n = m + 1, i.e., P(m + 1) is true.

Hence, by the principle of mathematical induction, the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 17.

2^{n} > n

Solution:

Let P(n); 2^{n} > n

when n = 1, 2^{1} > 1, Hence, P(1) is true.

Let P(m) is true for n = m, i.e.,

P(m) : 2^{m} > m ……(i)

Now, we have to proved that the given statement is also true for n = m + 1 i.e., P(m + 1) is true

Multiplying by 2 on both sides of equation (i), we have

2 × 2^{m} > 2m

⇒ 2^{m+1} > 2m = m + m > m + 1

Thus, P(m + 1) is true.

Hence, by the principle of mathematical induction, P(n) is true for each natural number n ∈ N.

Hence Proved.

Question 18.

(1 + x)^{n} ≥ 1 + nx, x > 0

Solution:

Let P(n) : (1 + x)^{n} ≥ (1 + nx), x > 0

when n = 1 then P(n) is true

⇒ (1 + x) ≥ (1 + x) is true for x > -1 …(i)

For n = k

P(m) : (1 + x)^{m} ≥ (1 + mx), x > 0 is true …(ii)

Now, we have to prove that P(m + 1)

We have that

(1 + x)^{m+1} = (1 + x)^{m} (1 + x)

Given x > 0, So, (1 + x) > 0

Hence, using

(1 + x)^{m} ≥ (1 + mx)

we get (1 + x)^{m+1} ≥ (1 + mx)(1 + x)

i.e., (1 + x)^{m+1} ≥ (1 + x + mx + mx^{2}) …..(iii)

Since, m is a natural number and x^{2} ≥ 0 is such that

mx^{2} ≥ 0

So, (1 + x + mx + mx^{2}) ≥ (1 + x + mx)

⇒ (1 + x)^{m+1} ≥ (1 + x + mx)

⇒ (1 + x)^{m+1} ≥ [1 + (1 + m)x]

Since, statement (ii) is true.

Hence, by the principle of mathematical induction P(n) is true for each natural number n ∈ N.

Hence Proved.

Question 19.

1 + 2 + 3 + ……. + n < (2n + 1)^{2}.

Solution:

Let the given statement is P(n), where n ∈ N,

< [2(m + 1) + 1]^{2}

Hence, the given statement is also true for n = m + 1 i.e., P(m + 1) is also true.

Hence, from the principle of mathematical induction we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 20.

Prove that x^{2n} – y^{2n} is divisible by (x + y).

Solution:

Let the given statement is P(n), where n ∈ N

P(n) = x^{2n} – y^{2n}

For n = 1, P(1) = x^{2} – y^{2} = (x + y) (x – y),

which is divisible by (x + y)

Hence, given statement is true for n = 1, i.e., P(1) is true.

Let the given statement is true for n = m, i.e., P(m) is true.

Then P(m) = x^{2m} – y^{2m} is divisible by (x + y) ……(i)

Now, we have to prove that given statement is true for n = m + 1, i.e., P(m + 1) is true.

Now, we see that there are two terms in R.H.S.

In first term (x^{2m} – y^{2m}), which is divisible by (x + y) [From (i)]

and second term is also divisible by (x + y) because (x + y) is its factor.

Then sum of both terms is also divisible by (x + y).

Hence, the given statement is also true for n = k + 1, i.e., P(m + 1) is true.

Hence, by the principle of mathematical induction we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 21.

Prove that 2^{3n} – 1 is divisible by 7.

Solution:

Statement P(n) : 2^{3n} – 1 is divisible by 7

i.e., 2^{3n} – 1 = 7n

For n = 1, P(1)= 2^{3(1)} – 1 = 7 is divisible by 7

Hence, given statement is true for n = 1, i.e., P(1) is true.

Let P(m) is true, i.e. 23m – 1 = 7m ……(i)

Now, we have to prove that given statement is also true for n = m + 1 i.e.. P(m + 1) is true

i.e., 2^{3(m+1)} – 1, is divisible by 7.

⇒ P(m + 1) is true.

Hence, the given statement P(n) is true for each value of n.

Hence Proved.

Question 22.

Prove that: 10^{n} + 3.4^{n+2} + 5, is divisible by 9.

Solution:

Let the given statement

P(n) = 10^{n} + 3.4^{n+2} + 5 is divisible by 9.

For n = 1,

Hence, the given statement is true for n = m + i, i.e., P(m + 1) is true.

Hence, P(n) is true for each natural number n ∈ N.

Hence Proved.

Question 23.

Prove that : 41^{n} – 14^{n} is divisible by 27.

Solution:

Let the given statement is P(n) where n ∈ N,

i.e. P(n)= 41^{n} – 14^{n} is divisible by 27

For n = 1, P(1) = 41^{1} – 14^{1} = 41 – 14 = 27

which is divisible by 27

Hence, given statement is true for n = 1, i.e., P( 1) is true

Let given statement is true for n = m i.e., P(m) is true

Then P(m) = 41^{m} – 14^{m}, is divisible by 27 ……(i)

Now, we have to prove that given statement is true for n = m + 1, i.e., P(m + 1) is also true

Now,

Here, there are two terms in R.H.S. In first term (41^{m} – 14^{m}) is divisible by 27 [From (i)] and second term is also divisible by 27 because 27 is its one factor.

Then sum of both terms is also divisible by 27.

Hence, the principle of mathematical inducation, we can say that the given statement is true for each natural numbers n ∈ N.

Hence Proved.

Question 24.

Prove that (2n + 7) < (n + 3)^{2}, ∀ n ∈ N.

Solution:

Let the given statement is P(n) where n ∈ N

P(n) = (2n + 7) < (n + 3)^{2}

For n = 1, P(1) = (2 × 1 + 7) = 9 < (1 + 3)^{2} = 16,

9 < 16

Hence, given statement is true for n = 1, i.e., P(1) is true.

Let given statement is true for n = m. i.e., P(m) is true.

Then P(m) = (2m + 7) < (m + 3)^{2}

Now, we have to prove that given statement is true is true for n = k + 1 i.e., P(m + 1) is true.

Hence, the given statement is also true for n = m + 1, i.e., P(m + 1) is true.

Hence, by the principle of mathematical inducation we can say that the given statement is true for each natural number n ∈ N.

Hence Proved.

Question 25.

Solution:

Let the given statement is P(n), where n ∈ N

Thus, P(m + 1) is true, when P(m) is true.

Hence, by the principle of mathematical induction, P(n) is true for n ∈ N.

Hence Proved.

## Leave a Reply