CAT Number System 1998 2006
CAT Number System 1998 2006
min(u, v, w) b. m
 max(u, v, w)
c. m < min(u, v, w) d. None of these
49.
6n 6n
7  6
, where n is an integer > 0, is divisible by
a. 13 b. 127 c. 559 d. All of these
50. How  many  numbers  greater  than  0  and  less  than  a  million  can  be  formed  with  the  digits  0,  7
and 8?
a. 486 b. 1,084 c. 728 d. None of these
CAT 2003 (Leaked Paper)
51. How many even integers n, where 100 n 200     , are divisible neither by seven nor by nine?
a. 40 b. 37 c. 39 d. 38
52. A positive whole number M less than 100 is represented in base 2 notation, base 3 notation, and
base 5 notation. It is found that in all three cases the last digit is 1, while in exactly two out of the
three cases the leading digit is 1. Then M equals
a. 31 b. 63 c. 75 d. 91
Directions for question 53: Each question is followed by two statements, A and B. Answer each
question using the following instructions.
Choose (a) if the question can be answered by one of the statements alone but not by the other.
Choose (b) if the question can be answered by using either statement alone.
Choose (c) if the question can be answered by using both the statements together, but cannot be answered
by using either statement alone.
Choose (d) if the question cannot be answered even by using both the statements together.
53. Is a
44
 < b
11
, given that a = 2 and b is an integer?
A. b is even
B. b is greater than 16
54. How many three digit positive integers, with digits x, y and z in the hundred's, ten's and unit's place
respectively, exist such that x < y, z < y and 
x 0 
?
a. 245 b. 285 c. 240 d. 320
Number  System Page 7
55. If the product of n positive real numbers is unity, then their sum is necessarily
a. a multiple of n b. equal to 
1
n
n
+ c. never less than n d. a positive integer
56. The number of positive integers  n in the range 
12 n 40    
 such that the product (n 1)(n 2) 3.2.1       
is not divisible by n is
a. 5 b. 7 c. 13 d. 14
CAT 2003 (Re test)
Directions for questions 57 to 59: Answer the questions on the basis of the information given below.
The seven basic symbols in a certain numeral system and their respective values are as follows:
I = 1, V = 5, X = 10, L = 50, C = 100, D = 500 and M = 1000
In general, the symbols in the numeral system are read from left to right, starting with the symbol
representing the largest value; the same symbol cannot occur continuously more than three times; the
value of the numeral is the sum of the values of the symbols. For example, XXVII = 10 + 10 + 5 + 1 + 1
= 27. An exception to the left-to-right reading occurs when a symbol is followed immediately by a
symbol of greater value; then the smaller value is subtracted from the larger.
For example, XLVI = (50  10) + 5 + 1 = 46.
57. The value of the numeral MDCCLXXXVII is
a. 1687 b. 1787 c. 1887 d. 1987
58. The value of the numeral MCMXCIX is
a. 1999 b. 1899 c. 1989 d. 1889
59. Which of the following represent the numeral for 1995?
I. MCMLXXV II. MCMXCV III. MVD IV. MVM
a. Only I and II b. Only III and IV c. Only II and IV d. Only IV
60. What is the sum of all two-digit numbers that give a remainder of 3 when they are divided by 7?
a. 666 b. 676 c. 683 d. 77
61. An intelligence agency forms a code of two distinct digits selected from 0, 1, 2, , 9 such that the
first digit of the code is non-zero.  The code, handwritten on a slip, can however potentially create
confusion when read upside down   for example, the code 91 may appear as 16. How many codes
are there for which no such confusion can arise?
a. 80 b. 78 c. 71 d. 69
62. What is the remainder when 4
96
 is divided by 6?
