Chapter 4

Principle of Mathematical Induction

Solutions (Set-1)

Very Short Answer Type Questions :

1. Let P(n) denotes the statement “2n n!. Show that P(1), P(2) and P(3) are true but P(4) is not true.

Sol. Here given that P  n  : 2n  n !

 P 1  21  1!

 2>1
 P(1) is true.

P  2  22  2!

4>2
 P(2) is true.
Now P(4) = 24 = 16
4! = 24

 24  4!
 P (4) is false.
2. Give an example of a statement P(n) which is true for all n.

n  n  1
Sol. P(n) : 1 + 2 + 3 + ... + n  is true for all n.
2

3. Let P(n) denote the statement “23n – 1 is a multiple of 7”. Show that
(i) P(1), P(2) and P(3) are true.
(ii) If P(m) is true, then P(m + 1) is also true.
Sol. (i) P(1) = 23×1 –1 = 7 is a multiple of 7
P(2) = 23×2 – 1 = 63 is a multiple of 7
P(3) = 29 – 1 = 511 is a multiple of 7
Hence P(1), P(2) and P(3) are true for the given statement.

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
 2 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-1)

(ii) P(m) is true  23m – 1 is a multiple of 7

 23m – 1 = 7, for some integer .
23m = 7+ 1 ...(i)
Now, 23(m+1) – 1 = 23m+3 –1 = 23m . 23 – 1
= (7+ 1)8–1
= 56 + 7 = 7(8+ 1) is a multiple of 7
Hence if P(m) is true, then P(m + 1) is also true.
4. Let P(n) be the statement : “n(n + 1) (n + 2) is a multiple of 12”. Show that P(3) and P(4) are true but P(5)
is not true.
Sol. P(3) = “3 × 4 × 5 is a multiple of 12” i.e “60 is a multiple of 12”, which is true.
P(4) = 4 × 5 × 6 is a multiple of 12
= 120 is a multiple of 12, which is true
P(5) = 5 × 6 × 7 is a multiple of 12
= 210 is a multiple of 12 which is false.

n  n  1
5. Let P(n) denote the statement : “ is a natural number”. Show that P(2) and P(3) are true but P(4) is
6
not true.

2  2  1 6
Sol. P(2) =   1 is a natural number, which is true
6 6

3  3  1 4
P(3) =   2 is a natural number, which is true
6 6

4   4  1 20
P(4) =  is a natural number, which is false.
6 6
6. Let P(n) denote the statement : “2n  3n”. Show that if P(m) is true, then P(m + 1) is also true.

Sol. P(m) is true  2m  3m , multiplying both sides by 2

2m 1  6m

 2m 1  3m  3m

 2m 1  3m  3 Since m  1

 2m 1  3  m  1

 P  m  1 is true

7. Let P(n) denote the statement “n2 – n + 41 is prime”. Show that P(1) and P(2) are true but P(41) is not true.
Sol. P(n) : n2 – n + 41 is prime
P(1) is “12 – 1 + 41 is prime
i.e 41 is prime, which is true

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
Solutions of Assignment (Level-I) (Set-1) Principle of Mathematical Induction 3
P(2) = “22 – 2 + 41 is prime”
i.e 43 is prime, which is true.
So, P(1) and P(2) is true.
However, P(41) is “412 – 41 + 41 i.e 412 is prime, which is not true.
8. Let P(n) : “4n > n”. Show that if P(m) is true, then P(m + 1) is also true, m  
Sol. Let P(m) be true  4m > m ...(i)
To prove : P(m + 1) i.e 4m+1 > m + 1
Multiplying both sides of (i) by 4, we get
4m × 4 > 4m  4m+1 > m + 3m > m + 1
 4m+1 > m + 1  P(m + 1) is true.
9. Using the principle of mathematical induction prove that for all n  N
4 + 8 + 12 + ...... to n terms = 2n(n + 1).
Sol. nth term of series tn = 4 + (n – 1)4 = 4n
So we have to prove
P(n): “4 + 8 +12 + ... + 4n = 2n(n + 1)”
P(m) is true  4 + 8 + 12 + ... + 4m = 2m (m + 1), m  » .
Adding 4(m+1) to both sides, we get
4 + 8 + 12 + ... + 4m + 4(m + 1) = 2m(m + 1) + 4(m + 1)
= 2(m + 1) (m + 2)
 P(m + 1) is true.
Hence P(x) is true for all n  » .
10. By the principle of mathematical induction prove that

n  n  1
1 + 2 + 3 + ...... n = , nN .
2
Sol. Given that
n  n  1
P(n) = 1 + 2 + 3 + ... + n 
2
Let P(k) is true for all k  » .

k  k  1
i.e 1 + 2 + 3 + ... + k 
2
Now, P(k + 1) = P(k) + (k + 1)

k  k  1 k 
=   k  1 =  k  1   1
2 2 

 k  1 k  2
=
2
 P(k + 1) is true.
Then, by the principle of mathematical induction P(n) is true for all natural number n.

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
 4 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-1)

Short Answer Type Questions :

1 1 1 1 n
11. By using PMI, prove that for all n  N ,    ..........   .
1 4 4  7 7  10  3 n  2  3 n  1 3 n 1

k 1 1  1 
   k
3k  1  3k  1 3k  4  3k  1  3k  4 
Sol. P(k + 1) =

1  3k 2  4k  1
=  
3k  1  3 k  4 

1   k  1 3k  1 
 
=
 3 k  1  3k  4 

k 1
=
3k  4
Hence P(n) is true for all natural number n.
12. By using PMI, prove that 102n–1 + 1 is divisible by 11.
Sol. Here
P(n): f(n) = 10(2n – 1) + 1 is divisible by 11
P(1): f(1) = 10 + 1 = 11 is divisible by 11
for n = 1
 P(1) is true ...(i)
Let P(k) : f(k) = 102k–1 + 1 is divisible by 11
Hence f(k) = 11 ...(ii)
Now,
P(k + 1) = f(k + 1) = 102(k + 1)–1 + 1
= 102k + 1 + 1 = 102k–1. 100 + 1
= (99.102k–1) + (102k–1 + 1)
= 99.10(2k–1) + 11
= 11 [9.102k–1 + ] is divisible by 11
 P(k + 1) is also divisible by 11
 By the principle of mathematical inductionP(n) is true for all natural number n.
13. By using PMI, prove that 52n – 1 is divisible by 24.
Sol. Let P(n) : “52n – 1 is divisible by 24”
Now, P(1) means 52×1 – 1 = 24 is divisible by 24,
Which is true.
So, P(1) is true.

Let P(k) be true for k  » . i.e 52k – 1 is divisible by 24.

 52k – 1 = 24 
To prove : P(k + 1) is true.

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
Solutions of Assignment (Level-I) (Set-1) Principle of Mathematical Induction 5
Now, 52(k+1) – 1 = 52k . 52 – 1
= 25.52k – 1.
= (24.52k) + (52k – 1).
= 24.52k + 24
= 24(52k +) is divisible by 24.
So, P(k)  P(k + 1), Also P(1) is true.
Therefore, by the principle of mathematical induction P(n) is true for all n  » .
14. By using PMI, prove that n(n + 1) (2n + 1) is divisible by 6.
Sol. P(k) = k(k + 1) (2k + 1) = 6
 P(k + 1) = (k + 1) (k + 2) {2(k + 1) + 1}
= (k + 1) (k + 2) {(2k + 1) + 2}
= (k + 1) (k + 2) (2k + 1) + 2(k + 1) (k + 2)
= k(k + 1) (2k + 1) + 2(k + 1) (2k + 1) + 2(k + 1) (k + 2)
= k(k + 1) (2k + 1) + 2(k + 1) [2k + 1 + k + 2]
= k(k + 1) (2k + 1) + 2(k + 1) 3(k + 1)
= k(k + 1) (2k + 1) + 6(k + 1) (k + 1)
= 6[+ (k + 1)2] is divisible by 6.
15. Show that by using PMI, 23n – 1 is divisible by 7.
Sol. P(k): 23k – 1 is divisible by 7
 23k – 1 = 7. for some integer 
