P. 1
Cat Problems_Answers and Explanation

# Cat Problems_Answers and Explanation

|Views: 762|Likes:
Published by dhruvbhardwaj

### More info:

Published by: dhruvbhardwaj on Sep 19, 2008
Copyright:Attribution Non-commercial

### Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/09/2014

pdf

text

original

# QA / CAT / Number System Page 9

Answers and Explanations
1. a (ab)
2
= ccb, the greatest possible value of ‘ab’ to be
31. Since 31
2
= 961 and since ccb > 300, 300 < ccb <
961, so 18 < ab < 31. So the possible value of ab
which statisfies (ab)
2
= ccb is 21. So 21
2
= 441,
∴a = 2, b = 1, c = 4.
2. b Note: 342 = 7
3
– 1. On further simplification we get,
( )
28
3 28 28
342 1 (7 ) 343
342 342 342
+

=
342 N 1 1
342 342
+

Hence, remainder = 1, optiion (b).
3. a Use the method of simulation, viz. take any sample
values of x and verify that n is both odd as well as a
perfect square.
4. b If there are n numbers, the function h has to be
performed one time less.
5. c The square root is 11111111.
6. d None of the statements are true.
7. a S1 remains the same, but S2 changes.
8. d x must be equal to the greatest difference in the value
of numbers of S1 and S2.
9. b 99 × D = a
1
a
2
. Hence,
1 2
a a
D=
99
. So D must be multiplied
by 198 as 198 is a multiple of 99.
10. b Use any 7 consecuti ve numbers to check the
answers.
( ) 1 2 3 4 5
n 3
5
+ + + +

, average of 7 integers is
( ) 1 2 3 4 5 6 7
k 4
7
+ + + + + +
.
So k = n + 1.
Alternately, the average of the first 5 terms is the
middle term which is third term, and the average of the
first 7 terms is the middle term which is the fourth
term. Hence, it is one more than the previous average.
11. d Numbers which are divisible by 3 (between 100 and
200) are 33. Numbers which are divisible by 21, i.e.
LCM of 7 and 3 (between 100 and 200) are 5. Out of
the 33 numbers divisible by 3, 17 are even and 16 are
odd. Out of the 5 numbers divisible by 7, three are
odd. Hence, the number of odd numbers divisible by 3
but not by 7 is (16 – 3) = 13.
12. d Take any three odd and positive numbers and check
this out.
13. a There is only one 5 and one 2 in the set of prime
numbers. Hence, there would be only one zero at the
end of the resultant product.
14. c If the sides of the triangle are a, b and c, then
a + b > c. Given a + b + c = 14.
Then the sides can be (4, 4, 6), (5, 5, 4), (6, 5, 3)
and (6, 6, 2). Hence, four triangles are possible.
15. c N = 1421 × 1423 × 1425. When divided by 12, it shall
look like
( ) ( ) ( ) 1416 5 1416 7 1416 9
.
12
] + × + × +
]
Now the remainder will be governed by the term
5 × 7 × 9, which when divided by 12 leaves the
remainder 3.
16. d Let r be the remainder. Then 34041 – r and 32506 – r
are perfectly divisible by n. Hence, their difference
should also be divisible by the same.
(34041 – r) – (32506 – r) = 1535, which is divisible by
only 307.
17. a Each term has to be either 1 or –1.
Hence, if the sum of n such terms is 0, then n is even.
18. c There are two possible cases. The number 9 comes
at the end, or it comes at position 4, 5, or 6.
For the first case, the number would look like:
9
635 ... ... 9.
674
In both these cases, the blanks can be occupied by
1 a 2 b 3 a 4 b 5 c 6 d 7 a 8 d 9 b 10 b
11 d 12 d 13 a 14 c 15 c 16 d 17 a 18 c 19 d 20 c
21 a 22 a 23 d 24 c 25 a 26 c 27 c 28 a 29 d 30 b
31 c 32 c 33 b 34 d 35 d 36 a 37 b 38 d 39 d 40 d
41 d 42 c 43 c 44 d 45 a 46 c 47 c 48 b 49 b 50 a
51 c 52 b 53 c 54 d 55 d 56 a 57 d 58 a 59 a 60 d
61 c 62 d 63 a 64 d 65 b 66 a 67 d 68 a
QA / CAT / Number System Page 10
any of the available 9 digits (0, 1, 2, ..., 8).
Thus, total possible numbers would be
2 × (9 × 9 × 9) = 1458. For the second case, the
number 9 can occupy any of the given position 4, 5, or
6, and there shall be an odd number at position 7.
Thus, the total number of ways shall be
2[3(9 × 9 × 4)] = 1944. Hence, answer is 3402.
19. d N can be written either (54 + 1)
3
+ (18 – 1)
3
– 72
3
or

