Number Systems

EXERCISE-2(A)

1. The number, 445 which is in decimal system 10. What is the highest power of 5, which
is equal to A to the base 6. Find A. divides 1001 × 1002 × ….. × 2010 leaving
(A) 2120 (B) 2021 (C) 1202 (D) 2012 reminder zero?
(A) 255 (B) 250 (C) 251 (D) 252
2. The number, 194 which is decimal system is
equal to 1234 to the base x. Find x. 11. Rahul receives messages from three
(A) 7 (B) 5 (C) 2 (D) 3 different persons A, B and C every 6
minutes, 8 minutes and 12 minutes
3. If 554 to the base b is the square of the respectively. If he receives all the three
number 24 to the base b then b is____. messages at 10:30a.m, then which of the
(A) 8 (B) 9 (C) 10 (D) 12 following is the time at which he receives all
the three messages?
4. The base three representation of A is (A) 12:30p.m (B) 1:02p.m
12112211122211112222. Find the first digit (C) 12:10p.m (D) 1:20p.m
(from the left) of the base nine
representation of A. 12. A monkey, while climbing a staircase
(A) 4 (B) 5 (C) 6 (D) 7 consisting of 21 steps, slips one step after
climbing every 3 steps. If he takes one
5. The number nearest to 16438, that is exactly second to climb one step and one second to
divisible by 11 as well as 7 is slip one step, how many seconds will he
(A) 16435 (B) 16483 (C) 16401 (D) 16430 take to reach the 21st step of the staircase?
(A) 40 (B) 42 (C) 44 (D) None
6. If 45376p is divisible by 3,then the least
value of P is 13. Find the smallest prime number dividing the
(A) 3 (B) 2 (C) 4 (D) 7 sum 311 + 513.
(A) 2 (B) 3 (C) 5 (D) 311+513
7. Find the number of positive integers which
divide 2010 and leave a remainder of 10. 14. What is the remainder when
3 3 3 3
(A) 20 (B) 22 (C) 24 (D) 18 16 +17 +18 +19 is divided by 70?
(A) 0 (B) 69 (C) 34 (D) 42
8. A number when divided by 162 leaves the
remainder 21. If the same number is divided 15. Find the number of odd factors of the
by 18, then the remainder is number 4312.
(A) 2 (B) 3 (C) 8 (D) 21 (A) 4 (B) 8 (C) 6 (D) 5

9. If N = 1529 × 1531 × 1533 then what is the 16. If a, b and c are distinct odd positive
remainder when N is divided by 13? integers, then which of the following cannot
(A) 7 (B) 9 be true?
(C) 11 (D) None of these

 ICP–Intensive Classroom Program  eGATE-Live Internet Based Classes DLP  TarGATE-All India Test Series
 Leaders in GATE + ESE Preparation across India
© All rights reserved by Thinkcell Learning Solutions Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.

27
 Numerical Ability

(A) (a-b)2c is even 18. Find the highest power of 3 in 100!.

(B) abc2 is odd (A) 45 (B) 50 (C) 48 (D) 52
(C) (a+b-c)2(a+b) is even
(D) (a-b)(b+c)(a+b-c) is odd 19. Find the units digit in the expansion of
1!+2!+3!+………+2010!
17. An integer greater than 1, when divided by (A) 1 (B) 2 (C) 3 (D) 4
an integer say k, (2<k<11) leaves a
remainder 1. Find the difference of such two 20. The sum of two numbers is 528 and their
least integers. HCF is 33. How many such pairs of
(A) 25000 (B) 23200 numbers are possible?
(C) 25540 (D) 27720 (A) 2 (B) 3 (C) 4 (D) 5



 ICP–Intensive Classroom Program  eGATE-Live Internet Based Classes DLP  TarGATE-All India Test Series
 Leaders in GATE + ESE Preparation across India
© All rights reserved by Thinkcell Learning Solutions Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.

28
 Number Systems

ANSWER KEYS

1 B 2 B 3 D 4 B 5 C 6 B 7 A

8 B 9 C 10 D 11 A 12 D 13 A 14 A

15 C 16 D 17 D 18 C 19 C 20 C

EXPLANATIONS

1. 6 445  77 16438  213

6 74  1 154
6 12  2 103
20 77
44510  2021 6 268
231
2. Going by options,
37
5194
Remainder  37
5 38  4
 The number = 16438 – 37 = 16401
5 73
1 2 6. For a number to be divisible by 3, sum of all
the digits should be divisible by 3.
So 19410  12345
i.e., 4  5  3  7  6  p  25  p is divisible
by 3
3. (24b)2 = (2b+4)2 =4b2+16b+16  2 is the least possible value of P.
554b=5b2+5b+4
Given, 4b2+16b+16=5b2+5b+4 7. Let the divisor be x and the quotient be y
 b2 –11b–12=0 According to division algorithm, we have
 (b+1)(b-12)=0  b=-1, 12 Dividend = Divisor × Quotient + Reminder