P(k + 1) = 23(k+1) – 1 = 23k.23 – 1
= 23k (7 + 1) – 1 = 7.23k + 23k – 1 = 7.23k + 7
 P(k + 1) = 7(23k + )
 P(k + 1) is divisible by 7.
16. By the help of PMI, prove that n(n + 1) is multiple of 2 or n2 + n is an even number.
Sol. P(k) : k(k + 1) is divisible by 2
 P(k) = 2 for some integer 
P(k + 1) = (k + 1) (k + 2)
= k(k +1) + 2(k + 1)
= 2+ 2(k + 1)
= 2(+ k + 1)
 P(k + 1) is divisible by 2.
17. By using the principle of mathematical induction prove that for all n  N
1
1 + 4 + 7 + ...... + 3n – 2 = n(3n–1)
2
1
Sol. Let P(n) = 1 + 4 + 7 + ... + (3n – 2) = n  3n  1
2
for n = 1

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
 6 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-1)

1 1
P(1) : 1 = ·1 3  1  1  1   1  2  1 = 1 which is true.
2 2
 P(1) is true ...(i)

1
Let P(k) = 1 + 4 + 7 + ... + (3k – 2) = k  3k  1 is true for k  » .
2
P(k + 1) = P(k) + (3k + 1)

1
= k  3k  1   3k  1
2

1 2 1
= 3k  5k  2    k  1 3k  2
2 2

1
=  k  1 3  k  1  1
2
 P(k + 1) is also true
 P(k) true  P(k + 1) is true and P(1) is also true, therefore by the principle of mathematical induction
P(n) is true for all n  » .
18. By using the principle of mathematical induction, prove that
2 + 3 · 2 + 4 · 22 + ...... + (n + 1)2n–1 = n · 2n. for all n  N .
Sol. Let P(n): 2 + 3·2 + 4·22 + ... + (n + 1)2n–1 = n·2n
P(1) means 2 = 1·2
 2 = 2, which is true
 P(1) is true ...(i)

Let us assume that P(k) is true for all k  »

i.e 2 + 3·2 + 4·22 + ... + (k + 1) 2k–1 = k.2k ...(ii)

Now to prove P(k + 1) is true
 P(k + 1) = P(k) + (k + 2)2k
= k2k + (k + 2)·2k = 2k[k + k + 2]
= (k + 1)·2k · 2
= (k + 1)2k+1
 P(k + 1) is also true
Hence, by induction, P(n) is true for all n  » .

Long Answer Type Questions :

By using the principle of mathematical induction, prove the following for all n  N .
19. 12n + 2 · 5n–1 is divisible by 7.
Sol. Let P(n) denote the statement: 12n + 2·5n–1 is divisible by 7
Now, P(1) means 12 + 2·51–1
= 12 + 2 = 14 is divisible by 7
Therefore P(1) is true.

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
Solutions of Assignment (Level-I) (Set-1) Principle of Mathematical Induction 7
Let us assume that P(k) is true
i.e 12k + 2·5k–1 = 7
we shall prove that P(k + 1) is also true,
i.e 12k+1 + 2·5k is also divisible by 7
Now, 12k+1 + 2·5k = 12·12k + 2·5·5k–1
= (7 + 5)·12k + 2·5·5k–1
= 7·12k + 5·12k + 2·5·5k–1
= 7·12k + 5[12k + 2·5k]
= 7·12k + 5 × 7
= 7[12k + 5]
 P(k + 1) is divisible by 7.
Hence, by the principle of mathematical induction. P(n) is true for all n  » .
20. The sum of cubes of three consecutive natural numbers is divisible by 9.
Sol. P(k + 1) = (k + 1)3 + (k + 2)3 + (k + 3)3
= (k + 1)3 + (k + 2)3 + k3 + 9k2 + 27k + 27
= k3 + (k + 1)3 + (k + 2)3 + 9(k2 + 3k + 3)
= P(k) + 9(k2 + 3k + 3)
Since P(k) is divisible by 9
Therefore P(k) + 9(k2 + 3k + 3) is also divisible by 9
 P(k + 1) is divisible by 9
