MATHEMATICS

TARGET : JEE (Main + Advanced) 2017

EST INF ORM AT IO

DPPDAILY PRACTICE PROBLEMS

Course : VIPUL (JB)

NO. 49
This DPP is to be discussed in the week (23-11-2015 to 28-11-2015)

ANSWERKEY
DPP No. : 49 (JEE-ADVANCED)
1. (D) 2. (B) 3. (B) 4. (B) 5*. (A, B, C)

DPP No. : 49 (JEE-ADVANCED)

Total Marks : 37 Max. Time : 41 min.
Single choice Objective ('1' negative marking) Q.1 to 4 (3 marks, 3 min.) [12, 12]
Multiple choice Type ('1' negative marking) Q. 5 (5 marks, 4 min.) [5, 4]
Subjective Questions ('1' negative marking) Q.6 to 10 (4 marks, 5 min.) [20, 25]
1. If p(n) : n2 > 100 then
(A) p(1) is true (B) p(4) is true
(C) p(k) is true k 5, k N (D*) p(k + 1) is true whenever p(k) is true where k N
;fn p(n) : n2 > 100 rks
(A) p(1) lR; gS (B) p(4) lR; gS
(C) p(k) lR; gS k 5, k N (D*) p(k + 1) lR; gS tcfd p(k) lR; gS] tgk k N
Sol. P(n) ; n2 > 100
Let P(k) is true then
k2 > 100
k2 + 2k + 1 > 100 + 2k + 1
(k + 1)2 > 100 + 2k + 1
(k + 1)2 > 100
P(k + 1) is true
Hindi P(n) ; n2 > 100
ekuk P(k) lR; gS rc
k2 > 100
k2 + 2k + 1 > 100 + 2k + 1
(k + 1)2 > 100 + 2k + 1
(k + 1)2 > 100
P(k + 1) lR; gS

2. n3 + (n + 1)3 + (n + 2)3 is divisible for all n N by

(A) 3 (B*) 9 (C) 27 (D) 81
R;sd n N ds fy, n3 + (n + 1)3 + (n + 2)3 foHkkftr gS&
(A) 3 ls (B*) 9 ls (C) 27 ls (D) 81 ls
Sol. Let p(n) = n3 + (n + 1)3 + (n + 2)3 , p(A) = 36, p(B) = 99 both are divisible by 99
Let it is true for n = k
k3 + (k + 1)3 + (k + 2)3 = 9q ; q
adding 9k2 + 27k + 27 both sides
k3 + (k + 1)3 + (k + 2)3 + 9k2 + 27k + 27 = 9q + 9k2 + 27 k + 27
(k + 1)3 + (k + 2)3 + (k + 3)3 = 9r ; r

Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : contact@resonance.ac.in
PAGE NO.-1
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029
Hindi. ekuk p(n) = n3 + (n + 1)3 + (n + 2)3 , p(A) = 36, p(B) = 99 nksuksa 99 ls foHkkT; gS
ekuk ;g n = k ds fy, lR; gS
k3 + (k + 1)3 + (k + 2)3 = 9q ; q
nksuksa vkSj 9k2 + 27k + 27 tksM+us ij
k3 + (k + 1)3 + (k + 2)3 + 9k2 + 27k + 27 = 9q + 9k2 + 27 k + 27
(k + 1)3 + (k + 2)3 + (k + 3)3 = 9r ; r
3. Statement 1. For every natural number n 2.
1 1 1
...... > n.
1 2 n
Statement 2. For every natural numbre n 2.
n(n 1) < n + 1.
(A) Statement-1 is False, Statement-2 is True.
(B*) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(C)Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(D) Statement-1 is True, Statement-2 is False
dFku 1 izR;sd izkd`r la[;k n 2 ds fy;s]
1 1 1
...... > n.
1 2 n
dFku 2 izR;sd izkd`r la[;k n 2 ds fy;s]
n(n 1) < n + 1.
(A) dFku&1 vlR; gS] dFku&2 lR; gSA
(B*) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k gSA
(C) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k ugha gSA
(D) dFku&1 lR; gS] dFku&2 vlR; gSA
Sol. For n 2 ds fy;s
n2 + n < n2 + n + n + 1
n2 + n < (n + 1)2
1 1
statement -2 is true dFku -2 lR; gSA n n 1 >
n n1
1 1 1 1 1 1 1 1 1 n
> , > .... . + +......
1 n 2 n n n 1 2 n n