a. 0 b. 2 c. 3 d. 4
63. Let n (>1) be a composite integer such that  n  is not an integer. Consider the following statements:
A: n has a perfect integer-valued divisor which is greater than 1 and less than  n
B: n has a perfect integer-valued divisor which is greater than  n  but less than n
a. Both A and B are false b. A is true but B is false
c. A is false but B is true d. Both A and B are true
Number  System Page 8
64. If a, a + 2 and a + 4 are prime numbers, then the number of possible solutions for a is
a. one b. two c. three d. more than three
65. Let a, b, c, d and e be integers such that a = 6b = 12c, and 2b = 9d = 12 e. Then which of the
following pairs contains a number that is not an integer?
a. 
a b
,
27 e
   _
   
   ,
b. 
a c
,
36 e
   _
   
   ,
c. 
a bd
,
12 18
   _
   
   ,
d. 
a c
,
6 d
   _
   
   ,
CAT 2004
66. On January 1, 2004 two new societies s
1
 and s
2
 are formed, each n  numbers. On the first day of
each subsequent month, s
1
 adds b members while s
2
  multiplies its current numbers by a constant
factor r. Both the societies have the same number of members on July 2, 2004. If b = 10.5n, what is
the value of r?
a. 2.0 b. 1.9 c. 1.8 d. 1.7
67. Suppose n is an integer such that the sum of digits on n is 2, and  10
10
 < n 10
n
. The number of
different values of n is
a. 11 b. 10 c. 9 d. 8
68. Let  
1
y
1
2
1
3
1
2
3 ...
+
+
+
+
What is the value of y?
a. 
11 3
2
+
b. 
11 3
2
c. 
15 3
2
+
d. 
15 3
2
+
 , then
a. 0 < R  0.1 b. 0 < R  0.5 c. 0.5 < R  0.1 d.R > 1.0
71. If x = (16
3
 + 17
3
 + 18
3
 + 19
3
), then x divided by 70 leaves a remainder of
a. 0 b. 1 c. 69 d. 35
72. let n! = 1  2  3    n for integer  n 1  .  If p = 1! + (2  2!) + (3  3!) +  + (10  10!), then p +
2 when divided by 11! Leaves a remainder of
a.10 b. 0 c. 7 d. 1
Number  System Page 9
73. The digits of a three-digit number A are written in the reverse order to form another three-digit
number B. If B > A and B-A is perfectly divisible by 7, then which of the following is necessarily
true?
a. 100 < A < 299 b. 106 < A < 305 c. 112 < A < 311 d. 118< A < 317
74. The rightmost non-zero digits of the number 30
2720
 is
a. 1 b. 3 c. 7 d. 9
75. For a positive integer n, let p
n
 denote the product of the digits of n and s
n
   denote the   sum of the
digits of n. The number of integers between 10 and 1000 for which p
n
 + s
n
 = n is
a.81 b. 16 c. 18 d. 9
76. Let S be a set of positive integers such that every element n of S satisfies the conditions
(a) 1000  n  1200
(b) every digit in n is odd
Then how many elements of S are divisible by 3?
a. 9 b. 10 c. 11 d. 12
CAT 2006
77. If x =  0.5, then which of the following has the smallest value?
1. 
1
x
2
2. 
1
x
3. 
2
1
x
4. 2
X
5. 
1
x
78. Which among 
1
2
2
, 
1
3
3
, 
1
4
4
, 
1
6
6
 and 
1
12
12
 is the largest?
1. 21/2 2. 31/3 3. 41/4 4. 61/6 5. 12/12
79. A group of 630 children is arranged in rows for a group photograph session. Each row contains three
fewer children than the row in front of it. What number of rows is not possible?
1. 3 2. 4 3. 5 4. 6 5. 7
80. The sum of four consecutive two-digit odd numbers, when divided by 10, becomes a perfect square.
Which of the following can possibly be one of these four numbers?
1. 21 2. 25 3. 41 4. 67 5. 73
81. When you reverse the digits of the number 13, the number increases by 18. How many other two-
digit numbers increase by 18 when their digits are reversed?
1. 5 2. 6 3. 7 4. 8 5. 10
Page  1 Number  System
Answers and ExpIanations
CAT 1998
1. c If  n
3
  is  odd,  then  n  should  also  be  odd.  Hence,  n
2
should also be odd. And n
2
 will again be odd and not
