Scribd
Upload
76 views5 pages

Eb W24 DPP62

The document is a mathematics practice problem paper that contains: - An introduction and information about the course. - 10 multiple choice and subjective questions on principles of mathematics with answers. - The questions cover topics like logical reasoning, mathematical induction, divisibility, and algebraic expressions. - Students are given 45 minutes to complete the practice paper.

Uploaded by

Sarvesh Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views5 pages

Eb W24 DPP62

The document is a mathematics practice problem paper that contains: - An introduction and information about the course. - 10 multiple choice and subjective questions on principles of mathematics with answers. - The questions cover topics like logical reasoning, mathematical induction, divisibility, and algebraic expressions. - Students are given 45 minutes to complete the practice paper.

Uploaded by

Sarvesh Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

MATHEMATICS

DPP

TARGET : JEE (Main) 2017

DAILY PRACTICE PROBLEMS

EST INF ORM AT IO

Course : AADHAAR (EB)

NO. 62

ANSWERKEY

DPP No. : 62
1.

(4)

2.

(2)

3.

(1, 2, 3)

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

DPP No. : 62
Special DPP's on "Principle of Mathematics Inducation"
Total Marks : 39
Single choice Objective ('1' negative marking) Q.1 to Q.2
Multiple choice objective ('1' negative marking) Q.3
Subjective Questions ('1' negative marking) Q.4 to Q.10
1.

Sol.

Hindi

2.

If p(n) : n2 > 100 then


(1) p(1) is true
(3) p(k) is true k 5, k N
;fn p(n) : n2 > 100 rks
(1) p(1) lR; gS
(3) p(k) lR; gS k 5, k N
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(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

Max. Time : 45 min.


(3 marks 3 min.)
[6, 6]
(5 marks, 4 min.)
[5, 4]
(4 marks 5 min.)
[28, 35]

(2) p(4) is true


(4*) p(k + 1) is true whenever p(k) is true where k N
(2) p(4) lR; gS
(4*) p(k + 1) lR; gS tcfd p(k) lR; gS] tgk k N

P(k + 1) is true

P(k + 1) lR; gS

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.
(1) Statement-1 is False, Statement-2 is True.
(2*) Statement-1 is True, Statement-2 is True; Statement-2 is a correct explanation for Statement-1.
(3) Statement-1 is True, Statement-2 is True; Statement-2 is NOT a correct explanation for Statement-1
(4) Statement-1 is True, Statement-2 is False
Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029

PAGE NO.-1

dFku 1 izR;sd izkd`r la[;k n 2 ds fy;s]


1
1

......

>

n.

dFku 2 izR;sd izkd`r la[;k n 2 ds fy;s]


n(n 1) < n + 1.

Sol.

(1) dFku&1 vlR; gS] dFku&2 lR; gSA


(2*) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k gSA
(3) dFku&1 lR; gS] dFku&2 lR; gS ; dFku&2, dFku&1 dk lgh Li"Vhdj.k ugha gSA
(4) dFku&1 lR; gS] dFku&2 vlR; gSA
For n 2 ds fy;s
n2 + n < n2 + n + n + 1
n2 + n < (n + 1)2
statement -2 is true
1
1

>

1
n

1
2

>

dFku -2 lR; gSA


1
n

.... .

1
n

1
n

1
1

1
2

n n 1
+......

1
n

1
n

>

1
n1

n
n

3*.

