A Solution Booklet for PS-I

School of Management
Quantitative Aptitude

A Sample Booklet( not for sale)

Rahul Kumar Jha

Mar-Nov 2008
 Solutions set 1

1) Option b)
|A/B| = |A|/|B| and C 2 = |C|2 use these two identities we get only one
negative integral x, x = −1

2) option a)
put dravid as 2x and sachin as x. Very simple we get 5x/2=30

3)option a) There are (n-2) people other than Amrita and Satyam. Am-
rita and Satyam know (n-2) people except each other. Let us select A and
B from the (n-2)people, then their common friends are Amrita and satyam,
irrespective of who A and B are. clearly for every A then we can have 3
pairs. Now I leave it to you to prove the rest!!

4) option b)

5) option b)

6)option d)
100a + 10b + c = abc + a + b + c
⇒ 99a + 9b = abc
⇒ c = 9( 11
b
+ 1a)
but rhs is not an integer
now let 10a + b = ab + a + b ( assuming 2 digit integer)
b = 9 gives 9 cases {19, 29...99}

7)option d)
this is a bit involved but can be proved that p=6

8)option a)
clearly from symmetry it is half the square of side 4
so area is 8

9) option b) Odd no of divisors so windows which are numbered as per-

fect squares will be closed! rest will remain open so (100-10)=90

1
10) we can find n+1=7 n=6 so the number N is 142857.
11) option 2)

12) option d)
very simple

13)option d)
Let abc=t then a,b and c can be considered the roots of the eqn f (x) =
x3 − 6x2 + 9x − t = 0
f (x) is decreasing in (1,3) . Also f (0) = f (3) = −t and f (1) > f (3) clearly
now we can see option d) is right!

14) consider a,b as the roots of the equation where a,b are positive integers,
then clearly there is another equation with same sum of roots but product
of roots is ab+55.clealry if we take option a we can find (13,7) and(18,2)
so option b)

15))since f (f (k)).f (f (f (k))) > 1

f (f (k)) has to be atleast > 10 so k has to be at least a 3 digit number

16)option c) 18 simple

17)The last digit of any power of 7 is 1, 7, 9 or 3 if the power of 7 is of

the form 4k, 4k + 1, 4k + 2 or 4k + 3 respectively. So, the sum will be
divisible by 5 if the last digits in the two cases are either 1 and 9 or 7 and
3. Out of 1 to 100, there are 25 numbers of each type. Hence the number of
ways in which we can select two such m and n out of these 25 numbers is: 2
x 25 x 25 = 1250 and the total number of ways in which two numbers can
be selected is 100 x 100 = 10000.

Hence the required probability is: (2 x 25 x 25)/(100 x 100) = 1/8

18) its simple a has to be even as 2d is even. so a=2,4,6,but a can’t be

4 or 6 as that will make 2a greater than 7 and thus a 5 digit number so a=2
option b)

19) use AM > GM for the set{a/2,a/2,b/3,b/3,b/3,c} we get a + b + c >= 4

2
option 5 has a typo it should be 4

20) use AM > GM for S1 , S2 , S3 , S4 from the set {(a+b+c),(b+c+d),(c+d+a),(a,b,d)}

comes 81.5=405

21)

23) if n=2k
2kf(2k)=f(2k) +(2k-1)f(2k-1)
f(2k)=f(2k-1)

and when n=2k-1

(2k-1)f(2k-1)=-f(2k-1) +(2k-2)f(2k-2)
2kf(2k-1)=2(k-1)f(2k-2)
f(2k-1)=(k-1)f(2k-2)/k

using this we can go to f(11)=5f(10)/6=5f(9)/6=5.4f(8/(6.5)=5.4.3f(6)/(6.5.4)=5.4.3.2f(4)/(6

=f(2)/6=10

now looking at this we can make a general formula

f(2k-1)=f(2)/k
and as f(2k)=f(2k-1)=f(2)/k

24)let the speed of current be v

so when going from aksa to baksa
time should be
990/(50+v) at aksa and 990/(50+v)+t at baksa

while going back

990(50-v) at baksa and 990/(50-v)-t at aksa

now we have to be careful from here!!

990/(50+v)+t=19
and 990/(50-v)-t=21
add
990[100/(2500-v 2 )]=40
2v 2 = 5000 − 990.5
v=5

3
and t=19-990/55=1

26) clearly the quad is cyclic now its simple to prove 105 28) option d)

