Documentos de Académico
Documentos de Profesional
Documentos de Cultura
1 a 2 a 3 d 4 c 5 c 6 b 7 d 8 b 9 c 10 b
11 c 12 c 13 b 14 b 15 d 16 d 17 c 18 b 19 a 20 c
21 c 22 d 23 b 24 a 25 b 26 d 27 d 28 a 29 c 30 b
31 d 32 d 33 c 34 c 35 c 36 b 37 a 38 b 39 c 40 d
41 b 42 b 43 a 44 d 45 d 46 b 47 c 48 c 49 b 50 b
51 d 52 a 53 c 54 a 55 b 56 b 57 b 58 b 59 c 60 d
61 b 62 c 63 a 64 c 65 d 66 d 67 b 68 a 69 d 70 a
71 d 72 a 73 b 74 a 75 c 76 d 77 d 78 d 79 c 80 c
81 b 82 a 83 c 84 d 85 d 86 c 87 d 88 c 89 b
1 1 1 1 4 5
+ + + ... + 83a + 76 × a + 85 × a 978
11. c 3 3
1.3 3.5 5.7 19.21 = = = 81.5
4 5 12
1 1 1 1 1 1 1 1 1 1 1 a + a + a
= 1– + – + – + ... – 3 3
2 3 23 5 25 7 2 19 21
1 1 (21 – 1) 20 10 19. a Let the cost of 1 burger, 1 shake and 1 fries be x, y
= – = = =
2 42 42 42 21 and z.
Then
12. c The vehicle travels 19.5 km/L at the rate of 50 km/hr. 3x + 7y + z = 120 ... (i)
4x + 10y + z = 164.5 ... (ii)
19.5 x + 3y = 44.5 ... (iii) (ii – i)
So it should travel km/L at the rate of 70 km/hr
1.3 Multiplying (iii) by 4 and subtracting (ii) from it, we find
= 15 km/L. 2y – z = 13.5 ...(iv)
The distance covered at 70 km/hr with 10 L = 10 × 15 Subtracting (iv) from (iii), we get x + y + z = 31.
= 150 km
20. c Let the 6th and the 7th terms be x and y.
13. b Use choices. The answer is (b), because –x < –2 and Then 8th term = x + y
–2 < 2y ⇒ –x < 2y. Also y2 – x2 = 517
⇒ (y + x)(y – x) = 517 = 47 × 11
So y + x = 47
14. b Use the choices. If b = 1, then the factors are (x – a)
y – x = 11
(x2 + 1). This cannot yield 3 real roots.
Taking y = 29 and x = 18, we have 8th term = 47,
9th term = 47 + 29 = 76 and 10th term = 76 + 47 = 123.
Alternate method:
r1 r2 r r n r r
+ ≥ 1 + 2 × 2 max 0, 2 − 1 . Since constant = 6[3 × 2] and coefficient of
n1 n1 n1 n1 r2 n 2 n 1 x = [–4x – 3x] = –7
Now from MBA1 and MBA2, we get Since quadratic equation is
x2 – (Sum of roots)x + Product of roots = 0 or
r1 r2 n2 r r r1 r2 x2 – 7x + 6 = 0
+ × max 0, 2 − 1 ≥ + . Solving the equation (x – 6)(x – 1) = 0 or x = (6, 1).
n1 n1 r2 n2 n1 n1 + n2 n1 + n2
1+ x 1+ y
22. d From the above information, BA ≥ MBA1 ≥ MBA 2 25. b f(x) + f(y) = log 1– x + log 1– y
None of these is the right answer.
(1 + x) (1 + y)
= log
23. b BA = 50 where there is no incomplete innings means (1– x)(1– y)
r1
r2 = n2 = 0 ⇒ = 50 1 + x + y + xy
n1 = log
1 + xy – x – y
r1 n2 r r
MBA1 = + max 0, 2 – 1 1 + xy + x + y
n1 n1 n2 n1 = log
1 + xy – (x + y)
1 45
= 50 + max 0, − 50 x + y
n1 1 1+
= log 1 + xy
= 50 + 0 = 50 x + y
1–
r1 + r2 50n1 + 45 45 1 + xy
BA = = = 50 + > 50
n1 n1 n1
x+y
r1 + r2 50n1 + 45 5 = f
MBA 2 = = = 50 – 1 + xy
n1 + n2 n1 + 1 n +1
Hence, BA will increase, MBA2 will decrease.
35. c 2x – x – 1 = 0
S = 2 + 5x + 9x 2 + 14x 3 + ....
⇒ 2x – 1 = x
xS = 2x + 5x 2 + ..... If we put x = 0, then this is satisfied and if we put
S(1 – x) = 2 + 3x + 4x 2 + 5x 3 + .... x = 1, then also this is satisfied.
Now we put x = 2, then this is not valid.
Let S1 = S(1– x) ⇒ S1 = 2 + 3x + 4x 2 + ...
36. b For the curves to intersect, log10 x = x–1
xS1 = 2x + 3x 2 + ... 1
Thus, log10 x = or x x = 10
2 x
S1(1 – x) = 2 + x + x + ....
This is possible for only one value of x (2 < x < 3).
x
S1(1 − x) = 2 +
1− x
37. a It is given that p + q + r ≠ 0 , if we consider the first
x ⇒S= 2–x option, and multiply the first equation by 5, second by
S(1 − x ) = 2 +
2
43. a Both the series are infinitely diminishing series. 47. c Assume the number of horizontal layers in the pile be
1 1 n.
For the first series: First term = and r =
a2 a2 n(n + 1)
So ∑ = 8436
2
1 1
For the second series: First term = and r = 1
a a2 ⇒ [ ∑ n2 + ∑ n] = 8436
2
1
n(n + 1) (2n + 1) n(n + 1)
a2 = 1 ⇒ + = 8436
The sum of the first series = 12 4
1−
1 a2 − 1
a 2 2n + 4
⇒ n(n + 1) = 8436
12
1
n(n + 1)(n + 2)
a a ⇒ = 8436
The sum of the second series = = 6
1 2
1− a −1
a2 ⇒ n(n + 1) (n + 2) = 36 × 37 × 38
So n = 36
Now, from the first statement, the relation can be
anything (depending on whether a is positive or
negative).
But the second statement tells us, 4a2 – 4a + 1 = 0 or
50. b GRRRRR, RGRRRR, RRGRRR, RRRGRR, RRRRGR, Therefore, total number of lines required for internal
RRRRRG connections in each zone = 9 × 4 = 36 lines.
GGRRRR, RGGRRR, RRGGRR, RRRGGR, RRRRGG Now consider the connection between any two
GGGRRR, RGGGRR, RRGGGR, RRRGGG zones.
GGGGRR, RGGGGR, RRGGGG
GGGGGR, RGGGGG
GGGGGG
Hence 21 ways.
x x y y z z
= + + + + +
y z x z x y
∴ 102 = x or 10 −2 = x
2
Therefore, the minimum value of y is 2 3 .
1
∴ x = 100 or x =
100 4 9 16 25
62. c Let S = 1 + + + + … (i)
7 7 2 73 7 4
1
58. b log3 M + 3log3 N = 1 + log0.008 5 1 1 4 9 16
3 ∴ S= + + + … (ii)
7 7 7 2 73 7 4
1
log3 (M1/ 3N) = 1 +
(log10 – log2 ) (i) – (ii) gives,
3 log8 – log1000
1 3 5 7 9
S 1 − = 1 + + + + … (iii)
1
log3 (M1/ 3N) = 1–
(1 – log2 ) 7 7 7 2 73 7 4
3 3 (1 – log2 )
1 1 1 3 5 7
× S 1 − = + 2 + 3 + 4 … (iv)
1 1 2
⇒ log3 (M1/ 3N) = 1– =
7 7 7 7 7 7
3 3 3 (iii) – (iv) gives,
or M1/3N = 32/3
or MN9 = 32 1 1 1 2 2 2 2
S 1 − − S 1 − = 1 + + + + L
or N9 = 9/M 7 7 7 7 72 73 74
59. c 5x + 19y = 64 1 1 2 1 1
∴ S 1 − 1 − = 1 + 1 + + 2 + L ∞
We see that if y =1, we get an integer solution for 7 7 7 7 7
x = 9, now if y changes (increases or decreases) by
5x will change (decrease or increase) by 19. 2
1 2 1
Looking at the options, if x = 256, we get y = 64. ∴ S 1 − = 1 + ×
7 7 1
Using these values we see options (a), (b) and (d) 1−
are eliminated and also that these exists a solution for 7
250 < x ≤ 300. 2
6 2 7
∴S = 1+ ×
7 7 6
m2 m3
60. d Sum of log m + log + log + L n terms such
n n2 36 1
∴S × = 1+
49 3
problem must be solved by taking the value of number
of terms. Let’s say 2 and check the given option. If we 49 4
∴S = ×
look at the sum of 2 terms of the given series it comes 36 3
m2 m × m2 m3 S=
49
out to be log m + log ⇒ log = log 27
n n n
Now look at the option and put number of terms as 2,
only option (d) validates the above mentioned answer.
∴ α 3 + 3α 2 + 4α + 5 = 0 68. a g2 = g ∗ g = h
α3 + 2α3 + 7α + 3 = 0 g3 = g2 ∗ g = h ∗ g = f
α 2 − 3α + 2 = 0 g4 = g3 ∗ g = f ∗ g = e
α = 2, α = 1 ∴n=4
But the above values of α do not satisfy any of the
equations. Thus, no root is common. 69. d f ⊕ [f ∗ {f ⊕ (f ∗ f )}]
1 1 = f ⊕ [f ∗ {f ⊕ h}]]
64. c 1− < x≤3+
n n = f ⊕ [f ∗ e}]
Put n = 1 = f ⊕ [f ]]
∴0<x≤4 =h
65. d 36 ≤ n ≤ 72 70. a e8 = e2 ∗ e2 ∗ e2
n2 + 2 n(n + 4) + 16 = e∗e∗e
x= =e
n+4 n +4
Put x = 36.
If we observe a ∗ anything = a
∴ a10 = a
(36)2 + 2 × 6 × 40 + 16
∴x= ∴ {a10 ∗ (f 10 ⊕ g9 )} ⊕e8
36 + 24 + 4
Which is least value of ‘n’ = 28 = a⊕e
=e
66. d 13x + 1 < 2z and z + 3 = 5y 2 71. d It will go by elimination.
9 – 7 = 2 is even, therefore option (a) not possible.
13x + 1 < 2 (5y 2 − 3) 2 × 9 = 18 is even, therefore option (b) not possible.
11 19
X=1 ⇒
2
[2a + (11 − 1)d] = 2 [2a + (19 – 1)d]
22 a + 110d = 28 a + 342 d
y 16 a + 232 d = 0
–2 0 2 2a + 29 d = 0
30
67. b x = –|a| b ⇒
2
[2a + (30 – 1)d] = 0
Now a – xb = a – (– |a| b) b
= a + |a| b2 ⇒ S30terms = 0
∴ a – xb = a + ab2 … a ≥ 0 OR a – xb 73. b We have
= a – ab2 …a < 0
= a(1 + b2) = a(1 – b2) f(0) = 03 – 4(0) + p = p
Consider first case:
As a ≥ 0 and |b| ≥ 1, therefore (1 + b2) is positive. f(1) = 13 – 4(1) + p = p – 3
∴ a (1 + b2) ≥ 0 If P and P – 3 are of opp. signs then p(p – 3) < 0
∴ a – xb ≥ 0 Hence 0 < p < 3.
Consider second case.
As a < 0 and |b| ≥ 1, therefore (1 – b2) ≤ 0
∴ a (1 – b2) ≥ 0 (Since –ve × -ve = +ve and 1 – b2 can
be zero also), i.e. a – xb ≥ 0
Therefore, in both cases a – xb ≥ 0.
–6 ± 36 + 24 8
⇒y= = y 2 − 6y + 12 ⇒ y3 − 6y 2 + 12y − 8 = 0
4 y
–6 ± 60 –3 ± 15 ⇒ (y − 2)3 = 0 ⇒ y = 2
= =
4 2
⇒ x = 4, u = 4
Since 'y' is a +ve number, therefore:
15 –3
y= ans.
2