even. So only I and II are true.
2. b Since MPB is a three-digit number, and also the square
of a two-digit number, it can have a maximum value of
961 viz. 31
2
. This means that the number BE should be
less than or equal to 31. So B can only take the values
0, 1, 2 and 3. Since the last digit of MPB is also B, it can
only be 0 or 1 (as none of the squares end in 2 or 3).
The only squares that end in 0 are 100, 400 and 900.
But for this to occur the last digit of BE also has to be
0.  Since  E  and  B  are  distinct  integers,  both  of  them
cannot be 0. Hence, B has to be 1. BE can be a number
between  11  and  19  (as  we  have  also  ruled  out  10),
with its square also ending in 1. Hence, the number BE
can only be 11 or 19. 11
2
 = 121. This is not possible as
this  will  mean  that  M  is  also  equal  to  1.  Hence,  our
actual numbers are 19
2
 = 361. Hence, M = 3.
3. c The maximum and the minimum five-digit numbers that
can be formed using only 0, 1, 2, 3, 4 exactly once are
43210  and  10234  respectively.  The  difference
between them is 43210  10234 = 32976.
4. a The best way to solve this question is the method of
simulation, i.e. take a number which when divided by
899 gives a remainder of 63. The smallest such number
is (899 + 63) = 972. 972, when divided by 29 gives a
remainder  of  5.  Hence,  the  answer  is  5.
Students, please note that 899 itself is divisible by 29.
Hence, the required remainder is the same as obtained
by dividing 63 by 29, i.e. 5.
Shortcut:
Since 899 is divisible by 29, so you can directly divide
the  remainder  of  63  by  29,  so
63
29
will  give  5  as  a
remainder, option (a).
5. b Note that the difference between the divisors and the
remainders  is  constant.
2  1 = 3  2 = 4  3 = 5  4 = 6  5 = 1
In  such  a  case,  the  required  number  will  always  be
[a  multiple  of  LCM  of  (2,  3,  4,  5,  6)    (The  constant
difference)].
LCM of (2, 3, 4, 5, 6) = 60
Hence, the required number will be 60n  1.
Thus,  we  can  see  that  the  smallest  such  number  is
(60  1)  1 = 59
The second smallest is (60  2)  1 = 119
So between 1 and 100, there is only one such number,
viz.  59.
6. c Let us find some of the smaller multiples of 125. They
are 125, 250, 375, 500, 625, 750, 875, 1000 ...
A five-digit number is divisible by 125, if the last three
digits are divisible by 125. So the possibilities are 375
and 875, 5 should come in units place, and 7 should
come in tens place. Thousands place should contain
3  or  8.  We  can  do  it  in  2!  ways.  Remaining  first  two
digits, we can arrange in 2! ways. So we can have 2!
 2! = 4 such numbers.
There are: 23875, 32875, 28375, 82375.
7. b Since 2 has a cyclicity of 4,
i.e. 2
1
 = 2, 2
2
 = 4, 2
3
 = 8, 2
4
 = 16, 2
5
 = 32, 2
6
 = 64 ..., the
last digits (2, 4, 8, 6) are in four cycles.
 On dividing 
51
4
, we get the remainder as 3.
 The last digit has to be 2
3
 = 8
Shortcut:
Since  cyclicity  of  the  power  of  2  is  4,  so  2
51
  can  be
written in 2
4(12) + 3
 or unit digit will be 2
3
 = 8.
8. a The  number  formed  by  the  last  3  digits  of  the  main
number is 354.  The remainder is 2 if we divide 354 by
8. So the remainder of the main number is also 2 if we
divide it by 8.
CAT 1999
9. 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.
10. 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
+
 +
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.
35.  c Take a = b = c = d = 1.
36. 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.
37. 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.
38. 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)
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
39.  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.
CAT 2002
40.  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
41. b Check  choices
Choice (b) 54  S = (5 + 4)
2
 = 81
  D  S = 81  54 = 27. Hence, the number = 54
42. 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.
43. 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
44. a
  (   )
64
4 64 64
2 (17 1) 17n ( 1)       +     = 17n + 1
Hence, remainder = 1
45. 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
   _      _