29) The seed of 13 is 4 which means to check the divisibility by 13 of a

n digit number, multiply the last digit by 4 and add the result to the initial
(n-1) digits and see if it is div by 13 e.g. 182 − > 18+2*4 = 26. Thus, 182
is div by 13. 1001 − > 100 +1*4 = 104 − > 10 + 4*4 = 26, hence 1001 is
div vy 13. It’s also the same thing for 182 as saying that 2 ∗ (42 ) + 8*4 + 1
is div by 13 or for 1001 1 ∗ (43 ) + 1 is div by 13 - this comes from recurrence.
Note that we can find the seed of every prime number. The seed of 7 is 5,
the seed of 17 is 12, the seed of 19 is 2.

If 444...x...444 is div by 13 => 4 ∗ (44 9 + 44 8 + ... + 1) + (x − 4) ∗ 4( n − 1) is

div by 13, where nth digit is x and not 4
.
4 ∗ (44 9 + 44 8 + ... + 1) = 4/3 ∗ (45 0 − 1). By Fermat’s theorem 41 2 =
1mod(13) => 45 0 = 3 mod (13). Thus, 4 ∗ (45 0 − 1) leaves remainder of 8
when div by 13. If 4/3∗(45 0−1) leaves x by 13 => 3xNow, 7 + (x−4)∗4( n−1)
is div by 13.
when n = 1, 7+(x-4) has to be div by 13, we have no such x
when n = 2, 7+4*(x-4) has to be div by 13, we have no such x
when n = 3, 7+3*(x-4) has to be div by 13, we have x = 6
when n = 4, 7+12*(x-4) has to be div by 13, we have no such x
when n = 5, 7+9*(x-4) has to be div by 13, x = 9
when n = 6, 7+10*(x-4) has to be div by 13, x = 2
when n = 7, 7+(x-4) has to be div by 13, we have no such x and the whole
cycle of 6 repeats from here. In each cycle of 6 we have 3 desired n
. Till n = 50 we have 48*3/6 + 0 = 24 such numbers.

Hence, choice (e) is the correct option

32) 1 such square

35) f (x) = x3 + 1 so option c)

36) lcm-hcf=57 hcf=1 gives lcm=58 if we go further we can find answer as 22

4
37) clearly x has to be 2. y=2 gives z=5 one solution . if z is any other
prime z=6k-1 or 6k+1 in either case not possible only one solution

38)[x] = −2 and {x} = 0.3 so d

40) number is klcm(2,3,5)+1=31,61,91 and furthe checking the conditions

we get number as 91 option d)

41) option 3)

42

43) we can prove f (x + y) = f (x + y) so f(4)=2f(2)=16 and f(6)=16+8=24

44)

45) put y = kx then minimize the square and get x + y ≤ 16/3

46) 53) Use the concept of similar triangles option b)

54 same as above option d)

55) In triangles ABM and ACM, < BAM = x and < CAM = 2x and <
AM B = Y using sine rule, AB = 2AC.cosx using sine rule in triangle
ABD, AD = 2AC so option d)

56) Let pt = x and solve the quadratic for real roots. gives two values
of t 1/2 and -1/2
option c)

57)

58

59) use f (N + 3) = f (N ) + f (N + 1) + F (N + 2) and f (1) = 1, f (2) =

2, f (3) = 4 ⇒ f (4) = 7, f (5) = 13, f (6) = 24 f (7) = 44, f (8) = 81, f (9) =
149, f (10) = 274 option c)

5
60) none of these. its very simple

61)√use Cauchy − Schwartz inequality (52 + 122 )(x2 + y 2 ) ≥ (5x + 12y)2

⇒ x2 + y 2 ≥ 60
13

62)x− y 2 = 315 = 3.105 = 9.35 = 45.7 = 21.15 clearly one solution op-
tion b)

63)simple option d)

64)36,4,0 or 36,0,4 is teh combination x+y+z = 6, x+y−z = 2 or x−y+z =

0 x = 1, y = 2, z = 3orx = 1, y = 3, z = 2 so two solution option e)

65) we can easily prove that the series is periodic with period 6, so Y=A
and Z=B
so Y + Z = A + B = 1988, option b

66) simple option e) n2n can never end in 4.

