SOLUTIONS AND EXPLANATIONS

1. a
Case I: a, b and c are all even OR all of them are odd.
In either case, (a + b), (b + c) and (c + a) will be all even. Hence their product
will be even.
Case II: Two are odd, one is even OR one is odd, two are even
Again in either case, the factor which has both odd or both even will be
even. And there would be atleast one such factor out of the three. Since one
factor is even, the whole product will be even.
So the product is always even.

2. c
2a = 4b = 8c  2a = 22b = 23b  a = 2b = 3c
Let a = 2b = 3c = k  a  k, b 
k
,c 
k
2 3

k k
a :b :c  k : : i .e. 6 : 3 : 2
2 3

3. b

   
100 100
2300  23  8100 and 3200  32  9100

Since 9100 is greater than 8100, hence 3200 is greater.

4. d
31002 × 71002 × 131003
Unit digit of successive powers of 3 and 7 have a cycle of 4 distinct values,
viz. (3, 9, 7, 1) and (7, 9, 3, 1) respectively.
Since 1002 ÷ 4 leaves a remainder of 2, 31002 will end with the second term
of its cycle i.e. 9 and 71002 will end with the second term of its cycle i.e. 9
again.
Since 1003 ÷ 4 leaves a remainder of 3, 31003 will end with the third term of
its cycle i.e. 7.
Thus, the required unit digit will be the unit digit of the product 9 × 9 × 7
i.e. 7.

5. b
Factorising, 1000 = 23 × 53.
For n! to be divisible by 1000, it should have three 5’s in its product. The
three 5’s will be available, one each, in 5, 10, 15. Thus n = 15. There are
plenty of 2’s in 15!, so we need not be worried about it.

6. a
Factorizing, 72 = 23 × 32 and 112 = 24 × 7.
The least power of 2 and 7 in any multiple of 112 will be 4 and 1
respectively. Since we need to find the least number 72 has to be multiplied
with so that it is a multiple of 112, we just need to multiply with 2 × 7.

7. d
Factorizing 3750 = 2 × 3 × 54
For a perfect square the indices of all prime factors should be even. Since 2
and 3 have a power of 1 each, 3750 should be divided by 2 as well as 3.
Hence it should be divided by 2 × 3 i.e. 6.

8. e
Factorizing, 6 = 2 × 3, 8 = 23, 15 = 3 × 5
To be divisible by all three numbers, the perfect square should have all the
three prime numbers viz. 2, 3 and 5 and the powers of these primes should
be equal to or higher than the maximum power of the respective prime that
occurs in any of the three number. Also the powers should be even.
Hence the number should be 24 × 32 × 52 = 3600

9. a
Substituting 6 = 2 × 3 and 65 = 5 × 13,
641 × 356 × 117 × 659 = 241 × 397 × 59 × 117 × 139
Hence there are 5 prime factors, viz. 2, 3, 5, 11 and 13.

10. c
The number a × 43 × 62 × 1311 = a × 28 × 32 × 1311
a  28  32  1311
If, is a natural number, then the minimum value of a has to be
112 or 33
3 × 112 = 363

11. b
There are 100 numbers from 101 to 200. The number of multiples of 5 in
these 100 numbers are 100  20 .
5
 100
The number of multiples of 25 in these 100 numbers are 4
25

These will have another 5 each.

The number of numbers that are multiples of 125 in these 100 numbers is
1. This will have another 5.
So there are a total of 20 + 4 + 1 i.e. twenty-five 5’s in the product. Number
of 2’s are definitely more than 25 since the 100 numbers have 50 even
numbers. So number of zeroes is 25.
Alternately,
In the product of numbers from 1 to 200, there will be 40 + 8 + 1 = 49
powers of 5 and in the product of numbers from 1 to 100 there will be 20 +
4 = 24 powers of 5. Thus, in the product of numbers from 101 to 200 there
will be 49 – 24 = 25 powers of 5. Since the powers of 2 are obviously going to
be far more than 25, the required product will have 25 zeroes at end.

12. c
Since the remainder is 8 in each case, hence 365 – 8 = 357, 512 – 8 = 504
and 323 – 8 = 315 are completely divisible by the required number.
The greatest number that will divide 357, 504 and 315 is the HCF of all
three.
Easiest way to find HCF in this case is to take the least difference between
any two numbers, 357 – 315 = 42 in this case, and the HCF will be a factor
of 42. It’s easy to check that each of the numbers is divisible by 7 and 3.
Hence HCF and the required number is 21.

13. d
The numbers 964 – 41 = 923, 1238 – 31 = 1207 and 1400 – 51 = 1349
should be completely divisible by the number. Since greatest such number
is required, it would be the HCF of 923, 1207, 1349. Again using the above
approach of differences, 1349 – 1207 = 142. Factors of 142 are 2 and 71
only. It is easy to check that all three numbers are multiples of 71 but not 2
and hence HCF and the required number is 71.

14. d
The general form of the number has to be LCM of (5, 6, 7) × a + 3 = 213 i.e.
210a + 3. We need to find a value of a for which this number will be divisible
by 9.
210a + 3 when divided by 9 will leave a remainder of 3a + 3. Thus, 3a + 3
should be a multiple of 9 i.e. a has to be 2. The required number will be 210
× 2 + 3 = 423.
15. b
If the total number of eggs in the basket is n, dividing it by 2 will leave
remainder 1, by 3 will leave remainder 2, by 4 will leave remainder 3 and so
on… The difference between the divisor and remainder is always same i.e. 1.
So LCM of (2, 3, 4, 5, 6) = 60a – 1 (the general case)
But (60a – 1) should also be divisible by 7 i.e. the remainder, (4a – 1) should
be divisible by 7. This is true for a = 2.
No of eggs = 60 × 2 – 1 = 119

16. b
Number when divided by 12 should leave 2 and when by 15 should leave 5.
In both the difference between the divisor and remainder is same = 10.
LCM of 12 and 15 is 60. Hence all numbers of form 60a – 10 will satisfy
these conditions
When a = 2, n = 110, the first three digit number of this form.
When a = 16, n = 950, the last three digit number of this form.
So for all values of a ranging from 2 to 16, n will be a 3 digit number. So
total numbers = 16 – 2 + 1 = 15

17. a
X is a number of the form 899a + 63. Consider dividing this number by 29.
Since 899 ÷ 29 leaves a remainder of 0 and 63 ÷ 29 leaves a remainder of 5,
the remainder when X is divided by 29 will be 0 × a + 5 i.e. 5.

18. e
The first number is of the form 222a + 35 and the second number is of the
form 407b + 47.
Adding the two numbers, we get 222a + 407b + 82.
Since 222 and 407 are divisible by 37, when the number is divided by 37,
the remainder will be the same as that when 82 is divided by 37 i.e. the
required remainder is 8.

19. c
a2 – 2a = a(a – 2) = (b2 – b) × (b2 – b – 2) = b(b – 1) × (b – 2)(b + 1)
Rearranging the factors, we have a2 – 2a = (b – 2) × (b – 1) × b × (b + 1), i.e. a
product of four consecutive numbers.
In four consecutive natural numbers, we will always have one multiple of 4,
atleast one multiple of 3 and one more multiple of 2. e.g. the smallest such
series being 1, 2, 3, 4.
Hence the product will always be divisible by atleast 2 × 3 × 4 i.e. 24.

20. c
When 7n is divided by 800, for successive values of n, the remainders follow
the cycle of 7 49 343 2401 . Since the cycle is of 4 different values, 187th term
1
in the cycle will be same as the remainder when 187 is divided by 4 i.e. the
3rd term. Thus the remainder will be 343.

21. a
For successive values of n, the remainders when 2n is divided by 25 will be
2 4 8 16 32 14 28 6 12 24
7 3 1

Thus 210 will leave a remainder of –1 and 220 will leave a remainder of 1.
Thus the remainders will have a cycle of 20 distinct values. We require the
1000th term of the cycle which will be same as the 20th term (since 1000 is a
multiple of 20). Thus, required remainder is 1.

22. a
For successive values of n, the remainders when 5n is divided by 18 will be
5 25 35
. Thus 53 ÷ 18 leaves remainder –1 and 56 ÷ 18 leaves remainder 1.
7 1

Thus the remainders will have a cycle of 6 distinct values. We require the
100,000th term of the cycle, which will be same as the term equal to the
remainder when 100,000 is divided by 6. Since this remainder is 4, the
answer will be the fourth term in the cycle of remainders.
We know the third term in the cycle is –1 and so the fourth term will be –1 ×
5 i.e. –5 which means a remainder of –5 + 18 = 13. Alternately 52 when
divided by 18 leaves a remainder 7 (second in the cycle), so 54 when divided
by 18 will leave a remainder of 72 i.e. 49, which on further dividing by 18
leaves a remainder of 13.