21. 152n–1 + 1 is divisible by 16.
Sol. P(k + 1) = 152k+1 + 1 = 152 × 152k–1 + 1
= (152 – 1)152k–1 + 152k–1 + 1
= 224·152k–1 + (152k–1 + 1)
= 224·152k–1 + P(k)
Since P(k) is divisible by 16
Hence P(k + 1) = 224·152k–1 + P(k) is also divisible by 16
22. n(n2 – 1) is divisible by 24 where n is an odd number greater than 2.
Sol. P(k + 2) = (k + 2) {(k + 2)2 – 1} = (k + 2) [k2 + 4k + 3]
= k3 + 6k2 + 11k + 6
= k(k2 – 1) + 6(k + 1)2
as k is odd, (k + 1) would be even and 6(k + 1)2 would be divisible by 24.
23. (72n + 23n–1. . 3n–1) is divisible by 25.
Sol. P(k + 1) = 72k+2 + 23k·3k = 72k.49 + 23k–3·8·3k–1·3
= 25 [2·72k + 23k–3·3k–1] – [72k + 23k–3·3k–1]
Since 72k + 23k–3 3k–1 is divisible by 25
 P(k + 1) is divisible by 25

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
 8 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-1)

12 n
24. 3 · 22 + 32 23 + 33 24 + ...... + 3n 2n+1 = (6 – 1).
5

12 n
Sol. P(n): 3·22 + 32·23 + 32·24 + ... + 3n·2n+1 = (6  1)
5

12
P(1): 3·22 =  6  1  12 = 12, which is true
5
Therefore P(1) is true.

Let P(k) be true, k  »

12 k
3·22 + 32·23 + ... + 3k 2k+1 = (6 – 1)
5
Consider P(k + 1)

3·22 + 32·23 + ... + 3k·2k–11 + 3k+1·2k+2 =

5

12 k 11
6 1 
L.H.S =
5

12 k

6  1  3k  3  2k  22

=
5

12 k

6  1  6k  12

=
5

12 k
6  1  6k  5 
12 
=  5  1 6k  1
5 

12  12  k 1 
= 6  6k  1  6  1
5  5 
 P(k) is true  P(k + 1) is true
Hence, by the principle of mathematical induction P(n) is true for n  » .
25. 1 + 5 + 9 + 13 + ...... + (4n – 3) = n(2n – 1).
Sol. P(n): 1 + 5 + 9 + ... + (4n – 3) = n(2n – 1)
P(1): 1 = 1·(2 – 1)  1 = 1, which is true.
Let P(k) be true, i.e,
1 + 5 + 9 + ... + (4k – 3) = k(2k – 1)
To show P(k + 1) is true
i.e. 1 + 5 + ... + (4k – 3) + (4k + 1) = (k + 1) (2k + 1)
consider LHS = k(2k – 1) + (4k + 1)
= 2k2 + 3k + 1
= 2k2 + 2k + k + 1
= 2k(k + 1) + 1(k + 1)
= (k + 1) (2k + 1) = R.H.S
 P(k) is true  P(k + 1) is true, therefore, by the principle of mathematical induction P(n) is true for n  ».

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
Solutions of Assignment (Level-I) (Set-1) Principle of Mathematical Induction 9
26. 4n + 15n – 1 is divisible by 9.
Sol. P(k + 1)  4k+1 + 15 (k + 1) – 1
= 4k·4 + 15k + 15 – 1
= 4k·4 + 15k + 14
= 4k(9 – 5) + (90k – 75k) + (9 + 5)
= 9·4k + 90k + 9 – 5(4k + 15k – 1)
= 9(4k + 10k + 1) – 5P(k)
[Since P(k) = 4k + 15k – 1]
 P(k + 1) is divisible by 9 since P(k) is divisible by 9.
27. 72n – 1 is divisible by 48.
Sol. P(k + 1) = 72k+2 – 1 = 72k·49 – 1
= 49 (72k – 1) + 48
 P(k + 1) is divisible by 48 since P(k) = 72k – 1 is divisible 48.
28. 52n+2 – 24n – 25 is divisible by 576.
Sol. P(k + 1) = 52k+4 – 24k – 49
= 25[52k+2 – 24k – 25] + 576 (k + 1)
 P(k + 1) is divisible by 576 since P(k) = 52k+2 – 24k – 25 is divisible by 5·76