67) B 2 + AB + 1 divides A2 + AB + 1, So B 2 + AB + 1 divides A2 + AB +

1 − (B 2 + AB + 1) = (A + B)(A − B but gcd((B 2 + AB + 1), A2 − B 2 ) = 1
so A − B = 0 so k has only one solution k=0

68) |N | = N (mod2) open the brackets and add we get 0(m0d2) so even.
option a)

69) only 216 so one value

70)equal side lengths and equal area, only one possible option c)

71) option e) I leave it for you to figure it out !!

72) either his seat is occupied or it is not occupied so probability is 1/2

option a)

73) can be easily proven option d)

74) AM=Gm so all roots are equal we find a+b+c=40 option e ) none of

6
these

75) 192 = 361, and 19 is the 8th prime, so only 7 primes left hence, op-
tion d). For none of them to be co=prime, each of a,b,c..h should pe square
of a prime.

76) option c) can be easily proven

77)option c)

78)Let Q(x) = (x + 2)S(x) so P (x) = (2x − 1)S(x) hence R(x) = S(x)2 ((x +
2)2 + (2x − 1)2 ) = 5(x2 + 1)S(x)2 so option d)

79) easily proven for a pythagorean triplet (a,b,c) for all positive integer
k (ka,kb,kc) is pythagorean hence infinitely many such triangles option c)

80) option a) it is always divisible by 30 for all integers a,b

81)f (x, y) = lcm(x, y) so f (252, 90) = 1260 option e)

82) no of primes less than 25=2,3,5,7,11,13,17,19,23=9 so number is 29−1 =

28 = 256

83) 1/3 only option c)

84)can be easily solved ,n=6, so option d)

85) option d)

86) 28 + 211 + 2n = ((24 )2 + 2.24 .26 + (2n/2 )2 ) so n=12 option b)

87) let a = −xb = −y and c = −za + b + c = 4 and ab + bc + ca =

xy + yz + zx clealry using AM¿GM for (a, b), b(, c) and (c, a) gives max value
ata = b = c = 4/3 so max is 16/9 option a)

88)let x = y + 1 so x3 − y 3 = 1 + 3y(y + 1) clearly this is not divisible

by either 2 or 3 so m = 0 and n = 0 so m+n=0 option e)

7
89) it can be easily proved that an = n so a100 = 100 option b)

90) It can be easily proved that speed of ali is 60 and the distance be-
tween town A and B is 50 so they meet for the first time at 50/(60+40)=30
mins . after this they will meet after (50+50)/(60+40)=1 hour so X(2)=1:30
X(3)=2:30 and X(4)=3:30 option d)

π2
91) Let S = 112 + 212 + 312 + ...... = 6
and let S 0 = 112 + 312 + 512 + ......
⇒ S − S 0 = S/4 ⇒ S 0 = 3s 4
0 3π 2 π2
S = 4.6 = 8
option a)

92) let f (x) = √xx2 +1

clearly f 0 (x) < 0 for all positive x so concave function we can use jensen’s
inequality
f (a)+f (b)+f (c)
3
≤ f ( a+b+c
3
)
f (a)+f (b)+f (c) 3
3
≤2
option c)

93)option d) use sine law for one case and that hypotenuse is equal to diam-
eter of circumcircle in right triangle in other

94) option c) put logx y=t solve the quadratic y can’t be 1

95) number of solution is 15 option e)

96) abc < 4(c + c + c) < 12c ⇒ ab < 12

ab=2 gives a=1,b=2 c=2(3+c) not possible similarly we can move and find
5 sets of(a,b,c)

97)x=2y/(y-2) this will give only 5 solns for integers!!

y-2=+-2y,y-2=+-2,y-2=+-1,y-2=+-4

98)can be easily proved that 2 solutions exist!!

8
99)Multiply both equations-(a+b)(c+d)=10
ac+bd=8,c+d=2
a(c+d)=2a
ac+ad= ac+bc= c(a+b)=2a
a/c= 5/2

Hence answer is 8+5/2=10.5

100) draw the circle and find the angles easily n=7

Kindly note that all the questions on this set have been discussed well at
Pagalguy.com. if you find difficulty in understanding the solution, you may
follow the thread official quant thread for Cat 08 on pagalguy.com
http://www.pagalguy.com/forum/quantitative-questions-and-answers/27454-
official-quant-thread-for-cat08.html