+   +   +   
         
   ,      ,
LCM(7, 21, 49) 49 3
73.5 s
HCF ( 2, 4, 8) 2
   
Page  4 Number  System
46. d
9 27 36 HCF(9, 27, 36)
HCF , ,
2 4 5 LCM (2, 4, 5)
   _
   
   ,
9
20
lb
= Weight of each piece
Total weight = 18.45 lb
Maximum number of guests = 
18.45 20
41
9
 n
56.  b From 12 to 40, there are 7 prime number, i.e. 13, 17,
19, 23, 29, 31, 37, which is not divisible by (n1)!
CAT 2003 (Retest)
57. b MDCCLXXXVII = 1000 + 500 + 100 + 100 + 50 + 10 + 10
+ 10 + 5 + 1 + 1 = 1787
58. a MCMXCIX = 1000 + (1000  100) + (100  10) + (10 
1)  = 1000 + 900 + 90 + 9 = 1999
59.  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).
60. b Such numbers are 10, 17, , 94.
These numbers are in AP. There are 13 numbers.
10 94
Sum 13
2
+
      
            = 52  13 = 676
61.  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.
Page  5 Number  System
62. d Remainder when 
96
4
6
Lets  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.
63. 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.
64. a As any prime number greater than 3 can be expressed
in the form  6n 1 t , 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.
65. 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.
CAT 2004
66. 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         
67. a We have
(1) 10
10
 < n < 10
11
(2) Sum of the digits for 'n' = 2
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.
68. d
1
y
1
2
3 y
+
+
3 y
y
7 2y
+
   
+
 
2
2y 6y  3 0    +   
 
6 36 24
y
4
t   +
   
 
6 60 3 15
4 2
t   t
   
Since 'y' is a +ve number, therefore:
153
y
2
   ans.
69.  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)
CAT 2005
70. 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.
71. 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.
Page  6 Number  System
72. 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.
73. 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.
74. a   (   )
(   )
680
4
30
 Hence the right most non-zero digit is 1.
75. 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.
76. 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).
CAT 2006
77. 2 Go by option, put 
1
x
2
(1)  
2
1
2
4
(2)  
    
1 1
2
x 1/ 2
(3)  
(   )
   
2 2
1 1
4
x 1/ 2
(4)  
1/ 2
1
2
2
78. 2 LCM of 2, 3, 4, 6, 12 = 12
 
12 12 12 12 12 6 4 3 2 1
2 3 4 6 12
 3
4
 is greatest
Note: n
1/n
 is maximum when n = e (2.718). Among the
options n = 3 is closest to the value of e.
79. 4 Let  the  no.  of  students  in  front  row  be  x.
So, the no. of students in next rows be x  3,
x - 6, x  9. so on
If n i.e. no. of rows be 3 then no. of students
x + (x  3) + (x  6) = 630
3x = 639
x = 213
So possible similarly n = 4
x + (x  3) + (x  6) + (x - 9) = 630
4x  18 = 630
   
648
x 162
4
If n = 5
(4x  18) + (x - 12) = 630
5x  30 = 630
x = 120
Again  possible.
If n = 6
(5x - 30) + (x - 15) = 630
6x - 45 = 630
6x = 675
x   Integer
Hence n  6
80. 3 By options checking option (3), four consecutive odd
numbers  are  37,  39,  41  and  43.  The  sum  of  these  4
numbers is 160.
When  divided  by  10,  we  get  16  which  is  a  perfect
square.
 41 is one of the odd numbers.
81. 2 Let the number be 10x + y so when number is reversed
the number because 10y + x. So, the number increases
by  18
Hence (10y + x) - (10x + y) = 9 (y - x) = 18
y - x = 2
So, the possible pairs of (x, y) is (3, 1) (4, 2) (5, 3) (6,
4), (7, 5) (8, 6) (9, 7)
But we want the number other than 13 so, there are 6
possible numbers are there i.e. 24, 35, 46, 57, 68, 79.
So total possible numbers are 6.