29. 6n+2 + 72n+1 is divisible by 43.
Sol. P(k + 1) = 6k+1+2 + 72(k+1)+1
= [6k+2 + 72k+1] 6 + 72k+1·43
P(k + 1) is divisible by 43 since P(k) = 6k+2 + 72k+1 is divisible by 43.
30. 12n + 25n–1 is divisible by 13.
Sol. P(k + 1) = 12k+1 + 25k = 12k (13 – 1) + 25k–1 (26 – 1)
= 13(12k + 2·25k–1) – [12k + 25k–1]
 P(k + 1) is divisible by 13 since P(k) = 12k + 25k–1 is divisible by 13.
31. Prove by the method of induction that every even power of every odd integer greater than 1, When divided
by 8 leaves the remainder 1.
Sol. First odd integer greater than one is 3, general odd integer is (2r + 1).

To show (2r + 1)2n = 8m + 1, m  ».

i.e (2r + 1)2n – 1 is divisible by 8

Let P(n) : (2r + 1)2n – 1
P(1) = (2r + 1)2 – 1 = 4r2 + 4r = 4r(r + 1)
As, r(r + 1) is always even, therefore, P(1) is true.
Let P(k) be true i.e (2r + 1)2k – 1 is divisible by 8

 (2r + 1)2k = 8m + 1 for m  ».

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
10 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-1)

Consider P(k + 1) : (2r + 1)2(k+1) – 1 is divisible by 8

consider
(2r + 1)2k . (2r + 1)2 – 1
= (8m + 1) (8p + 1) – 1
= 64mp + 8m + 8p + 1 – 1
= 8[8mp + m + p], which is divisible by 8.
 P(k) is true  P(k + 1) is true.
Hence, by the principle of mathematical Induction P(n) is true for all n  ».

‰ ‰ ‰

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
Chapter 4

Principle of Mathematical Induction

Solutions (Set-2)

1. Let P(n) be a statement and let P(n)  P(n + 1) for all natural numbers n, then P(n) is trure

(1) For all n  N . (2) For all n > m, m being a fixed positive integer

(3) For all n > 1 (4) Nothing can be said.

Sol. Answer (4)

2. The statement (n + 3)2 > 2n+3 is true.

(1) For all n (2) For all n  3

(3) For all n  2 (4) No n  N

Sol. Answer (4)

3. A student was asked to prove a statement P(n) by using the principal of mathematical induction. He proved
that P(n)  P(n + 1) for all n  N and also that P(4) is true:

On the basis of the above he can conclude that P(n) is true

(1) For all n  N (2) For all n > 4

(3) For all n  4 (4) For all n < 4

Sol. Answer (3)

4. Let P(n): n2 – n + 41 is a prime number, then

(1) P(1) is not true (2) P(5) is not true

(3) P(9) is not true (4) P(41) is not true

Sol. Answer (4)

5. Let P(n) be a statement such that P(n)  P(n + 1) for all n  N . Also, if P(k) is true, k  N , then we can
conclude that

(1) P(n) is true for all n (2) P(n) is true for all n  k

(3) P(n) true for any n < k (4) None of these

Sol. Answer (2)

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
12 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-2)

6. Let P(n) : n2 + n is odd, then P(n)  P(n + 1) for all n. and P(1) is not true.

From here, we can conclude that

(1) P(n) is true for all n  N (2) P(n) is true for all n  2

(3) P(n) is false for all n  N (4) P(n) is true for all n  3

Sol. Answer (3)

7. Consider the statement P(n) : n2  100. Here.

P(n)  P(n + 1) for all n. Does it mean that

(1) P(n) is true for all n (2) P(n) is true for all n  2

(3) P(n) is true for all n  3 (4) None of these

Sol. Answer (4)

8. The statement xn – yn is divisible by (x – y) where n is a positive integer is

(1) Always true (2) Only true for n < 10

(3) Always false (4) Only true for n > 10

Sol. Answer (1)

9. 9n – 8n – 1 is divisible by 64 is

(1) Always true (2) Always false

(3) Always true for rational values of n (4) Always true for irrational values of n