(51+ 4 )
3
+ 17
3
– (68 + 4)
3
.
The first form is divisible by 3, and the second by 17.
20. c
12 1982
12 165 2
12 13 9
1 – 1

The answer is 1192.
21. a Use the answer choices and the fact that:
Odd × Odd = Odd
Odd × Even = Even
Even × Even = Even
22. a Let the four-digit number be abcd.
a + b = c + d ... (i)
b + d = 2(a + c) ... (ii)
a + d = c ... (iii)
From (i) and (iii), b = 2d
From (i) and (ii), 3b = 4c + d
⇒ 3(2d) = 4c + d
⇒ 5d = 4c
⇒ d
4
5
c
Now d can be 4 or 8.
But if d = 8, then c = 10 not possible.
So d = 4 which gives c = 5.
23. d Let the number be x.
Increase in product = 53x – 35x = 18x
⇒ 18x = 540 ⇒ x = 30
Hence new product = 53 × 30 = 1590.
24. c The value of y would be negative and the value of x
would be positive from the inequalities given in the
question.
Therefore, from (a), y becomes positive. The value of
xy
2
would be positive and will not be the minimum.
From (b) and (c), x
2
y and 5xy would give negative
values but we do not know which would be the
minimum.
On comparing (a) and (c), we find that
x
2
< 5x in 2 < x < 3.
2
x y 5xy ∴ > [Since y is negative.]
∴ 5xy would give the minimum value.
25. a The product of 44 and 11 is 484.
If base is x, then 3411
= 484 x 4 x 1 x 4 x 3
0 1 2 3
× + + +
480 x x 4 x 3
2 3
+ + ⇒
This equation is satisfied only when x = 5.
So base is 5.
In decimal system, the number 3111 can be written
406 5 1 5 1 5 1 5 3
0 1 2 3
× + × + × + ×
26. c Let the total number of pages in the book be n.
Let page number x be repeated. Then