4. Let S (k) = 1 + 3 + 5 +.......+ (2k 1) = 3 + k2. Then which of the following is true ?
(A) S(1) is correct
(B*) S(k) S (k + 1)
(C) S(k) / S(k + 1)
(D) Principle of mathematical induction can be used to prove the formula
ekuk S (k) = 1 + 3 + 5 +.......+ (2k 1) = 3 + k2 rks fuEu esa ls dkSulk lR; gS?
(A) S(1) lR; gS
(B*) S(k) S (k + 1)
(C) S(k) / S(k + 1)
(D) xf.kfr; vkxeu ds fl)kUr ls fl) fd;k tk ldrk gS
Sol. Put k = 1
LHS 1 RHS = 4
LHR RHS
Let S(k) is true
then 1 + 3 + 5 +....(2k 1)
= 3 + k2
add (2k + 1) both the side
1 + 3 + 5 +.... + (2k 1) + (2k + 1)
= 3 + k2 + 2k + 1
S(k + 1) = 3 + (k + 1)2
then if S(k) is true S(k + 1) is also true.

Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : contact@resonance.ac.in
PAGE NO.-2
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029
Hindi. k = 1 j[kus ij
LHS 1 RHS = 4
LHR RHS
ekuk S(k) lR; gSA
rc 1 + 3 + 5 +....(2k 1)
= 3 + k2
(2k + 1) nksuksa vksj tksM+us ij
1 + 3 + 5 +.... + (2k 1) + (2k + 1)
= 3 + k2 + 2k + 1
S(k + 1) = 3 + (k + 1)2
rc ;fn S(k) lR; gS S(k + 1) Hkh lR; gksxkA

5*. By principle of mathematical induction, 32n+2 8n9 is divisible for every natural number n by
(A*) 16 (B*) 8 (C*) 64 (D) 9
xf.krh; vkxeu ds fl)kar ls R;sd kd`r la[;k n ds fy,] 32n+2 8n9 fuEu esa ls fdlls foHkkftr gS&
(A*) 16 ls (B*) 8 ls (C*) 64 ls (D) 9 ls
Sol. Let n = 1 then p(A) = 64
Let p(k) is divisible by 64
32k + 2 8k 9 is divisible by 64
Now,
P(k + 1) = 32(k + 1) + 2 8(k + 1) 9
= 32k + 2 9 8 k 9 9 9 8 + 72 + 64 k
= 9(32k + 2 8k 9) + 64 (k + 1)
Which is divisible by 64
Hindi. ekuk n = 1 rc p(A) = 64
ekuk p(k), 64 ls foHkkT; gS
32k + 2 8k 9, 64 ls foHkkT; gS
vc
P(k + 1) = 32(k + 1) + 2 8(k + 1) 9
= 32k + 2 9 8 k 9 9 9 8 + 72 + 64 k
= 9(32k + 2 8k 9) + 64 (k + 1)
tks 64 ls foHkkT; gS
6. Prove that fl) dhft, fd 2n > n, n N.
Sol. (i) Given statement is true for n = 1
(ii) Let us assume that the statement is true for n = k
i.e. 2k > k 2k = k + where R+
(iii) For n = k + 1,
2k+1 = 2(2k) = 2(k + ) = k + k + 2 > k + 1
so by principle of mathematical induction the statement is true for all n N
Hindi. (i) fn;k x;k dFku lR; gS n = 1 ds fy,
(ii) ekuk fn;k x;k dFku lR; gS n = k ds fy,
i.e. 2k > k 2k = k + tgk R+
(iii) n = k + 1 ds fy,
2k+1 = 2(2k) = 2(k + ) = k + k + 2 > k + 1
vr% xf.krh; vkxeu ds fl}kUr ls fn;k x;k dFku lR; gS lHkh n N ds fy,
7. Use the principle of mathematical induction to prove that n(n + 1)(n + 2) is a multiple of 6 for all natural
numbers n.
xf.krh; vkxeu fof/k dh lgk;rk ls fl) dhft, n(n + 1)(n + 2) dk eku 6 dk xq.kd gksxkA
Sol. (i) Given statement is true for n = 1
(ii) Let us assume that the statement is true for n = k
i.e. k (k + 1) (k + 2) = 6
(iii) For n = k + 1,
(k + 1)(k + 2)(k + 3) = k(k + 1)(k + 2) + 3(k + 1)(k + 2)
= 6 + 3(k + 1)(k + 2) = multiple of 6 as (k + 1)(k + 2) is even
So the result is true for n = k + 1
Hence by principle of mathematical induction the statement is true for all n N
Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : contact@resonance.ac.in
PAGE NO.-3
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029
Hindi. (i) fn;k x;k dFku lR; gS n = 1 ds fy,
(ii) ekuk fn;k x;k dFku lR; gS n = k ds fy,
i.e. k (k + 1) (k + 2) = 6
(iii) n = k + 1 ds fy,
(k + 1)(k + 2)(k + 3) = k(k + 1)(k + 2) + 3(k + 1)(k + 2)
= 6 + 3(k + 1)(k + 2) = 6 dk xq.kt gS D;ksafd (k + 1)(k + 2) le la[;k gSA
blfy, n = k + 1 ds fy, dFku lR; gSA
vr% xf.krh; vkxeu ds fl}kUr ls fn;k x;k dFku lR; gS lHkh n N ds fy,

8. By using PMI, prove that xf.krh; vkxeu ds fl)kar ls fl) dhft, fd 2 + 4 + 6 + ......+ 2n = n (n + 1), n
N
Sol. (i) Given statement is true for n = 1
(ii) Let us assume that the statement is true for n = k
i.e. 2 + 4 + 6 + ......+ 2k = k(k + 1)
(iii) For n = k + 1,
L.H.S. = 2 + 4 + 6 + ......+ 2k + 2(k + 1) = k(k + 1) + 2k + 2 = (k + 1) (k +2) = R.H.S.
so by principle of mathematical induction the statement is true for all n N
Hindi. (i) fn;k x;k dFku lR; gS n = 1 ds fy,
(ii) ekuk fn;k x;k dFku lR; gS n = k ds fy,
i.e. 2 + 4 + 6 + ......+ 2k = k(k + 1)
(iii) n = k + 1 ds fy,
L.H.S. = 2 + 4 + 6 + ......+ 2k + 2(k + 1) = k(k + 1) + 2k + 2 = (k + 1) (k +2) = R.H.S.
vr% xf.krh; vkxeu ds fl}kUr ls fn;k x;k dFku lR; gS lHkh n N ds fy,

9. Prove by using principle of mathematical induction : 2n < 3n , n N

xf.krh; vkxeu fl}kUr ls fl} dhft;s fd : 2n < 3n , n N
Sol. For n = 1, 21 < 31 which is true.
Let us assume that the result is true for n = k i.e. 2k < 3k.
Now 2k < 3k 2(2kk) < 2(3k) < 3(3k) 2k+1 < 3k+1
true for n = k + 1
Hence by PMI 2n< 3n for all n N
Hindi. n = 1 ds fy;s, 21 < 31 tks fd lR; gS
ekuk fd ifj.kke n = k ds fy;s lR; gS vr% 2k < 3k.
vc 2k < 3k 2(2kk) < 2(3k) < 3(3k) 2k+1 < 3k+1
n = k + 1 ds fy;s lR; gS
vr% xf.krh; vkxeu fl}kUr ls 2n< 3n lHkh n N ds fy;s
1 1 1 1 1
10. Prove that fl) dhft, fd 2 3 +......+ n = 1 n , n N.
2 2 2 2 2
Sol. (i) Given statement is true for n = 1
(ii) Let us assume that the statement is true for n = k
1 1 1 1 1
i.e. +......+ k = 1 k
2 22 23 2 2
(iii) For n = k + 1,
1 1 1 1 1 1 1 1
L.H.S. = 2 3 +......+ k + k 1 = 1 k + k 1 = 1 k 1 = R.H.S.
2 2 2 2 2 2 2 2
so by principle of mathematical induction the statement is true for all n N
Hindi. (i) fn;k x;k dFku lR; gS n = 1 ds fy,
(ii) ekuk fn;k x;k dFku lR; gS n = k ds fy,
1 1 1 1 1
i.e. 2 3 +......+ k = 1 k
2 2 2 2 2
(iii) n = k + 1 ds fy,
1 1 1 1 1 1 1 1
L.H.S. = 2 3 +......+ k + k 1 = 1 k + k 1 = 1 k 1 = R.H.S.
2 2 2 2 2 2 2 2
vr% xf.krh; vkxeu ds fl}kUr ls fn;k x;k dFku lR; gS lHkh n N ds fy,
Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : contact@resonance.ac.in
PAGE NO.-4
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029