Sol. Answer (1)

10. For all natural number n, 32n – 1 is divisible by

(1) 3 (2) 5 (3) 6 (4) 8

Sol. Answer (4)

11. Let P(n) = 10n + 3 is a prime number. P(n) is true nN, such that

(1) n > 2 (2) n > 3 (3) n < 4 (4) n  2

Sol. Answer (4)

12. “xn – yn is divisible by (x + y)” is true when n( N) is of the form (k  N)

(1) 4k + 1 (2) 4k + 3 (3) 4k + 7 (4) 2k

Sol. Answer (4)

13. The statement which is correct for all n  N, is
(1) 2n > 2n + 1 (2) xn – yn is divisible by (x + y)
1 1 1 1 1
(3) xn – yn is divisible by (x – y) (4) 1     2  2 
4 9 16 n n
Sol. Answer (3)
14. n(n + 1) (n + 2) is divisible by k for n  N. The largest k is
(1) 2 (2) 3 (3) 6 (4) 12
Sol. Answer (3)

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
Solutions of Assignment (Level-I) (Set-2) Principle of Mathematical Induction 13
15. Mathematical induction is a tool or technique which is used to prove a proposition about all
(1) Number (2) Integers (3) Whole number (4) None of these
Sol. Answer (4)
16. For each n  N, 32n – 1 is divisible by
(1) 8 (2) 16 (3) 32 (4) 10
Sol. Answer (1)
17. The statement n! > 2n – 1, n  N is true for
(1) n > 1 (2) n > 2 (3) All n (4) No n
Sol. Answer (2)
18. For each n  N, 3·(52n + 1) + 23n + 1 is divisible by
(1) 17 (2) 19 (3) 21 (4) 23
Sol. Answer (1)
19. If b and c  N and b < c then values of b and c in terms of n  N such that the statement
“3.6 + 6.9 + 9.12 + … + 3n.(3n + 3) = 3nbc” is true for all n
(1) b = n, c = n (2) b = n + 1, c = n + 2
(3) b = n, c = n + 1 (4) b = n + 1, c = n + 1
Sol. Answer (2)
20. The proposition among the following that is not true for all n  N, is
(1) 2n > n (2) 2n > n2
(3) 1 + 2 + 3 + … + n < (2n + 1)2 (4) (2n + 7) < (n + 3)2
Sol. Answer (2)
21. If 7 + 77 + 777 + … upto nth term

7
 [a.10 n 1  bn  c ] is true n  N, then
81
(1) a = 1, b = 9, c = 9 (2) a = 1, b = 9, c = 10
(3) a = 1, b = –9, c = –9 (4) a = 1, b = –9, c = –10
Sol. Answer (2)
22. The proposition that is not true for n > 1 (n  N), is

1 1 1 1 1 1 1
(1) 1    ....  2  2  (2) 1    .....   n
4 9 n n 2 3 n

1 1 1 13 1 3 5 2n  1 1
(3)   ....   (4)   ........ 
n 1 n  2 2n 24 2 4 6 2n 3n  1
Sol. Answer (4)
23. Which of the following is true for n  N ?

1 1 1 1 1 1 1
(1)    .....  n  1 (2)   ......  1
2 4 8 2 n 1 n  2 3n  1

2n 4n
(3) n4 > 10n (4) Cn 
n 1
Sol. Answer (1)

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456
14 Principle of Mathematical Induction Solutions of Assignment (Level-I) (Set-2)

1 1 1
24. For all n(> 1)  N, by using mathematical induction or otherwise 1    in its lowest form is
2 3 n
(1) Odd integer (2) Even integer

Odd integer Even integer

(3) (4)
Even integer Odd integer

Sol. Answer (3)

25. The sum of the squares of three consecutive odd numbers increased by 1 is divisible by (use mathematical
induction)
(1) 12 as well as 24 (2) 12 but not 24
(3) Neither by 12 nor by 24 (4) By all multiples of 12
Sol. Answer (2)

‰ ‰ ‰

Aakash Educational Services Limited - Regd. Office : Aakash Tower, 8, Pusa Road, New Delhi-110005 Ph.011-47623456