Hence, b=12.(  b > 1)  2010 = xy + 10  xy = 2000
x should be the factor of 2000
4. Given, A=(12112211122211112222)3 2000 = 24 × 53
 A=(1.319+2.318)+(1.317+1.316)+………+ The number of factors of 2000 =
(2.31+2.30) (4+1) (3+1) = 5 × 4 = 20.
=(1.3+2)(32)9+(1.3+1)(32)8 Hence, the required number of positive
Hence, the required first digit of A is integers is 20.
1.3+2 i.e., 5.
8. Let thenumber be n  162  q   21
5. A number that is exactly divisible by both
 18  9  q  18  3  18  9q  1  3
11 and 7 is also divisible by 77.
So the required remainder  3

 ICP–Intensive Classroom Program  eGATE-Live Internet Based Classes DLP  TarGATE-All India Test Series
 Leaders in GATE + ESE Preparation across India
© All rights reserved by Thinkcell Learning Solutions Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.

29
 Numerical Ability

9. We know that 1521 is divisible by 13  16 19  162  16 19   192 

Now, 1529 × 1531 × 1533 = (1521+8)
(1521+10) (1521 + 12)  17  18 172  17 18  182 
Now the required remainder is the reminder = 35 [odd number] + 35[odd number]
obtained, when 8 × 10 × 12 i.e.,960 is =35 [odd number + odd number]
divided by 13. = 35 (even number)
The remainder obtained when 960 divided  The given expression is a multiple of 70
by 13 is 11. Hence the required remainder is zero

2010! 15. Given number is 4312= 23 × 72 × 111

10. 1001  1002  ...............  2010 =
1000! Number of odd factors = (2+1) (1+1) = 6
Exponent of 5 in 2010!=402+80+16+3=501;
Exponent of 5 in 1000!=200+40+8+1=249 16. From choice (A)
Hence the required exponent is 501- (a - b)2c = (odd -odd)2 × odd= (even) (odd) =
249=252 even
Choice (B)
11. LCM of 6, 8, and 12 is 24 abc2= odd × odd × (odd)2= odd
 Rahul receives all the three messages for Choice (C)
every 24 minutes (a+b-c)2 (a+b)= (odd + odd-odd)2
(odd + odd)
Clearly, choice (A) is the correct time. 2
= (even - odd) (even)= even
12. The net movement of the monkey = 2 steps Choice (D)
(a-b) (b+c) (a+b-c) = (odd - odd)
in 4 seconds ie 1 step for every 2 seconds. In
our bid to solve questions quickly, we may (odd + odd) (odd+odd-odd)
= even × even × odd= even
tend to directly multiply 21 steps by 2
 choice (D) is false
seconds and arrive at 42 seconds. But
consider this - after the monkey reaches the
18th step, he has to climb another 3 steps to 17. An integer (say A) when divided by
reach 21 which he will do in the next 3 an integer say k  2  k  11 leaves a
seconds (the fact that he slips another step remainder 1. Since it when divided by
after reaching the 21st is of no concern to any such integer k between 2 and 11
us). Therefore total time taken by the will give the remainder 1.
monkey is 18 × 2 + 3 = 39 seconds.
Hence it must be of the form
13. We know that, both 311 and 513 are odd.  nL  1 , where „n‟ is some natural
Therefore, 311 + 513 is an even number. number and L is the L.C.M of integers
Hence, the least prime number which 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 i.e.,
divides 311 + 513, is 2. L = 27720.
Now the least difference between
14. Given expression is 163 + 173 + 183 + 193=
any two integers of the form  nL  1
16 3 3
 
 19  17  18 3 3
 will be L = 27720.

 ICP–Intensive Classroom Program  eGATE-Live Internet Based Classes DLP  TarGATE-All India Test Series
 Leaders in GATE + ESE Preparation across India
© All rights reserved by Thinkcell Learning Solutions Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.

30
 Number Systems

18. Let p = 3, n = 100 19. Given 1! + 2! + 3!+-----+2010!From 5!

The required highest power of 3 in 100! onwards, the unit‟s digit in all the terms are
zeroes.
n  n   n   n 
=   2  3 4   The units digit of the required expression
p p  p  p  is the units digit of
100  100  100  100   100  1! + 2! + 3! + 4! = 1 + 2 + 6 + 24 = 33 i.e., 3
=        ...
 3   9   27   81   243 
20. Given that the HCF of the numbers = 33
 1   1   19   19   100 
= 33   11   3   1      ... Let the numbers be 33x and 33y, where x
 3   9   27   81   243  and y are co-primes.
= 33 + 11 + 3 + 1 + 0 + 0 + = 48 Given 33x+33y=528  x+y=16.
The possible pairs (x, y)
are (1, 15), (3, 13), (5, 11), (7,9).
Hence, the required number of pairs is 4.



 ICP–Intensive Classroom Program  eGATE-Live Internet Based Classes DLP  TarGATE-All India Test Series
 Leaders in GATE + ESE Preparation across India
© All rights reserved by Thinkcell Learning Solutions Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.

31