+
n
1 i
1000 x i
1000 x
2
) 1 n ( n
+
+
Thus, 1000
2
) 1 n ( n

+
gives n = 44
Since 990
2
) 1 n ( n

+
(for n = 44).
Hence x = 10.
27. c Take a = b = c = d = 1.
28. a Let the highest number be n and x be the number
erased.
Then
n(n 1)
– x
7 602
2
35
(n – 1) 17 17
+

.
Hence, n = 69 and x = 7 satisfy the above conditions.
29. d a = b
2
– b, b ≥ 4
a
2
– 2a = (b
2
– b)
2
– 2(b
2
– b)
= (b
2
– b)(b
2
– b – 2)
Using different values to b ≥ 4 and we find that it is
divisible by 15, 20, 24.
Hence all of these is the right answer.
30. b From II, b = 2d
Hence, b = 10, d = 5 or b = 4, d = 2
From III, e + a = 10 or e + a = 4
From I, a + c = e or e – a = c
From III and I, we get 2e = 10 + c or 2e = 4 + c

c
e 5
2
+ ... (i)
or
c
e 2
2
+ ... (ii)
From (i), we can take c = 2, 4, 6, 10.
For c = 2, e = 6
c = 4, e = 7 (Not possible)
c = 6, c = 8 (Not possible)
c = 10, e = 10 (Not possible since both c and e cannot
be 10)
QA / CAT / Number System Page 11
From (ii), we have c = 2, 4, 6, 10.
For c = 2, e = 3 (Not possible)
c = 4, e = 4 (Not possible)
c = 6, e = 5 (Possible)
c = 10, e = 7 (Not possible)
Considering the possibility from B that c = 6 and
e = 5 means e + a = 4
⇒ a = –1 (Not possible)
Hence, only possibility is b = 10, d = 5, c = 2, e = 6.
e + a = 10 ⇒ a = 4
31. c The last two digits can be 12, 16, 24, 32, 36, 52, 56,
and 64, i.e. 8 possibilites
Remaining digits can be chosen in 24 P
3
4
ways.
Hence, total number of such five-digit numbers
= 24 × 8 = 192.
32. c Total possible arrangements = 10 × 9 × 8
Now 3 numbers can be arranged among themselves
in 3! ways = 6 ways
Given condition is satisfied by only 1 out of 6 ways.
Hence, the required number of arrangements
=
10 9 8
6
× ×
= 120
33. b Check choices
Choice (b) 54 ⇒ S = (5 + 4)
2
= 81
⇒ D – S = 81 – 54 = 27. Hence, the number = 54
34. d Let the number of gold coins = x + y
48(x – y) = X
2
– Y
2
48(x – y) = (x – y)(x + y) ⇒ x + y = 48
Hence the correct choice would be none of these.
35. d
2
n n
575 – x
2
+

2
1150 n n – 2x +
n(n 1) 1150 + ≥
2
n n 1150 + ≥
The smallest value for it is n = 34.
For n = 34
40 = 2x ⇒ x = 20
36. a
( )
64
4 64 64
2 (17 – 1) 17n ( 1) + − = 17n + 1
Hence, remainder = 1
37. b Because each word is lit for a second,
5 17 41 7 21 49
LCM 1, 1, 1 LCM , ,
2 4 8 2 4 8
| ` | `
+ + +
' J ' J
( J ( J
LCM(7, 21, 49) 49 3
73.5 s
HCF ( 2, 4, 8) 2
×

38. d
9 27 36 HCF(9, 27, 36)
HCF , ,
2 4 5 LCM (2, 4, 5)
| `

' J
( J
9
20

lb
= Weight of each piece
Total weight = 18.45 lb
Maximum number of guests =
18.45 20
41
9
×

39. d 3(4(7x + 4) + 1) + 2 = 84x + 53
Therefore, remainder is 53.
40. d
m m m
u v w +
2 2 2
u v w +
Taking Pythagorean triplet 3, 4 and 5, we see
m < min (u, v, w)
Also 1' + 2' = 3' and hence m ≤ min (u, v, w)
41. d
6n 6n
7 – 6
Put n = 1
6 6 3 3 3 3
7 – 6 (7 – 6 )(7 6 ) +
This is a multiple of
3 3
7 – 6 127 and 7
3
+ 6
3
= 559
and 7 + 6 = 13
42. c Number of ways for single digit = 2
2 digits = 2 × 3 = 6
3 digits = 2 × 3 × 3 = 18
4 digits = 2 × 3 × 3 × 3 = 54
5 digits = 2 × 3 × 3 × 3 × 3 = 162
6 digits = 2 × 3 × 3 × 3 × 3 × 3 = 486
Total = 728
43. c There are 101 integers in all, of which 51 are even.
From 100 to 200, there are 14 multiples of 7, of which
7 are even.
There are 11 multiples of 9, of which 6 are even.
But there is one integer (i.e. 126) that is a multiple of
both 7 and 9 and also even.
Hence the answer is (51 – 7 – 6 + 1) = 39
44. d Since the last digit in base 2, 3 and 5 is 1, the number
should be such that on dividing by either 2, 3 or 5 we
should get a remainder 1. The smallest such number is
31. The next set of numbers are 61, 91.
Among these only 31 and 91 are a part of the answer
choices.
Among these,
10 2 3 5
(31) (11111) (1011) (111)
Thus, all three forms have leading digit 1.
Hence the answer is 91.
45. a Solution cannot be found by using only Statement A
since b can take any even number 2, 4, 6….
But we can arrive at solution by using statement B
alone.
If b > 16, say b = 17
Hence 2
44
< (16 + 1)
11
2
44
< (2
4
+ 1)
11
QA / CAT / Number System Page 12
46. c If y = 2 (it cannot be 0 or 1), then x can take 1 value
and z can take 2 values.
Thus with y = 2, a total of 1 × 2 = 2 numbers can be
formed. With y = 3, 2 × 3 = 6 numbers can be formed.
Similarly checking for all values of y from 2 to 9 and
adding up we get the answer as 240.
47. c The best way to do this is to take some value and
verify.
E.g. 2,
1
2
and 1. Thus, n = 3 and the sum of the three
numbers = 3.5.
Thus options 1, 2 and 4 get eliminated.
Alternative method:
Let the n positive numbers be a
1
, a
2
, a
3
… a
n
a
1
, a
2
, a
3
… a
n
= 1
We know that AM ≥ GM
Hence
1/ n
1 2 3 n 1 2 n
1
(a a a a ) (a a a )
n
+ + +…+ ≥ …
or (a
1
+ a
2
+ a
3
+ … a
n
)

n
48. b From 12 to 40, there are 7 prime number, i.e. 13, 17,
19, 23, 29, 31, 37, which is not divisible by (n–1)!
49. b MDCCLXXXVII = 1000 + 500 + 100 + 100 + 50 + 10 + 10
+ 10 + 5 + 1 + 1 = 1787
50. a MCMXCIX = 1000 + (1000 – 100) + (100 – 10) + (10 –
1) = 1000 + 900 + 90 + 9 = 1999
51. c (I) MCMLXXV = 1000 + (1000 – 100) + 50 + 10 + 10
+ 5 = 1975
(II) MCMXCV = 1000 + (1000 – 100) + (100 – 10) + 5
= 1995
(III) MVD = 1000 + (500 – 5) = 1495
(IV) MVM = 1000 + (1000 – 5) = 1995
Therefore, the answer is (II) and (IV), i.e. option (c).
52. b Such numbers are 10, 17, …, 94.
These numbers are in AP. There are 13 numbers.
10 94
Sum 13
2
+
∴ ×
= 52 × 13 = 676
53. c Total codes which can be formed = 9 × 9 = 81.
(Distinct digit codes)
The digits which can confuse are 1, 6, 8, 9, from
these digit we can form the codes = 4 × 3 = 12
Out of these 12 codes two numbers 69 and 96 will not
create confusion.
Therefore, (12 – 2) = 10 codes will create a confusion.
Therefore, total codes without confusion
= 81 – 10 = 71.
54. d Remainder when
96
4
6
Let’s come down to basic property of dividing the
power of 4 by 6, i.e.
1
4
4
6

2
4
4
6

3
4
4
6

4
4
4
6

Hence, any power of 4 when divided by 6 leaves a
remainder of 4.
55. d Let n = 6
Therefore, n 6 2.4 ≈
Therefore, divisors of 6 are 1, 2, 3.
If we take 2 as divisor, then
n 2 1 > >
.
Statement A is true.
If we take 3 as divisor, then 6 > 3 > 2.4, i.e. n > 3 >
n
.
Therefore, statement B is true.
56. a As any prime number greater than 3 can be expressed
in the form 6n 1 ± , minimum difference between three
consecutive prime numbers will be 2 and 4. The values
that satisfy the given conditions are only 3, 5 and 7,
i.e. only one set is possible.
57. d a = 6b = 12c and 2b = 9d = 12e.
Dividing the first equations by 12 and second by 36,
we get
a b c
12 2 1

and
b d e
18 4 3

i.e.
a b c
108 18 9

and
b d e
18 4 3

a b c d e
108 18 9 4 3

∴ a : b : c : d : e = 108 : 18 : 9 : 4 : 3.

c 9
d 4

is not an integer.
58. a There will be an increase of 6 times.
No. of members s
1
will be in A.P.
On July 2nd , 2004, s
1
will have n + 6 b members
= n + 6 × 10.5 n
= 64n
No. of members in s
2
will be in G.P
On July 2nd, 2004 Number of members in s
2
= nr
6
They are equal, Hence 64 n = nr
6

6
64 r r 2 ⇒ ⇒
59. a We have
(1) 10
10
< n < 10
11
(2) Sum of the digits for 'n' = 2
QA / CAT / Number System Page 13
Clearly-
(n)min = 10000000001 (1 followed by 9 zeros and
finally 1)
Obviously, we can form 10 such numbers by shifting
'1' by one place from right to left again and again.
Again, there is another possibility for 'n'
n = 20000000000
So finally : No. of different values for n = 10 + 1 = 11
ans.
60. d
1
y
1
2
3 y

+
+
3 y
y
7 2y
+

+

2
2y 6y – 3 0 ⇒ +

–6 36 24
y
4
± +

–6 60 –3 15
4 2
± ±

Since 'y' is a +ve number, therefore:
15 –3
y
2
ans.
61. c
23 23 23
15 (19 – 4) 19x (–4) +
where x is a natural
number.
23 23 23
23 (19 4) 19y (4) + +
where y is a natural
number.
( )
23 23 23 23
15 23 19 x y 4 (–4) + + + +
= 19 ( x +y)
62. d
65 65
64 64
30 – 29
1
30 29
>
+
as 30
65
– 29
65
> 30
64
+ 29
64
30
64
(30 – 1) > 29
64
(29 + 1)
30
64
× 29 > 29
64
× 30
30
63
> 29
63
Hence option d.
63. a x = 16
3
+ 17
3
+ 18
3
+ 19
3
is even number
Therefore 2 divides x.
a
3
+ b
3
= (a + b) (a
2
– ab – b
2
)
⇒ a + b always divides
Therefore 16
3
+ 19
3
is divisible by 35
18
3
+ 17
3
is divisible by 35
Hence x is divisible by 70.
Hence option a.
64. d If p = 1! = 1
Then p + 2 = 3 when divided by 2! remainder will be
1.
If p = 1! + 2 × 2! = 5
Then p + 2 = 7 when divided by 3! remainder is still
1.
Hence p = 1! + (2 × 2!) + (3 × 3!) + … + (10 × 10!)
when divided by 11! leaves remainder 1
Alternative method:
P = 1 + 2.2! + 3.3!+ ….10.10!
= (2 –1)1! + ( 3 – 1)2! + (4 – 1)3! + ….(11 – 1)10!
=2! – 1! + 3! – 2! + ….. 11! –10!
= 1 + 11!
Hence the remainder is 1.
65. b Let A = 100 x + 10y + z
⇒ B = 100z + 10y + x
B - A = 99(z - x)
For B - A to be divided by 7, z - x has to be divisible
by 7. Only possibility is z = 9, x = 2.
Biggest number A can be 299
Option b.
66. a ( )
( )
680
4
30
Hence the right most non-zero digit is 1.
67. d 10 < n < 1000
Let n is two digit number.
n = 10a + b ⇒ p
n
= ab, s
n
= a + b
Then ab + a + b = 10a + b
⇒ ab = 9a ⇒ b = 9
There are 9 such numbers 19, 29, 33, … 99
Then Let n is three digit number
⇒ n = 100a + 10b + c ⇒ p
n
= abc, s
n
= a + b + c
then abc + a + b + c = 100a + 10b + c
⇒ abc = 99a + 9b
⇒ bc = 99 +
b
9
a
But the maximum value for bc = 81
And RHS is more than 99. Hence no such number is
possible.
Hence option d.
68. a The 100
th
and 1000
th
position value will be only 1 .
Now the possibility of unit and tens digits are
(1, 3), (1, 9), (3, 1), (3, 7), (5, 5), (7, 3), (7, 9), (9, 1),
(9, 7).

scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->