23. d
Dividing 1044 by 33, we find the remainder as 21.
Now since the remaining multiplicands, 1047, 1050, 1053, are each 3 more
than the previous, when divided by 33 will leave remainder of 24, 27, 30
respectively.
Thus, required remainder is 21 × 24 × 27 × 30. Since the numbers here are
a little larger, we can also consider the remainders as the equivalent
negative values (by subtracting the divisor 33) and reduce our calculation.
Required remainder = (–12) × (–9) × (–6) × (–3)
Further reducing our calculation, (–12) × (–9) = 108 i.e. a remainder of 9 on
dividing by 33.
9 × (–6) × (–3) = 162 i.e. remainder of 30 on dividing by 33.

24. d
From 1 to 100 are hundred consecutive natural numbers. Thus 1 will
appear a total of 20 times (10 times in the unit’s place, 1, 11, 21, …., 91;
and 10 times in the ten’s place. 10, 11, 12, …., 19). However the answer will
be 21 because we would require one more 1 to write the hundred’s position
of the number 100.

25. a

 
2
The inner-most root, 23  8 7  16  2  4  7  7  4  7

Thus, 12  5 7  23  8 7  12  5 7  4  7  16  6 7

 
2
Next, 16  6 7  9  2  3  7  7  3  7

Thus, required expression = 8  3 7  3  7  11  4 7

  , the required expression is

2
Since 11  4 7  4  2  2  7  7  2  7 2 7

26. e
P is greater than 1999! + 1. So the first value that it can assume is 1999! +
2. Since two is common to both the terms, it can be written as 2 × (some
number). Thus this will not be prime. Similarly 1999! + 3 can be written as
3 × (some number). And this logic will remain valid for all numbers upto
1999! + 1998.
Thus there will be no prime value that P assumes.

27. a
Here you can just successively check which of 1, 11, 111, 1111, … is
divisible by 7.
You need not consider each number separately, just keep appending 1’s at
the end of 11 till the time the number is completely divisible. E.g. 11 leaves
remainder of 4; 111 will leave a remainder of 41 i.e. 6; 1111 will leave a
remainder of 61 i.e. 5; 11111 will leave a remainder of 51 i.e. 2; 111111 will
leave a remainder of 21 i.e. 0. Thus 111111 is completely divisible.
Trivia: Any number formed by writing the same digit six times, i.e. of the
form aaaaaa is divisible by 7, 11 and 13.

28. a
The 4th power of the first 10 natural numbers is 14 + 24 + 34 + 44 + 54 + 64 +
74 + 84 + 94 + 104 and their unit digit of the sum will be the unit digit of 1 +
6 + 1 + 6 + 5 + 6 + 1 + 6 + 1 + 0 i.e. 3.
Now, each set of summation of fourth powers of next 10 consecutive
numbers will also have same unit’s digit because the unit digit depends only
on the unit digit of any number. There are in all 10 such sets of 10
consecutive numbers from 1 to 100 and thus the unit digit will be unit digit
of 3 + 3 + 3 + …. + 310 times i.e. 3 × 10 i.e. unit digit will be 0.
Short-cut:
Once we realised that there are 10 such sets, the unit digit will be the (unit
digit of each set) × 10 and any number multiplied with 10 has to end with a
0.

29. b
Since the unit digit of successive powers of 7 follow a cycle of 4 (viz. 7, 9, 3,
1), all we need to find here is the remainder when 2737 is divided by 4. And
the answer will be that term of the cycle.
27 divided by 4 leaves a remainder of 3 i.e. –1. Hence 2737 will leave a
remainder of (–1)37 i.e. –1 i.e. 3.
Thus, the unit digit is the third in the cycle, which is 3.

30. a
Any power of 1, 5, 6 will end with 1, 5, 6 respectively.
Since the cycle of unit’s digit of any power of 4 and 9 is 2, 4even and 9even will
be the second term of their respective cycles i.e. 6 and 1 respectively.
The cycle of unit’s digit of any power of 2, 3, 7 and 8 is 4. Thus, their indices
have to be divided by 4 and the so found remainder will tell us which term of
the cycle is the unit digit.
Considering 22!: Dividing 2! by 4 leaves a remainder of 2 and hence the unit
digit of 22! will be second of the cycle i.e. 4.
Considering 33!: Dividing 3! by 4 leaves a remainder of 2 and hence the unit
digit of 33! will be second of the cycle i.e. 9.
Considering 77! and 88!: Since both 7! and 8! are fully divisible by 4, their
unit digit will be the last term of their respective cycles i.e. 1 and 6
respectively.
The required unit digit will be the unit digit of the sum 1 + 4 + 9 + 6 + 5 + 6
+ 1 + 6 + 1 i.e. 9.

31. d
We need to factorize 16!. Each of 2, 3, 5, 7, 11 and 13 will be the prime
factors of 16!.
 16  16  16  16 
Power of 2 in 16! will be  2    4    8   16  i.e. 8 + 4 + 2 + 1 = 15

16  16 
Power of 3 in 16! will be  3    9  i.e. 5 + 1 = 6

Power of 5 will be 3, power of 7 will be 2, power of 11 and 13 will be 1 each.

Number of factors then = (15 + 1) × (6 + 1) × (3 + 1) × (2 + 1) × (1 + 1) × (1 +
1) = 5376
Alternately,
You need not completely factorise 16!. Once you find that the power of 2 is
15, the number of factors has to be a multiple of 16 and the only possible
answer is 5376 (option (a), 16, is too small to be the number of factors.)

32. c
10! can be factorised as 28 × 34 × 52 × 7.
Finding the powers of only these prime numbers in the factorised form of
100!,
Power of 2 in 100! will be 50 + 25 + 12 + 6 + 3 + 1= 97
Power of 3 in 100! will be 33 + 11 + 3 + 1 = 48
Power of 5 in 100! will be 20 + 4 = 24
Power of 7 in 100! will be 14 + 2 = 16.
297  348  524  716  ......
We need to find the highest value of x such that results in
28  34  52  7
x

complete cancellation of the denominator. Thus, x can take a maximum

value of 12. For any higher value, the powers of 2, 3 and 5 cannot be
cancelled completely from the denominator.

33. b
1 billion is 1 followed with 9 zeroes and can be factorised as 29 × 59.
The only way either of the multiplicand does not end with a zero is to keep
all 2’s and 5’s separate and not let them appear in any one multiplicand
together. Thus the only way this can be done is when one multiplicand is 29
and other is 59.
34. b
Number of factors of 720 i.e. 24 × 32 × 5 is (4 + 1) × (2 + 1) × (1 + 1) = 30
Factors equidistant from the extremes will have their product equal to the
number itself i.e. 720. So multiplication of 1st & 30th; 2nd & 29th; ……, 5th
& 26th factors will be 720.
Factors in increasing order will be: 1, 2, 3, 4, 5, 6...... (each of these
numbers divide 720)
So 5th factor will be 5. So 26th factor will be 720
i.e. 144.
5

35. c
Statement (i); If a number, say 2a × 3b × 5c × …, has 3 factors, then (a + 1) ×
(b + 1) × (c + 1) …. = 3. Thus one of a, b, c has to be 2 and all other has to be
0. So the number is of the form (prime)2. Hence only squares of prime would
have 3 factors.
Statement (ii): If a number 2a × 3b × 5c × … has 4 factors, then (a + 1) × (b +
1) × (c + 1) …. = 4. Thus there could be two cases:
One of a, b, c has to be 3 and all other has to be 0. So the number is of the
form (prime)3. OR
Two of a, b, c, … can be 1 and rest all 0. So the number of the form p1 × p2
would also have four factors. So this statement is false.
Statement (iii): Using an argument similar to that used for statement (i)
(since 5 is prime), it can be concluded that a number having 5 factors has to
be a fourth power of a prime number. Hence the given statement is also true
because all prime numbers are also natural numbers.
Remember, all prime numbers are natural and hence the statement is
always true. The given statement is NOT saying that “all fourth power of
natural number have 5 factors”.

36. e
For any two numbers, product of the numbers = HCF × LCM. If we use this,
the other number has to be 75  864  270 . But this is not the correct answer.
240
For any set of numbers, the LCM has to be a multiple of the HCF. Since 864
is not a multiple of 75, the data is inconsistent.

37. c
If the three numbers are n1, n2 and n3 and the divisor is d, then
n1 = a × d + 11; n2 = b × d + 15; n3 = c × d + 18; where a, b, c are the
quotients of each division.
Thus (n1 + n2 + n3) = (a + b + c) × d + 44
Thus, when n1 + n2 + n3 is divided by d, the remainder ought to be 11 + 15 +
18 i.e. 44. But it is 2. Thus, in the model explained, it means 42 marbles
also got taken away from the table while forming few more groups of d
marbles. Thus d could be any factor of 42, but should be greater than all of
11, 15, 18 (as these were the remainders when n1, n2, n3 were divided by d).
The only factors of 42 greater than these are 42 or 21.

38. a
Let the two numbers be a and b and the divisor be n. Since both a and b
leave the same remainder when divided by n, so the difference between the
two should be a multiple of n.
a=x×d+r
b=y×d+r
Subtracting a – b = (x – y) × d
So divisor could be any factor of 450.
No of factors of 450 i.e. 2 × 32 × 52 is (1 + 1) × (2 + 1) × (2 + 1) = 18. But this
also includes 1 for which the condition will not be true. So number of
possible divisors = 18 – 1 = 17

39. d
If the remainders are ‘removed’ from the numbers, the left-overs would be
completely divisible.
222 – 51 = 171; 333 – 48 = 285; and 444 – 45 = 399
Thus, n completely divides each of 171, 285 and 399. And thus n could be
the HCF or any factor of the HCF.
The HCF of 171, 285 and 399 is 57. n could be 57 or any of its factor but
has to be greater than each of 51, 48 and 45 because these were the
remainders on being divided by n. Thus n has to necessarily be 57.
With n = 57, each of (n + 4) and (n + 7) when divided by 19 will leave a
remainder of 4 and 7 and hence the product will leave a remainder of 4 × 7
i.e. 28. Since this is larger than the divisor, 19, we again divide this to get
the answer as 9.

40. c
The side of the cube should be a factor of each of 20, 16 and 12. So that we
use the minimum number of cubes, the side of the cube should be as large
as possible. Thus the side of the cube should be the HCF of 20, 16 and 12
i.e. 4. The number of cubes required will be 20 16 12  60
4 4 4

41. d
To make a cube, its dimensions should be all same. The side of the cube
would be a multiple of 6, 4 and 3. The smallest such value will be the LCM
of 6, 4 and 3 i.e. 12. Volume of the cube = 12 × 12 × 12 = 1728

42. b
9 divided by 6 leaves a remainder 3;
9 × 9 will also leave a remainder 3 × 3 i.e. 9, which on dividing by 6 will
leave a remainder of 3 again.
(9 × 9) × 9 will also leave a remainder 3 × 3 i.e. 9, which on dividing by 6 will
leave a remainder of 3 again.
Each of the 99 terms leave a remainder 3.
So the remainder will be 3 + 3 + 3 +...99 terms = 297, which on dividing by 6
will leave a remainder of 3.

43. b
Successive powers of 2 on being divided by 97 will leave remainders of:
2, 4, 8, 16, 32, 64, 128 i.e. 31, 62, 124 i.e. 27, 54, 108 i.e. 11, 22, 44, 88,
176 i.e. 79, 158 i.e. 61, 122 i.e. 25, 50, 100 i.e. 3, 6, 12, 24, 48, 96 i.e. –1
Counting the above remainders, 224 when divided by 97 will leave a
remainder of – 1 and hence 248 will leave a remainder of 1. Thus, the cycle of
remainders will be of 48 distinct values of which the first 24 are already
found above.
We need the remainder when 250 is divided i.e. we need the 50th term in a
cycle of 48 values. The 50th term will be the 2nd term (since cycle restarts at
49th term) i.e. 4.

44. d
Successive powers of 3 on being divided by 41 will leave remainders of: 3, 9,
27, 81 i.e. –1
Thus, cycle of remainders when 3n is divided by 41 will be of 8 distinct
values.
We need to find the 57th term of this cycle. The required term will be the
same term as the remainder when 57 is divided by 8
Successive powers of 5 on being divided by 8 will leave remainders of: 5, 25
i.e. 1.
Thus, cycle of remainders when 5n is divided by 8 will be of 2 distinct
values. The 7th term of this cycle will be same as the first term i.e. 5
Thus the required answer is the 5th term in the cycle 3, 9, 27, –1, ……
The required remainder is –1 × 3 i.e. –3 i.e. –3 + 41 i.e. 38.

45. a
Successive powers of 5 on being divided by 11 will leave remainders of: 5, 25
i.e. 3, 15 i.e. 4, 20 i.e. 9, 45 i.e. 1.
Thus the cycle of remainders when 5n is divided by 11 is 5, 3, 4, 9, 1
We want to find the 25125th term of this cycle. And since 25125 is a multiple
of 5, it will be the last term of the cycle i.e. 1.
46. c
83
63 ÷ 13 leaves a remainder of 11 and hence 6373 ÷ 13 will leave a remainder
83
of 1173
Successive powers of 11 on being divided by 13 will leave remainders of: 11,
121 i.e. 4, 44 i.e. 5, 55 i.e. 3, 33 i.e. 7, 77 i.e. –1.
Thus the cycle of remainders when 11n is divided by 13 is 11, 4, 5, 3, 7, –1
The entire cycle will have 12 terms and we need to find the 7383rd term of
this cycle of 12 terms.
The required term will be the same term as the remainder when 7383 is
divided by 12
Since 73 ÷ 12 leaves a remainder of 1, hence 7383 ÷ 12 will leave a
remainder of 183 i.e. 1.
Thus the required answer is the 1st term in the cycle 11, 4, 5, ……
The required remainder is 11.

47. d
In successive division, the quotient of the earlier division is divided by the
next divisor. Thus if n is the number in the question, then
n = 7a + 5; a = 5b + 3 and b = 3c + 1
Substituting backwards, we get n = 105c + 61. So when n is divided by 105,
it will leave 61 as the remainder.
Shortcut: n can be directly identified as 7 × 5 × 3 × m + 61.
61 is found as 1 × 5 = 5; 5 + 3 = 8; 8 × 7 = 56; 56 + 5 = 61.

48. b
In any set of 100 natural numbers, there will be 19 numbers that have the
digit 5 in them in the unit’s or the ten’s place (or both).
From 100 to 999, we have 900 numbers. If we leave aside all 500s i.e. from
500 to 599 (they will all have the digit 5 in them in the hundred’s place)
there will be 8 sets of 100 consecutive numbers.
In theses 8 sets there would be 8 × 19 = 152 numbers having the digit 5 in
them. And of course all the numbers from 500 to 599 would have the digit 5
in them.
So total numbers that will have the digit 5 in them = 100 + 152 = 252

49. e
In any set of 100 natural numbers, there will be 18 numbers that have the
digit 5 in them exactly once, in the unit’s or the ten’s place (but not both).
From 100 to 999, we have 900 numbers. If we leave aside all 500s i.e. from
500 to 599 (they will all have the digit 5 in them in the hundred’s place)
there will be 8 sets of 100 consecutive numbers.
In these 8 sets there would be 8 × 18 = 144 numbers having the digit 5
exactly once in them.
In the 100 numbers from 500 to 599, excluding the 19 numbers which have
the digit 5 in either the unit’s or ten’s (or both) place, rest all will have 5
exactly once (in the hundred’s place. Thus there will be 100 – 19 = 81 such
numbers.
So total numbers that will have the digit 5 exactly once in them = 144 + 81 =
225
Alternately using P & C:
Total number of three-digit numbers with 5 as their unit’s digit and other
digits not being 5 are 8 × 9 × 1 = 72 (leading digit cannot be 0 or 5 and
hence can be filled in 8 ways and ten’s digit cannot be 5 and hence can be
filled in 9 ways. Unit’s digit is 5 i.e. 1 way)
Total number of three-digit numbers with 5 as their ten’s digit and other
digits not being 5 are 8 × 1 × 9 = 72
Total number of three digit numbers with 5 as their hundred’s digit and
other digits not being 5 are 1 × 9 × 9 = 81.
Thus, total possible such number = 72 + 72 + 81 = 225.

50. d
Seeing that four I’s add to number ending in E and four E’s add to a number
ending in I.
Assuming that there is no carry-over (just to make our start simple) …
…if I = 1 then E = 4. But 4 × E i.e. 16 does not end with I i.e. 1.
… if I = 2 then E = 8. And 4 × 8 i.e. 32 does end with I i.e. 2.
Taking this as a starting point, I = 2, E = 8 and V = 3. Now 4 × N ends with R
and there is no carry-over. Thus, N = 1 and R = 4.
Now we do not have to try any other possibility because alphametics in
exams would usually have only one unique solution. Also the option choices
in this question suggests a unique answer.
Thus, V + I + E + R is 3 + 2 + 8 + 4 = 17.

51. a
ab c

99 d

Thus, ab and 99 should have a common factor and on cancelling the

common factor 99 should reduce to a single digit number.
All the factors of 99 are 1, 3, 9, 11, 33 and 99. The factors that on cancelling
make 99 a single digit number (other than 1) are 11 and 33. (d cannot be 1
else the number would not be a recurring number)
Thus, ab should be a multiple of 11 (all multiples of 33 are included in
multiples of 11).
Thus ab could be 11, 22, 33, ……, 88 i.e. 8 distinct values.

52. b
Each bush has 66 roses. No of bushes has to be a whole number. Hence the
total number of roses is divisible by 66. This means it is divisible by 11, 2
and 3.
For 49a81b to be divisible by 2, b should be even.
Checking divisibility by 3, a + b = 2 or 5 or 8 or 11 or 14 or 17. It cannot be
more than this as a and b are single digit numbers.
Checking divisibility by 11, difference between (17 + b) and (5 + a) has to be
0 or 11 or 22…. Difference cannot be 0 because (5 + a) can never be equal to
(17 + b) for any value of a.
Nor can the difference be 22 because (17 + b) can never be 22 more than (5
+ a).
Thus (17 + b) – (5 + a) = 11  a – b = 1
Since a – b is odd, hence a + b should also be odd, so that a and b are whole
numbers.
Solving a – b = 1 and a + b = 5, we get a = 3, b = 2
Solving a – b = 1 and a + b = 11, we get a = 6, b = 5, not possible as b is not
even.
Solving a – b = 1 and a + b = 17, we get a = 9, b = 8
So, total number of roses can be two possible values.

53. a
1 1 1

Let 3a  5b  15 c k

Thus, 3 = ka, 5 = kb, 15 = k–c

Since 15 = 3 × 5, hence ka × kb = k–c a + b = –c a + b + c = 0

54. e
Since n is the smallest and the powers of its prime factors, 2, 3 and 5 are
being changed, let’s consider n to be 2a  3b  5c .
Thus, as per the requirement,
2a 1  3b  5c is a perfect square. …… condition (i)
2a  3b 1  5c is a perfect cube. …… condition (ii)
2a  3b  5c 1 is a perfect fifth power. …… condition (iii)
From condition (ii) and (iii), a has to be multiple of 3 and 5 such that a + 1
is a multiple of 2. The smallest multiple of 3 and 5 is 15, which also satisfies
condition (i). Thus a = 15
From condition (i) and (iii), b has to be multiple of 2 and 5 such that b + 1 is
a multiple of 3. Multiple of 2 and 5 are 10, 20, 30, … of which 20 also
satisfies condition (ii). Thus b = 20
From condition (i) and (ii), c has to be multiple of 2 and 3 such that c + 1 is
a multiple of 5. Multiples of 2 and 3 are 6, 12, 18, … of which 24 satisfies
condition (iii). Thus c = 24
Thus, a + b + c is 15 + 20 + 24 = 59.

55. a
Since n is the smallest and the powers of its prime factors, 2, 3 and 5 are
being changed, let’s consider n to be 2a  3b  5c .
2a 1  3b  5c is a perfect square. … condition (i)
2a  3b 1  5c is a perfect cube. …… condition (ii)
2a  3b  5c 1 is a perfect fifth power.…… condition (iii)
From condition (ii) and (iii), a has to be multiple of 3 and 5 such that a – 1 is
a multiple of 2. The smallest multiple of 3 and 5 is 15, which also satisfies
condition (i). Thus a = 15
From condition (i) and (iii), b has to be multiple of 2 and 5 such that b – 1 is
a multiple of 3. Multiple of 2 and 5 are 10, 20, 30, … of which 10 also
satisfies condition (ii). Thus b = 10
From condition (i) and (ii), c has to be multiple of 2 and 3 such that c – 1 is a
multiple of 5. Multiples of 2 and 3 are 6, 12, 18, … of which 6 satisfies
condition (iii). Thus c = 6
Thus, a + b + c is 15 + 10 + 6 = 31.

56. b
A factor of 24  37  52 necessarily has to be of the form 2a  3b  5c .
Let’s find the number of factors having ATLEAST 1 trailing zero. This means
that in the factor, a could be any value from 1 to 4, b could be any value
from 0 to 7 and c could be any value from 1 to 2. Total number of such
factors = 4 × 8 × 2 = 64
Let’s find the number of factors having ATLEAST 2 trailing zeroes. This
means that a could be any value from 2 to 4, b could be any value from 0 to
7 and c has to be just 2. Total number of such factors = 3 × 8 × 1 = 24
Number of factors with exactly 1 zero = Number of factors with atleast 1 zero
– Number of factors with atleast 2 zeroes = 64 – 24 = 40
Error:
Lot of student solve the question as follows and arrive at a wrong answer:
So that the factor has exactly one zero, consider two case:
Case 1: a is fixed equal to 1. Now b could be any value from 0 to 7 and c
could be 1 or 2. Thus there are 1 × 8 × 2 = 16 such factors.
Case 2: c is fixed equal to 1. Now a could be any value from 1 to 4 and b
could be any value from 0 to 7. Thus there are 4 × 8 × 1 = 32 such factors.
Thus total number of factors with exactly one zero is found to be 16 + 32 =
48.
The error here is that all factors of the form 21 × 30 to 7 × 51, i.e. 8 factors in
all, have been counted in both the cases.
Thus, correcting the double counting, the correct answer is 48 – 8 = 40.

57. c
For a number to be prime to 34 × 52 the number should be neither a
multiple of 3 nor of 5.
34  52
Multiples of 3 from 1 to 34 × 52 are  33 × 52 = 675
3

4
 52
Multiples of 5 from 1 to 34 × 52 are 3  34 × 51 = 405
5

34  52
Multiples of 3 and 5 i.e. multiples of 15 from 1 to 34 × 52 are  33 × 51
35
= 135
Multiples of either 3 or 5 from 1 to 34 × 52 = 675 + 405 – 135 = 945
Number of natural numbers that are prime to 34 × 52 and are less than it
are 2025 – 945 = 1080. (34 × 52 is equal to 2025)

58. e
Consider a factor of this number, 2a × 3b × 5c.
Perfect squares have even powers of all their prime factors. So for perfect
square, a could be 0, 2, 4, 6, 8, 10 or 12 i.e. it can take 7 different values; b
could be 0 or 2 i.e. it can take 2 different values; and c can be 0, 2 or 4 i.e. it
can take 3 different values.
Thus, number of factors which will be perfect squares = 7 × 2 × 3 = 42
Perfect cubes, which are perfect squares also, have multiples of 6 as powers
of all their factors. So for 2a × 3b × 5c to be a perfect cube and a perfect
square, a can be 0, 6 or 12 i.e. a can take 3 different values; b can be only 0
i.e. b can take only 1 value; and similarly c can be only 0 i.e. c can also take
only 1 value.
Thus number of factors that are squares and also perfect cubes = 3 × 1 × 1
=3
So, number of factors which are perfect squares but not perfect cubes = 42 –
3 = 39

59. b
The number is 987654321098765………543210 (100 digits)
132 can be factorised as 11 × 4 × 3. Thus we have to add some number so
that the result is divisible by each of 3, 4 and 11.
Checking divisibility by 3: 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 + 0 = 45 (divisible
by 3). Since the same is repeated 10 times, the given number is already
divisible by 3.
Checking divisibility by 4: The last two digits are 10, which is not divisible
by 4. Among the option choices, adding 2 or 6 or 18 will make the number
divisible by 4.
Checking divisibility by 11: Adding alternate numbers in 9876543210, 9 + 7
+ 5 + 3 + 1 = 25, 8 + 6 + 4 + 2 + 0 = 20. The difference is 5, in 10 such
groups it will be 50. The difference should be a multiple of 11 for it to be
divisible by 11. If we add 6 to the number, the difference between the sums
of alternate numbers will reduce to 44. Adding 6 will also make it divisible
by 4.

60. d
LCM = 27 × 55
HCF = 23 × 53
Thus if the numbers are 2a × 3b and 2x × 3y , then one of a and x will be 3
and other will be 7; one of b and y will be 3 and other will be 5.
With just these two conditions, we would get two possibilities:
a = 3 and b = 3 OR a = 3 and b = 5 (rest conditions boil down to the same
because the order of the numbers do not matter)
The two pairs are 23 × 53 & 27 x 55 OR 23 × 55 & 27 x 53. You can check out
that any other way of distributing values between a, b, x and y would result
in the same pairs with just the order in the pair changing.

61. b
Consider the case when the trader has one-fifth the number of jars and he
divides them into groups of n jars. In this case, it is given that he is left with
32 jars.
Now if he had five times the number of jars as in the previous case, he
should have been left with 32 × 5 = 160 jars at the end. But he is left with
just 7 jars. Thus the other 153 jars have got divided into groups of n jars.
Thus n has to be a factor of 153. Also n has to be a number greater than 32
(else he would not have left with 32 jars in the first case).
Since 153 = 3 × 3 × 17, the smallest value of its factor, n, (but greater than
32) is 51. Thus n = 51.
When he divides 460 jars in groups of 51 he would be able to form 9 groups
and 1 will be left over.
Mathematically,
Let the number of jars he has be J.
J
Thus J = n × a + 7 and  n  b  32  J  5nb  160
5

Thus, na + 7 = 5nb + 160  n(a – 5b) = 153. Thus n has to be a factor of

153. Also it has to be greater than 32 because when J/5 is divided by n the
remainder is 32 and the remainder is always less than the divisor. Thus n =
51.
When 460 jars are divided into groups of 51, the remainder will be 1.

62. d
This is exactly like the previous example. When the trader divides the
number of jars he has in groups of n jars he is left with 7 jars.
If he had five times the number of jars and he divided them again into
groups of n jars each, he should have been left with 7 × 5 i.e. 35 jars. But he
is left with just 4 jars. Thus 31 jars got divided into groups of n jars. Thus, n
has to be a factor 31. Since 31 is prime, n = 31 (it cannot be 1 else he would
not be left with 7 or 4 jars).

63. b
Method 1:
The required number should be of the form 7a + 5, 8b + 4 and 9c + 3.
8b + 4 = 4 × (2b + 1) It should be a multiple of 4 but not 8
9c + 3 = 3 × (3c +1) It should be a multiple of 3 but not 9
Thus the number should be a multiple of 4 and 3 i.e. of 12. But it should
not be a multiple of 8 or 9. Checking for such numbers among multiples of
12 less than 100, we find that only 12, 60, 84 satisfy the condition. Again
the number should also leave a remainder of 5 when divided by 7. Thus
acceptable number is only 12.
Method 2:
Say the smallest number satisfying the condition is n. The next number that
satisfies the condition can only be if we add the LCM of 7, 8 and 9 to n. Only
then would the remainders be the same. i.e. the numbers will be of the form
LCM (7, 8, 9) × a + n i.e. 504a + n. In the first 100 numbers there can be a
maximum of one such number, if there is any.
Checking for the numbers that leave a remainder of 3 when divided by 9 i.e.
12, 21, 30, …, we find that 12 itself satisfies the other two conditions. Thus
the numbers that satisfy the condition are 12, 516, 1020, … i.e. only one
number less than 100.

64. a
n will be of the form:
n = 3a + 1 n = 5b + 2 n = 7c + 3 n = 9d + 4
Multiplying each of the equations by 2,
2n = 6a + 2 = 3A + 2 2n = 10b + 4 = 5B + 4
2n = 14c + 6 = 7C + 6 2n = 18d + 8 = 9D + 8
This means that when 2n is divided by 3, 5, 7 and 9, the remainders are 2,
4, 6 and 8 respectively. This is a standard problem with difference between
divisors and remainders being 1.
So, smallest value of 2n = LCM (3, 5, 7, 9) – 1 = 315 – 1 i.e. 314 and the
smallest value of n is 157. The product of the digits is 35.

65. c
One full cycle (red and green) of the first signal is of 7 minutes and that of
the second signal is of 8 minutes. Thus after the LCM of 7 and 8, they would
have just completed a cycle i.e. after 56 minutes, they would again turn red
simultaneously. Since the duration of staying green is same for the two
signals, 2 minutes prior to this, i.e. at 54 minutes, they would have had
turned green simultaneously.
Alternately
The first signal turns green after 5, 12, 19, 26, 33, 40, 47, 54, 61… minutes.
The second signal turns green after 6, 14, 22, 30, 38, 46, 54, 62, …
minutes. Thus, they turn green simultaneously after 54 minutes.
The maths part to it is that the first turns green at a number that on divided
by 7 leaves a remainder of 5 whereas the second turns green at a number
that on being divided by 8 leaves a remainder of 6. If the two numbers have
to be the same, we are searching for a number that on being divided by 7
and 8 leave a remainder of 5 and 6 respectively. Since the difference
between the divisors and the remainders is a constant 2, the least such
number is the LCM (7, 8) – 2 i.e. 56 – 2 = 54.
66. a
461 when divided by 23 leaves a remainder of 1. So whatever be the value of
n, the remainder when 461n is divided by 23 will always be 1. So remainder
of 485n divided by 23 should be either 0 or 2.
485n is not divisible by 23 so remainder cannot be 0. Hence remainder has
to be 2.
485 when divided by 23 leaves a remainder of 2. Hence 485n when divided
by 23 will leave a remainder of 2n, which when further divided by 23 should
give a remainder of 2.
For successive values of n, when 2n is divided by 23, the remainders will be
2, 4, 8, 16, 32 i.e. 9, 18, 36 i.e. 13, 26 i.e. 3, 6, 12, 24 i.e. 1
Thus 211 when divided by 23 will leave a remainder of 1. Thus the cycle of
possible remainders is of 11 distinct values and the first one of them is 2.
Thus every (11a + 1)th term in the cycle of remainders will be 2.
Thus n has to be of the form 11a + 1. The only value in the option choices
that satisfy this is 265.

67. a
792 = 8 × 9 × 11
The last three digits of the number are 849. When divided by 8, it leaves a
remainder of 1.
The sum of the digits of 1444246849 when divided by 9, will leave a
remainder of 1.
1444246849 when divided by 11 leaves a remainder of 1.
Since each of 8, 9 and 11, leave a remainder of 1, it means that when
1444246849 is of the form LCM (8, 9, 11) × a + 1 i.e. 792a + 1. So when it is
divided by 792, the remainder will be 1.

68. c
25 when divided by 15 leaves a remainder of 10 and hence 25n when divided
by 15 will leave a remainder of 10n.
For successive values of n, when 10n is divided by 15, the remainders will be
10, 100 i.e. 10, 100 i.e. 10 and so on.
Thus, for all values of n, the remainder when 10n is divided by 15 is 10.
75
Thus, 2535 when divided by 15 will also leave a remainder of 10.

69. b
Let her initially have n flowers and let her offer m flowers at each temple.
Thus, 2 2 2 2n  m   m   m   m  n  n  20 m .
4 21

For n to be a natural number, m should be atleast 21. So n = 20, m = 21

70. b
If value of m should lie between 80 and 100, m should be 84 to make n a
natural number. So she started 20  84  80 with flowers.
21

71. c
In successive division, the quotient of the earlier division is divided by the
next divisor. Thus if n is the number in the question, then
n = 8m + 5 m = 9p + 4
Substituting m in first equation, n = 72p + 37
This number when divided by 9 gives a quotient of 8b + 4 and a remainder
of 1. Dividing the quotient, (8b + 4), by 8 leaves a remainder of 4.

72. b
LCM = 540 = 22 × 33 × 5
GCD = 2 × 32
Thus if the numbers are 2a × 3b × 5c and 2x × 3y × 5z, then one of a and x
will be 1 and other will be 2; one of b and y will be 2 and other will be 3.
With just these two conditions, we would get two possibilities:
a = 1 and b = 2 OR a = 1 and b = 3 (rest conditions boil down to the same
because the order of the numbers do not matter)
Also, one of c and z has to be 0 and other has to be 1. Thus, EACH of the
earlier two conditions are further divided into two more i.e. a total of four
conditions. Thus the answer is 4 pairs of such numbers are there.
If the above does not appear convincing, all four possibilities are listed
below. See that any other possibility boils down to one of the following pairs
of numbers.
Case 1: the two numbers are 21 × 32 and 22 × 33 × 51
Case 2: the two numbers are 21 × 32 × 51 and 22 × 33
Case 3: the two numbers are 21 × 33 and 22 × 32 × 51
Case 4: the two numbers are 21 × 33 × 51 and 22 × 32

73. e
23 × 32 × 5 = 360
The number of multiples of 2 from 1 to 359 (Set A): 359/2 = 179
The number of multiples of 3 from 1 to 359 (Set B): 359/3 = 119
The number of multiples of 5 from 1 to 359 (Set C): 359/5 = 71
The number of multiples of 2 and 3 i.e. 6 from 1 to 359 (A  B ) : 359/6 = 59
The number of multiples of 3 and 5 i.e. 15 from 1 to 359 (B  C ) : 359/15 = 23
The number of multiples of 5 and 2 i.e. 10 from 1 to 359 (C  A) : 359/10 = 35
The number of multiples of 2, 3 and 5 i.e. 30 from 1 to 359 (A  B  C ) : 359/30
= 11
Using theory of sets, A  B  C  A  B  C  (A  B )  (B  C )  (C  A)  (A  B  C )

A  B  C  179 + 119 + 71 – 59 – 23 – 35 + 11 = 263

Of the 359 numbers, 263 are multiples of 2, 3 or 5, rest 359 – 263 = 96 are
prime to 360

74. c
Multiples of 2 from 1 to 100 are 100/2 = 50
Multiples of 2 and 3 i.e. multiples of 6 from 1 to 100 are 100/6 = 16
Multiples of 2 and 7 i.e. multiples of 14 from 1 to 100 are 100/14 = 7
Multiples of 2 and 3 and 7 i.e. multiples of 42 from 1 to 100 are 100/42 = 2
No of numbers divisible by 2 but not by 3 or 7 = 50 – 16 – 7 + 2 = 29
Subtracting 16 and 7 from 50 should be obvious because we do not want to
include those numbers that are divisible by 3 or by 7. While subtracting 13
and 7, we have subtracted those 2 numbers that are multiple of 3 and 7
twice as they are counted in the 13 multiples of 3 and also in the 7
multiples of 7. Thus, we need to add back 2 to correct our ‘over-subtraction’.
This will be more clear if you are aware of set theory.

75. a
S E N D
 M O R E
M O N E Y

In the solution below, columns are counted from the right end.
It should be obvious that M = 1 because that is the highest carry-forward
that can occur from fourth column to fifth column.
Analysing fourth column, since M = 1 ……
Case 1: If S = 8 and there is a carry-over of 1 from third column to fourth
column, then O = 0
Case 2: If S = 9 and there is a carry-over of 1 from third column to fourth
column, then O = 1, which is NOT possible since M = 1.
Case 3: If S = 9 and there is no carry-over from third column, then O = 0
Since S cannot be less than 8, case 1 and 3 are the only possible ones and
hence O = 0 for sure.
If O is 0, then there cannot be any carry from the third to the fourth column.
Thus only case 3 is possible. Hence S = 9 for sure.
Analysing third column knowing for sure that M = 1, O = 0, S = 9 ……
There is definitely a carry-over from second column to third column and E +
1=N
Assuming values of E (since it occurs very often), starting from highest
possible values …
If E = 8, N = 9, not possible
If E = 7, N = 8. Second column would result in R = 9 or 8, neither of which is
possible because 8 and 9 are already represented by other alphabets.
If E = 6, N = 7. Second column would result in R = 9 or 8. 9 is not possible,
so R = 8 with a carry-over of 1 from first column. Analysing first column, D +
6 should result in 10 + Y. No value of D is possible without resulting in
contradictions.
If E = 5, N = 6. Second column would result in R = 9 or 8. 9 is not possible,
so R = 8 with a carry-over of 1 from first column. Analysing first column, D +
5 should result in 10 + Y. D could be 7 since it is not used as yet and we
would get Y = 2 is possible without resulting in contradictions.
9 5 6 7
Thus, the solution:  1 0 8 5 and required answer is 1 + 0 + 6 + 5 + 2 =
1 0 6 5 2

14.
76. c
Using binomial expansion,
129131   1  130    1  131   1
131 131 130
130  ......terms having powers of 130 more than 2

= –1 + 17030 + ****00.
Thus the last two digits will be 29 and the digit in ten’s place will be 2.

77. e
Focussing only on the last two digits of successive powers of 6:
61 = 06 62 = 6 × 6 = 36 63 = 36 × 6 =
*16
64 = *16 × 6 = *96 65 = *96 × 6 = *76 66 = *76 × 6 =
*56
67 = *56 × 6 = *36.
Thus the last two digits would start repeating from here onwards. Thus the
last two digits will repeat in cycles of 5 different values viz. 36, 16, 96, 76,
56 starting from 62.
We want to find the last two digits of 62005 i.e. we want the 2004th term of
the cycle. The 2004th term will be same as the term equal to the remainder
when 2004 is divided by 5 i.e. will be equal to the 4th term of the cycle. Thus
the last two digits of 62005 is 76.

78. c
Representing the number as 2a × 3b × 5c × 7d × ……, the number of factors
of this number can be written as (a + 1) × (b + 1) × (c + 1) × (d + 1) × ……=
24.
Now, 24 can be factorised in the following ways:
(2 × 12), (3 × 8), (4 × 6), (2 × 2 × 6), (4 × 3 × 2), (2 × 2 × 2 × 3), etc.
Any of (a + 1) or (b + 1) or (c + 1), ... assuming higher values like 12 or 8 or 6
will lead to larger values for the number. Since we want the smallest
number, one actually has to just check only for the following two cases…
Case 1: Considering 24 = 3 × 2 × 2 × 2, the smallest number this leads to is
22 × 31 × 51 × 71 i.e. 420
Case 2: Considering 24 = 4 × 3 × 2, the smallest number this leads to is 23 ×
32 × 51 i.e. 360.
Thus the smallest number that has 24 factors is 360.

79. b
If n = 2a  3b  5c  7d... then x  (a  1)(b  1)(c  1)..... (i)
2n = 2a 1  3b  5c  7d... and 2x = (a + 2)(b + 1)(c + 1)… (ii)
a 2 2
(ii)  (i)  a 0
a 1 1

3n = 2a  3b 1  5c  7d... and 3
x = (a + 1)(b + 2)(c + 1)… (iii)
2

b2 3
(iii)  (i)  b 1
b 1 2

Thus, n = 20 × 31 × 5c × 7d × … and x = 2 × (c + 1) × (d + 1) × …
We need to find the factors of 12n i.e. of 22 × 32 × 5c × 7d × … i.e. we need to
find the value of 3 × 3 × (c + 1) × (d + 1) × …. i.e. 9 × 2 × (c +1) × (d + 1) × …
2
9
i.e. x.
2

80. d
Pair of co-prime factors could be of the form {1, 2a  3b }, where 2a  3b is not 1
OR of the form 2a , 3b  , where neither of 2a nor 3b is 1.

Case {1, 2a  3b }:

This is basically a pair of 1 and any factor of the number other than 1. The
number has total of 4 × 3 = 12 factors, including 1. Thus there are 11 ways
of forming the set {1, any factor other than 1}.
Case 2a , 3b  :
a varies from 1 to 3 and b from 1 to 2, so a total = 3 × 2 = 6 such pairs can
be formed. Note that here a or b cannot be 0, because that is the case when
one of the factors is 1, and is counted in the earlier case.
So total number of ways are 11 + 6 = 17 ways.

81. c
Pair of co-prime factors can be formed in the following ways:
{1, any factor other than 1}. Since the total number of factors of the number
is 4 × 3 × 4 = 48, including 1, there can be 47 such pairs.
21 or 2 or 3, 31 or 2  3  2  6 ways
21 or 2 or 3, 51 or 2 or 3  3  3  9 ways
31 or 2, 51 or 2 or 3  2  3  6 ways
21 or 2 or 3
  31 or 2  , 51 or 2 or 3  3  2  3  18 ways
21 or 2 or 3
  51 or 2 or 3  , 31 or 2  3  3  2  18 ways
 3 1 or 2
  51 or 2 or 3  ,21 or 2 or 3  2  3  3  18 ways
Thus the total number of pairing of co-prime factors is 47 + 6 + 9 + 6 + 54 =
122

82. c
To write 23  34  56  72 as a product of two co-prime numbers, none of the
factors 23, 34, 56 and 72 can be ‘split up’ and be present in the two numbers
(else they would not be co-prime). Thus, the only way of writing as a
product of two co-prime numbers are the following:
(1) × (23 × 34 × 56 × 72) (23) × (34 × 56 × 72)
(34) × (23 × 56 × 72)
(56) × (23 × 34 × 72) (72) × (23 × 34 × 56)
(23 × 34) × (56 × 72)
(23 × 56) × (34 × 72)
(23 ×72) × (34 × 56)
So there are total 8 ways.
Theoretical way:
We need to divide 2a × 3b × 5c × 7d × … into two groups. The 2a cannot be
divided while distributing the factors in the two groups as then the two
groups would no longer be co-prime. Thus the entire 2a or 3b or 5c … has to
go together in one of the groups.
Now the number of ways in which n objects can be divided into two groups
2n
is given by  2n 1 . This is because each of the n objects has two choices and
2
thus n objects would have 2n ways of being distributed. Since the groups are
not being distinguished, (a, b) is same as (b, a), each unique way of
distribution will be counted twice and thus the answer is 2n – 1.
In this example we have to distribute 4 objects viz. 23, 34, 56, 72 and thus
the answer will be 24 – 1 = 23 = 8.

83. d
The series is 1, 4, 7, 10, ……1000. We need to find the powers of 5 in the
product.
In the given series, since the difference between each consecutive term is 3,
the nth term is given by tn  3n  2 , n being a natural number from 1 to 334.
To find numbers of zeroes at the end of the product we need to focus on the
power of 5 in the product (there would be ample of 2’s). The numbers in the
series are multiples of 5 when n is 4, 9, 14, 19 ……334. These numbers are
10, 25, 40, 55, ……1000.
1000  10 990
Since they have a common difference of 15, they are 1   1  67
15 15
numbers in all.
Next finding how many of them are multiples of 25:
These are 25, 100, 175, ……, 1000
1000  25 975
Since they have a common difference of 75, they are 1   1  14
75 75
numbers in all.
Finding how many of them are multiples of 125: 250, 625, 1000 i.e. 3 terms
Finding how many of them are a multiple of 625: 625, just one.
Thus the highest power of 5 in the product is 67 + 14 + 3 + 1 = 85 and each
of these will air with a 2 and result in 85 trailing zeroes in the product.

84. a
379  1  ((373 )3  13 )  (373  1)(........)
      
3712  1  376  1 376  1  373  1 373  1 376  1 
The HCF of the two is 373  1 .

You can also find the HCF using the division method.
Divide the larger number by the smaller.
373
9 12
(37  1) 37  1

3712  373
373  1

Now divide 379  1 by 373  1 , remainder = 0. Hence HCF is 373  1 .

85. d
Find the HCF using the division method.
11111…111100 ones can be written as 1 4 4 2 4 4 3 1 44 2 4 43  1111...1111
11111...11110000....00 1 44 2 4 43
sixty 1' s forty 0 ' s forty 1' s

So when divided by 1111…11160 ones, remainder is 111..1140 ones

Similarly when 1111…11160 ones is divided by 111..1140 ones, remainder is
111….1120 ones.
When 111….1140 ones is divided by 111….1120 ones, it is completely divisible.
So 111…1120 ones is the answer.

86. a
Consider the pair of numbers as 2a × 3b and 2x × 3y.
So that the LCM is 23 × 32, one of a and x has to ‘necessarily be equal to 3’
and other has to be 3 or less. Also one of b and y has to ‘necessarily be
equal to 2’ and the other has to be 2 or less.
Consider two cases, one where the ‘necessarily being 3 and 2’ is satisfied by
one number itself (i.e. a = 3 and b = 2) and other case where one number
satisfies the ‘necessarily be equal to 3’ and other number satisfies the
‘necessarily be equal to 2’ (i.e. a = 3 and y = 2)
The pair of numbers can be now be:
Case 1: 23  32  , 20 to 3  30 to 2  . There will be 12 such pairs.
Case 2: 23  30 to 1  , 20 to 2  32  . There will be 6 such pairs.
All pairs of the two cases are distinct pairs and thus 18 pairs will be the
answer.

87. c
The LCM of {1, 2, 3, ……, 200} has to be divisible by each of the numbers
from 1 to 200 and has to be the smallest such number. Thus the LCM would
be the product of the highest power of all primes that are present in any
number from 1 to 200.
The highest power of 2 that appears in any number from 1 to 200 is in the
number 128 and is 27. Thus the LCM has to be a multiple of 27 so that it is
divisible by 128. Similarly the highest power of 3 that appears in any
number from 1 to 200 is in the number 81 and is 34.
Primes 17 or greater would have their power only 1 because 172 = 284 which
does not appear from 1 to 200. All multiples of 17 from 1 to 200 (viz. 17, 34,
51, …, 187) can be divided by 171 and we do not need 172 .
This LCM of {1, 2, 3, ……, 200} = 27 × 33 × 53 × 72 × 112 × 132 × 171 × 191 ×
all other prime appearing till 200
Now consider the set {101, 102, 103, 104, 105, ……, 200}. The LCM of this
set has to be divisible by each of these numbers. And has to be the smallest
such number. Thus again the LCM would be the product of the highest
power of all primes that are present in any number from 101 to 200. i.e.
LCM = 27 × 33 × 53 × 72 × 112 × 132 × 171 × 191 × all other prime appearing
till 200
Please note that while 81 is not present in the numbers from 101 to 200, a
multiple of 81 i.e. 162 is present and thus for a number to be divisible by
162, it has to be a multiple of 34.
The same logic goes for any other prime number. E.g. take 61 or 97 both of
which are prime. They are not present in 101 to 200, but their multiples are
present and thus the LCM has to be a product of 61 and 97.
By this logic the LCM of {101, 102, 103, 104, 105, ……, 200} would be
exactly same as that of {1, 2, 3, ……, 200}.
The set in the denominator is not {101 to 200} but is from {105, 106, ……,
200}. From 101 to 104, the only prime numbers is 101 and 103. Thus the
denominator need not be a multiple of 101 and 103. But the numerator
would be a multiple of 101 and 103. Rest all the factors of the numerator
and denominator will be the same. Thus the ratio = 101 × 103.

88. d
Since n is the LCM of {1, 2, 3, …., 120} it is divisible by each of the numbers
in the set. Thus it is the product of the highest power of all primes that are
present in any number from 1 to 120. As explained in the earlier solution, n
= 26 × 34 × 52 × 72 × 92 × 111 × 131 × 171 × all other primes till 120.
If m is the LCM of {1, 2, 3, …, 125}, it is divisible by each of the numbers
from 1 to 125.
Now, we already know that n is divisible by each number from 1 to 120. So
let’s use n as the starting point and add any factor to it, if needed, so that it
also becomes divisible by 121, 122, 123, 124 and 125.
Now, since 121 = 112, but since n is just a multiple of 11 and not of 112, we
would have to multiple n by 11 so that it becomes divisible by 121.
122 = 61 × 2. The number n is a multiple of 61 and also of 2 and hence in
the current form is divisible by 122.
The same logic also is valid from 123 and 124 because n is already a
multiple of 123 = 41 × 3 and of 124 = 31 × 4.
But the number n is not divisible by 125 = 53, as n just needed to be a
multiple of 52 so that it is divisible by all multiples of 5 from 1 to 120. Thus,
n has to be multiplied with 5, so that it becomes divisible by 125.
So 5 × 11 × n = 55n will be the LCM of 1, 2, 3, 4,…..125

89. d
Let n = 128500 = 23500.
153 can be factorised as 9 × 17
n  9 leaves a remainder of 4 and n  by 17 leaves a remainder of 16.
Thus, n is a number of the type which when divided by 9 and 17 leaves a
remainder of 4 and 16 respectively.
To find the smallest such number, start with successive multiples of 17 and
add 16 to them so that when divided by 17 would leave a remainder of 16.
Then check which of the number also satisfies the condition of leaving a
remainder of 4 when divided by 9. 16, 33, 50 do not leave a remainder of 4
when divided by 9, but 67 does leave a remainder of 4 when divided by 9.
Thus the smallest number which when divided by 9 and 17 leaving a
remainder of 4 and 16 respectively is 67 and the series of such numbers is
that LCM (9, 1) × a + 67 i.e. 153 × a + 67
Thus n is a number of the type 153 × a + 67. So when n is divided by 153,
the remainder has to be 67.

90. a
111111111
Since  12345679
9

111......1181 ones
 12345679 12345679 …..12345679set of 12345679 written 9 times
9

The number 12345679 when divided by 9 leaves a remainder of 1. Thus,

when 9 such sets are written side by side as a number, the remainder when
the number is divided by 9 will be 1 × 9 i.e. 9 i.e. 0. Thus, the above
quotient is further divisible by 9.
Thus 111…11181 ones is divisible by 9 × 9 i.e. 81 and so the required
remainder will be 0.

91. d
728 = 7 × 8 × 13
You would have to use the fact that any number formed by writing any digit
6 times, aaaaaa, is divisible by 7 and 13.
1 44 2 4 43  111.....111000
111.....111 1 44 2 4 43  111
729 ones 726 ones

111.....111000
1 44 2 4 43 is divisible by 8 because its last 3 digits are divisible by 8.
726 ones

Also since the number of 1’s is 726 (= 6 × 121, i.e. a multiple of 6),
111.....111000
1 44 2 4 43 is divisible by 7 and 13 too.
726 ones

So 111.....111000
1 44 2 4 43 is divisible by 7, 8 and 13 so it is divisible by 728.
726 ones

Remainder is 111.

92. b
101100  1  (1  100)100  1 . We need to use Binomial Theorem to expand this
1  100100  1  1  100C1 1001  100C2 1002  100C3 1003  .....higher powers of 100  1
100  99 100  99  98
 100  100   10000   1000000  ......higher powers of 100
2 2 3

= 10000 + 49500000 + numbers having far more trailing zeroes

Thus the result is a number which has exactly 4 trailing zeroes and can be
divided with 104 but not higher powers of 10.

93. d
When all squares are erased, so are all the fourth, sixth, eighth, … powers
as all of these are also perfect squares.
When all cubes are erased, so are all 6th, 9th, 12th, 15th, … powers as all
these are also perfect cubes.
In the fourth round all 4th powers are to be erased but there are no such
numbers remaining (all of them got erased in the first round itself as all of
them are also squares)
When all 5th powers are erased, all 10th, 15th, 20th, 25th, … powers also
erased as all these are also perfect 5th powers. Thus, 25, 35, … are erased in
this round.
When all 6th power have to be erased there would be no such numbers left
and no number will be erased in this round.
Thus, atleast one number being erased in a round are those rounds where
the first number to be erased is 22, 23, 25, 27, 211 and 213.
(The highest power that is there in 1 to 10,000 is 213 . It should be obvious
that the smallest number, 2, will have the highest power)
Thus the largest number to be erased is 213 and there are 6 rounds in which
atleast one number is erased.

94. & 95.

Say, initially the thief had n diamonds and at the end he had m diamonds.
3 2  1  
Thus,    n  1  2  3  m
4  3  2  

3 n  8  n  20
On solving,   m  m
4  3  4

Thus n – 20 has to be divisible by 4. Thus n could be 24, 28, 32, 36, …

Also, so that there are no fractions at any stage, n – 8 should also be
divisible by 3. Of the above values of n only 32 satisfies this condition.

94. c
Taking n = 32, the thief gives 16 + 1 = 17 to the first guard and he is left
with 15. Of this he gives 5 + 2 = 7 to the second guard and now he is left
with 8. Of this he gives 2 + 3 = 5 to the third guard and he is left with 3
diamonds. Thus the least value of m = 3. For m = 1 and 2, there would be
fractions involved at an intermediate stage.

95. d
n  20
Substituting m = 9 in m , we get n = 56.
4

96. a
Rearranging 3 5
 
1
, we have 45b – 75a = ab.
a b 15

This can be manipulated as ab + 75a – 45b – 45 × 75= –45 ×75

(a – 45) × (b + 75) = –3375
Assuming (a – 45) = m and (b + 75) = n, we have m × n = –3375
a and b could take as many different values as m and n satisfying the above
equation. Thus we need to find the number of integer solution to m × n = –
3375.
Factorising, 3375 = 33 × 53. Thus 3375 would have 4 × 4 = 16 factors and
can be written as a product of two NATURAL numbers in 8 ways. For each
of these 8 ways, the number of INTEGER solutions to m and n would be 4.
E.g. considering 3375 = 125 × 27,
m = 125, n = –27  a = 170, b = –102
m = –125, n = 27  a = –80, b = –48
m = 27, n = –125  a = 72, b = –200
m = –27, n = 125  a = 18, b = 50
(While the above listing is not necessary to solve the question, it is given
help you understand how one can find the values of a and b. You could
check that each of these values of a and b would satisfy the given equation)
Thus, there would be a total of 8 × 4 = 32 integer solutions to m × n = –3375
However, one of these solutions will be m = –45 and n = 75 which will result
in a = 0 and b = 0. Except for this combination of m and n, all others will
result in an integer solution of a and b satisfying 3  5  1 .
a b 15

Thus there are 31 integer solutions to the required equation.

97. c
Factorsing each of the given option and checking if they can be the product
of three numbers, no two of which is made of same pair of primes.
120 = 23 × 3 × 5: Since there are only three primes involved, and each
person has to think of two primes, the least power of a prime in the product
of the numbers thought by all three has to be minimum 2. Try forming three
distinct pairs using only one 3 (or one 5), it’s not possible.
144 = 24 × 32: Thus all three persons have to have thought of 2’s and 3’s
which is not possible.
12100 = 22 × 52 × 112: One may have thought of (2 × 5), second may have
thought of (2 × 11) and third may have thought of (5 × 11). So this could be
the product of the numbers thought.
3000 = 23 × 3 × 53: Since there are only three primes involved, and each
person has to think of a prime, the least power of a prime in the product of
the numbers thought by all three has to be minimum 2. Try forming three
distinct pairs using only one 3, it’s not possible.
420 = 22 × 3 × 5 × 7: Since in the product of three pairs of primes there is
only one each of 3, 5, and 7, they have to appear only one of the three pairs.
With just two 2’s one cannot form three distinct pairs of primes such the
product of the three pairs is 22 × 3 × 5 × 7.

98. c
The first hundred even numbers are 2, 4, 6, 8, 10, 12, 14, ……, 200
Looking at the unit’s digit we see that in every 5 numbers written, 2 is
written once in the unit’s place. Thus, in writing 100 numbers i.e. 20 groups
for 5 numbers, 2 will be written a total of 20 times in unit’s place.
Analysing ten’s digit, 2 will appear in 20, 22, 24, 26, 28 and similarly in
120, 122, 124, 126 and 128 i.e. a total of 10 times.
In the hundred’s position, 2 will be written only once viz. writing 200.
Thus, 2 is written a total of 30 + 10 + 1 = 31 times.

99. d
1 2  3  4  ......  199  200
1  3  5  ......  199 
2  4  ......  200

200! 200!
 
2100  1  2  3  ......  100  2100  100!

100. d
MAD and MAN would differ by a maximum of 9 (since MA is the common
first two digits of both the numbers)
Further the product of two three digit numbers (very close to each other) is a
six digit number. Thus the two numbers have to be more than 300 (3002 =
90000, a five digit number)
The unit digit of MAD and MAN cannot be 1 or 5. If any of them is 1, the
product should have ended with the other. If any one of them is 5, then unit
digit of the product M has to be 0 or 5, neither of which it can be.
Also the ten’s digit of MAD (and MAN) has to be the leading digit of the
product viz. A
Trying out few combinations …
If M = 3, the two multiplicands are in 300’s and since all squares from 300
to 399 have the leading digit 1, hence A = 1
Thus 31D × 31N = 1SYLU3. Since the unit digit is 3, D × N has to end with
3. Neither of D and N are even. Nor can any of D or N be 1, 5, or 3 (already
used). The only possible value of D and N are 9 and 7 (order not specific).
Trying 317 × 319 = 101123. This is not possible.
If M = 4, the two multiplicands are in 400’s and since squares of all
numbers from 400 to 499 have leading digit 1 or 2, hence A = 1 or 2. But
the leading digit is 2 only for squares of numbers around 450. Thus A
cannot be 2 and has to be 1
Thus, 41D × 41N = 1SYLU4. Since the unit digit is 4, D × N has to end with
4. Neither of D or N can be 1, 5, or 4 (already used). The only possible pairs
of D and N are (2, 7), (3, 8), (6, 9)
412 × 417 = 171804; 413 × 418 = 172634; 416 × 419 = 174304
None of these are possible because atleast one of S, Y, L and U has been
used earlier.
M cannot be 5 because then the product would have to end with 5 and this
means one of N and D should also be 5, which contradicts because M is
already 5.
If M = 6, the two multiplicands are in their 600’s and since all squares of
600 to 699 have leading digit 3 or 4, hence A = 3 or 4.
If A = 3, then the smallest values that MAD and MAN can assume are 632
and 634 (since 1 cannot be used in the unit’s place and nor can 3 be used
again). But 632 × 634 or higher numbers are greater than 400000 and thus
it would not satisfy A = 3.
Hence A = 4. Thus, 64D × 64N = 4SYLU6. Since the unit digit is 6, D × N has
to end with 6. Neither of D or N can be 1, 5, 4 or 6. The only possible pairs of
D and N are (2, 8), (7, 8)
642 × 648 = 416016, not possible.
647 × 648 = 419256
The last product is possible because each of S, Y, L and U are digits not
used earlier.
6 4 7
Thus, the final solution is  6 4 8
4 1 9 2 5 6

And the required answer is 4 + 1 + 9 + 2 + 5 + 6 = 27.