By principle of mathematical induction, 32n+2 8n9 is divisible for every natural number n by
(1*) 16
(2*) 8
(3*) 64
(4) 9
2n+2
xf.krh; vkxeu ds fl)kar ls R;sd kd`r la[;k n ds fy,] 3 8n9 fuEu esa ls fdlls foHkkftr gS&
(1*) 16 ls
(2*) 8 ls
(3*) 64 ls
(4) 9 ls
Sol.
Let n = 1 then p(1) = 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(1) = 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; gSA
4.
Sol.

Prove that fl) dhft, fd


2n > n, n N.
(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,
5.

Use the principle of mathematical induction to prove that n(n + 1)(n + 2) is a multiple of 6 for all natural
numbers n.
Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029

PAGE NO.-2

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
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,
6.

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,
7.

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
8.
Sol.

1 1
1
1
1
2 3 +......+ n = 1 n , n N.
2 2
2
2
2
(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.
2 3 +......+ k = 1 k
2 2
2
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

Prove that fl) dhft, fd

Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029

PAGE NO.-3

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,
9.

If P(n) is the statement,

;fn dFku P(n),


Sol.

We have P(n) :

1
1
1
1
n

......

where n N, then write P(2), P(3).


1.2 2.3 3.4
n (n 1) n 1

1
1
1
1
n

......

tgk n N gS]
1.2 2.3 3.4
n (n 1) n 1

rks P(2), P(3) dk eku fyf[k;sA

1
1
1
1
n

......

1.2 2.3 3.4


n (n 1) n 1

1
1
2
1 1 2

i.e.,

1.2 2.3 2 1
2 6 3
1
1
1
3
1 1 1
3
P(3) is the statement :

i.e.,

=
1.2 2.3 3.4 3 1
2 6 12 4
1
1
1
1
n
Hindi. fn;k gS P(n) :

......

1.2 2.3 3.4


n (n 1) n 1

P(2) is the statement :

1.2
1
dFku P(3) gS :

1.2

dFku P(2) gS :

10.
Sol.

1
2
1 1 2

i.e.,

2 .3 2 1
2 6 3
1
1
3
1 1 1
3

i.e.,

=
2.3 3.4 3 1
2 6 12 4

By using P.M.I., prove that 2n + 7 < (n + 3)2, n N


xf.krh; vkxeu fl}kUr ls fl} dhft;s fd 2n + 7 < (n + 3)2, n N gS
The given statement is
2n + 7 < (n + 3)2, n N
...(1)
Step I. Let n = 1
L.H.S. of (1) = 2(1) + 7 = 9 R.H.S. of (1) = (1 + 3)2 = 16
Since 9 < 16, (1) is true for n = 1
Step-II Let (1) be true for n = k
2k + 7 < (k + 3)2
Let (k + 3)2 = 2k + 7 + p, p > 0
...(2)
Step III. Let n = k + 1
L.H.S. of (1) = 2(k + 1) + 7 = 2k + 9
= (k + 3)2 7 p) + 9
[using (2)]
= k2 + 6k + 9 + 2 p
= (k2 + 8k + 16) 5 2k p
(Note this step)
= (k + 4)2 5 + 2k + p) < (k + 4)2
( 5 + 2k + p > 0)
2
2
R.H.S. of (1) = (k + 1 + 3) = (k + 4)
(1) is true for n = k + 1
By P.M.I., 2n + 7 < (n + 3)2, n N

Hindi. fn;k x;k dFku gS


2n + 7 < (n + 3)2, n N
...(1)
pj.k I. ekuk n = 1
(1) dk L.H.S. = 2(1) + 7 = 9 ,
(1) dk R.H.S. = (1 + 3)2 = 16
pwafd 9 < 16, n = 1 ds fy;s (1) lR; gS
pj.k -II ekuk n = k ds fy;s (1) lR; gS
2k + 7 < (k + 3)2
ekuk (k + 3)2 = 2k + 7 + p, p > 0
...(2)
Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029

PAGE NO.-4

pj.k III. ekuk n = k + 1


(1) dk L.H.S. = 2(k + 1) + 7 = 2k + 9
= (k + 3)2 7 p) + 9
= k2 + 6k + 9 + 2 p
= (k2 + 8k + 16) 5 2k p
= (k + 4) 5 + 2k + p) < (k + 4)
2

[(2) ls]
(pj.k dks vafdr djsa)
2

( 5 + 2k + p > 0)

(1) dk R.H.S. = (k + 1 + 3) = (k + 4)
n = k + 1 ds fy;s (1) lR; gS
xf.krh; vkxeu fl}kUr ls 2n + 7 < (n + 3)2, n N
2

Corporate Office : CG Tower, A-46 & 52, IPIA, Near City Mall, Jhalawar Road, Kota (Raj.) - 324005
Website: www.resonance.ac.in | E-mail : [email protected]
Toll Free : 1800 200 2244 | 1800 258 5555 | CIN: U80302RJ2007PTC024029

PAGE NO.-5

You might also like