0% found this document useful (0 votes)
5 views3 pages

DPP 65

The document contains a mathematics assessment with a total of 24 marks, divided into comprehension, single choice objective, and single integer questions. It includes various mathematical problems related to equations, integers, and series, along with their solutions. The assessment is structured to test problem-solving skills with negative marking for incorrect answers.

Uploaded by

kinjalkumawat30
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
0% found this document useful (0 votes)
5 views3 pages

DPP 65

The document contains a mathematics assessment with a total of 24 marks, divided into comprehension, single choice objective, and single integer questions. It includes various mathematical problems related to equations, integers, and series, along with their solutions. The assessment is structured to test problem-solving skills with negative marking for incorrect answers.

Uploaded by

kinjalkumawat30
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/ 3

DPP No.

# 65 (JEE–ADVANCED)
Total Marks : 24 Max. Time : 24 min.
Comprehension ('–1' negative marking) Q.1 to Q.3 (3 marks 3 min.) [09, 09]
Single choice Objective ('-1' negative marking) Q.4 to Q.6 (3 marks 3 min.) [09, 09]
Single Integer Questions ('-1' negative marking) Q.7 to Q.8 (3 marks 3 min.) [06, 06]

Question No. 1 2 3 4 5 6 7 8 Total

Marks Obtained

Comprehension # (Q.No. 1 to 3)
Consider the equation 2|x + 1| – 2x = |2x – 1| + 1
1. The least value of x satisfying the equation is
(A) 0 (B) 2 (C) 4 (D) –2

2. Number of integers less than 15 satisfying the equation are


(A) 14 (B) 15 (C) 16 (D) 17

3. Number of composite numbers less than 20 which are coprime with 4 satisfying the given
equation is/ are
(A) 2 (B) 3 (C) 4 (D) 5

4. The remainder obtained when 1 + 2 + 3 + ... + 200 is divided by 14 is


(A) 3 (B) 4 (C) 5 (D) None of these

N
5. If 
r =1
(r2 + 2r + 1). r! = (2014)! –2, then N can be

(A) 2012 (B) 2013 (C) 2011 (D) 2014

6. The number of non-zero terms in the expansion of (1 + 3 2 x)9 + (1 – 3 2 x)9 is


(A) 9 (B) 0 (C) 5 (D) 10

1 3 1 an + 10
7. If nth term of the series 3 , 2, 1 ,1 ,...... is ,  n  N, then find the value of (a +
3 7 9 bn + c
b + c)

1 1 1
8. If 1+
1
+
1 + 1 + 1 + 1 + 1 + 1 + 1 + ....... + 1 + 2
+ 2 =x– , then find
12 2
2 22 2
3 2 2
3 4 (1999) (2000) x
the value of x

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: “75970 – 84242, 95490 – 43333 / 2222”
DPP No. # 65
1. (D) 2. (C) 3. (A) 4. (C) 5. (A) 6. (C) 7. 3
1
8. x = 2000, −
2000

Solutions
1. 2|x+1|
– 2 = |2 – 1| + 1
x x

Case-I :
x0
2x+1 – 2x = 2x holds for all x  0 .
Case-II :
–1x<0
2x+1 – 2x = 2 – 2x  2x+1 = 2
 x=0
Case-III
x<–1
2–x–1 – 2x = 2 – 2x  – x – 1 = 1  x=–2
 least value of 'x' is – 2

2. Number of integers less than 15 = 16 i.e. {–2, 0, 1, ......, 14 }

3. Composite numbers less than 20, coprime with 4 = 2 i.e. { 9, 15 }

4. For n  7, n is divisible by both 2 and 7 and hence divisible by 14


 7 + 8 + 9 ... + 200 is divisible by 14
Also 1 + 2 + 3 + 4 + 5 + 6
= 1 + 2 + 6 + 24 + 120 + 720 = 873 and 873 = 14 × 62 + 5
Hence 1 + 2 + 3 ... + 200 = a multiple of 14 + 5

5. (r2 + 2r + 1). r! = (r + 1)2 r! = (r + 1). (r + 1). r!


= (r + 1) (r + 1)! = (r + 2 – 1)(r + 1)! = (r + 2) (r + 1)! – (r + 1)! = (r + 2)! – (r + 1)!
N N
 
r =1
2
(r + 2r + 1). r! = 
r =1
[(r + 2)! – (r + 1)!]

= (3! – 2!) + (4! – 3!) + (5! – 4!) + .... + (N + 2)! – (N + 1)! = (N + 2)! – 2 = (2014)! – 2
 N = 2012

(1 + 3 ) ) + 9C2 (3 2x ) + . . . .
= 9C0 + 9C1 ( 3
9 1 2
6. 2x 2x

(1– 3 = 9C0 – 9C1 ( 3 2x ) + 9C2 – ( 3 2x ) . . . . .


2x )
9 1 2

2[9C0 + 9C2 ( 3 2x ) + 9C4 ( 3 2x ) + 9C6 ( 3 2x ) + 9C8 ( 3 )


2 4 6 8
2x ]

10 10 10 10 10 10 10 10 an + 10
7. , 2, , .............  , , , Tn = =
3 7 9 3 5 7 9 2n + 1 bn + c
a = 0, b = 2, c = 1 a+b+c=3

1 1 1
8. S = 1 + 12 + 12 + 1 + 1 + 1 + ............+ 1+ 2
+ 2 =x–
1 2
2 2
2 3 (1999) (2000) x

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: “75970 – 84242, 95490 – 43333 / 2222”
1 1 (n + 1)2 n2 (n + 1)2 + n2 n4 + 2n3 + 3n3 + 2n + 1
Tn = 1 + + = =
n2 (n + 1)2 n2 (n + 1)2 n2 + (n + 1)2

(n2 + n + 1)2
= n 2+ n + 1
2
Tn =
n2 (n + 1)2 n +n
1 1 1
Tn = 1 + = 1+ −
n(n + 1) n n +1
1999 1999
 1 
  1 + n − n + 1  = 1999 + 1− 21 + 21 − 31 ........... + 1999
1 1 1 
S= Tn = −
n=1 n =1 2000 
1 1
= 2000 − = x−
2000 x
−1
x = 2000,
2000

For Unacademy Subscription Use “PJLIVE” Code | Join t.me/pjsir42 for Updates
For More Info: “75970 – 84242, 95490 – 43333 / 2222”

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy