Numbers - 3

Topics Covered
 Cyclicity QA
 Remainders CEX-Q-0219/23

Number of questions : 33

1. What is the units digit of 1781 + 2781 + 3781 + 9. A certain number, when divided by 899, leaves
… + 9781? a remainder 64. Find the remainder when the
(1) 5 (2) 3 (3) 1 same number is divided by 29. (CAT)
(1) 6 (2) 5
(4) 7 (5) 8
(3) 1 (4) Cannot be determined
2. Find the last two digits of the number N,
10. Two numbers, x and y, are such that when
where N = 20025 × 20026 × 200027 × divided by 6, they leave remainders 4 and 5
200035. respectively. Find the remainder when
(1) 80 (2) 70 (3) 60 (x2 + y2) is divided by 6.
(4) 50 (5) None of these (1) 2 (2) 3 (3) 4
(4) 5 (5) None of these
3. What are the last two digits of 7(4004)? (CAT)
(1) 21 (2) 61 (3) 01 11. The remainder, when (4523 + 5023) is divided
(4) 41 (5) 81 by 19, is (CAT)

4. Find the last two digits of the number 12. What is the remainder when (143 + 153 + 163
+ 173) is divided by 62? (CAT)
N = 29933.
(1) 0 (2) 1
(1) 01 (2) 81 (3) 89 (3) 32 (4) 59
(4) 91 (5) 99
13. 76n – 66n, where n is an integer greater than 0,
5. Find the last two digits of 2684. is not divisible by (CAT)
(1) 13 (2) 81
6. Find the last two digits of the number 4789. (3) 127 (4) 559
(1) 27 (2) 47 (3) 67
(4) 87 (5) 07 14. 66n – 56n, where ‘n’ is an integer greater than
0, is divisible by
7. If N = 1! + 2! + 3! + … + 100!, find the last two (1) 11 (2) 91
(3) 341 (4) Both (1) and (2)
digits of N.
(5) (1), (2) and (3)
8. Find the digit at unit’s place of
15. What is the remainder when
11! + 22! + 33! + 44! + … + 8080!. (7413 – 4113 + 7513 – 4213) is divided by 66?
(1) 0 (2) 9 (1) 2 (2) 64 (3) 1
(3) 5 (4) 8 (4) 65 (5) 0

Numbers - 3 Page 1
16. The remainder when 42001 is divided by 6 is? 25. What is the remainder when n! + (n! + 1) +
(CAT) (n! – 2) + (n! + 3) + … + (n! – 2006) is divided
by 1003 for n = 1003?
17. What is the remainder when 650 is divided by (1) 1 (2) 0
215? (3) 2006 (4) None of these
(1) 1 (2) 36 (3) 5
(4) 214 (5) 210 26. What is the remainder when 39! is divided by
41?
18. N = 1010 + 10100 + 101000 + … + 1010000000.
What is the remainder when N is divided by 7? 27. Find the remainder when 123412341234...
(1) 6 (2) 5 (written 1234 times) is divided by 13?
(3) 4 (4) 0
28. W hat is the remainder when
19. What is the remainder when (683 + 883) is 112123123412345….. up to 36 digits is
divided by 49? divided by 36?
(1) 0 (2) 14 (1) 30 (2) 20
(3) 35 (4) 42 (3) 10 (4) None of These

20. What is the remainder when 531111 is divided 29. If 4 is written 4444 times side by side, we
by 51? shall get a large number of 4444 digits. What
(1) 25 (2) 9 (3) 42 is the remainder when 7 divides this large
(4) 26 (5) None of these number?
(1) 1 (2) 4
21. What is the remainder when 3040 is divided (3) 2 (4) 6
by 17?
(1) 1 (2) 16 30. A = 33333….. (33 times). W hat is the
(3) 13 (4) 4 remainder when A is divided by 19?

22. What is the remainder when (82361 + 83361 31. P is a natural number and Q = 2P. What is
+ 84361 + 85361 + 86361) is divided by 7? the remainder when Q! is divided by 2Q?
(1) 0 (2) 2 (1) 2Q – 1 (2) 2Q – 1
(3) 5 (4) 1 (3) 2Q – 1–1 (4) None Of these

23. N = (5p + 1)(5q + 1)(5r + 1) and M = (5p – 1) 32. If N = 192837465564738291, then find the
(5 q + 1)(5 r + 1), where p, q and r are remainder when (N + 1)(N + 2)… (N + 7) is
consecutive natural numbers. What is the divided by 11.
remainder when (N × M) is divided by 6? (1) 7 (2) 5
(1) 0 (2) 1 (3) 5 (3) 2 (4) 9
(4) 4 (5) 2 (5) 10

24. Let n! = 1 × 2 × 3 × … × n for integer n  1. 33. The sum of the digits of a number A is 13.
If p = 1! + (2 × 2!) + (3 × 3!) + … + (10 × 10!), What is the remainder when A4 is divided
then p + 2 when divided by 11! leaves a by 3?
remainder of (CAT) (1) 1 (2) 2
(1) 10 (2) 0 (3) 0 (4) Either (1) or (2)
(3) 7 (4) 1 (5) None of these

Visit “Test Gym” for taking Topic Tests / Section Tests on a regular basis.

Page 2 Numbers - 3
 QA : Solutions CEX-Q-0219/23
Numbers - 3

1 1 2 4 3 3 4 5 5 76 6 3 7 13 8 1 9 1 10 4
11 0 12 1 13 2 14 5 15 5 16 4 17 2 18 4 19 3 20 4
21 1 22 1 23 1 24 4 25 2 26 1 27 12 28 1 29 4 30 3
31 2 32 3 33 1

1. 1 LCM of cyclicities of 1, 2, 3, … 9 is 4. 6. 3 472 = 2209.

 If A is a single digit, then last digit of A4n+1 will be A Therefore, the last two digits of 47  4788 will be the
only.
Therefore, last digits are 1, 2, 3, 4 … 9 respectively. same as the last two digits of 47  (09) 44 . Applying
Hence, last digit of the sum is 5.
the same logic the last two digits of 47  (09) 44 will be

2. 4 N = 200025 × 200026 × 200027 × 200035 the same as the last two digits of 47  (81)22 . And this
N 200025  200026  200027  200035 will be the same as the last two digits of 47  (61)11

100 100
[Since 812 = 6561].

40005 10013  200027  40007 47  (61)11  47  61  (61)10


2
Similarly, the last two digits of 47  61 (61)10 will be
[Canceling a common factor of 50 from the numerator
and the denominator] the same as the last two digits of 47  61 (21)5
40005 × 40013 × 200027 × 40007 is an odd number, [since 612 = 3721]
so when 40005 × 40013 × 200027 × 40007 is divided Property: If the unit’s digit of two numbers is 1, then
by 2, the remainder is 1. the tens digit of the product of those two numbers is
equal to the unit’s digit of the sum of those two
Since, we have canceled a common factor of 50, the
numbers. For example, take two numbers to be 31
actual remainder is 50 × 1 = 50. and 51. The product of 31 and 51 is 1581 and the tens
Therefore, the last two digits of the number N digit of the product is 8 which is equal to 3 + 5.
= 200025 × 200026 × 200027 × 200035 is 50.
Therefore, the last two digits of 47  61 (21)5 will be
3. 3 The last two digits of any number in the form of 74n the same as the last two digits of 47  61  21 (21)4 .
will always be equal to 01.
For example: 74 = 2401 and 78 = 5764801. The last two digits of 47  61  21 (21)4 will be the

4. 5 The last two digits of any number is the remainder same as the last two digits of 47  61  21 (41)2
when the number is divided by 100. [since 212 = 441].
Now, the last two digits of 61 × 21 will be 81 [As
29933 = (300 – 1)33.
explained in the property].
So, the remainder when 29933 is divided by 100 is – 1.
So, the last two digits of 47 × 61 × 21 × (41)2 will be
Actual remainder is 100 – 1 = 99. the same as the last two digits of 47 × 81 × (41) 2
= 47 × 81 × 1681.
5. 76 The last two digits of powers of 26 are 261 = 26, Now, the last two digits of 47 × 81 × 1681 will be the
262 = 76, 263 = 76, 264 = 76. Hence it is always 76. same as the last two digits of 47 × 61, which is equal
to 67.
So answer 76.

Numbers - 3 Page 1
7. 13 The last two digts of all factorial above 9! are always  4523 + 5023 = 38x + 57y + 723 + (–7)23 = 38x + 57y
00 so we just need to find the last two digits up to 9!. Here, 38 and 57 both are divisible by 19.
The answer is the last two digits of (1 + 2 + 6 + 24 + So, remainder = 0.
120 + 720 + 5040 + 40320 + 362880) = 13.
12. 1 x = 143 + 153 + 163 + 173 is an even number.
8. 1 Unit place of 11! = 1 Therefore, 2 divides x.
Unit place of 22! = 4 a3 + b3 = (a + b)(a2 – ab + b2)
Unit place of 33! = 9  (a + b) always divides a3 + b3
Unit place of 44! = 6  143 + 1713 is divisible by 31
Unit place of 55! = 5 153 + 163 is divisible by 31
Unit place of 66! = 6 Thus x is divisible by 62
Unit place of 77! = 1 Hence, option (1) is the correct choice.
Unit place of 88! = 6
Unit place of 99! = 1 13. 2 76n – 66n
Unit place of 1010! = 0 Putting n = 1
Unit place of 1111! = 1 76 – 66 = (73 – 63)(73 + 63)
Unit place of 1212! = 6 This is multiple of 73 – 63 = 127 and 73 + 63 = 559 and
Unit place of 1313! = 1 7 + 6 = 13.
Unit place of 1414! = 6 Hence, 76n – 66n is divisible by all of above except 81.
Unit place of 1515! = 5
Unit place of 1616! = 6
14. 5 an – bn (n > 0 and integer) is always divisible by
Unit place of 1717! = 1
(a – b).
Unit place of 1818! = 6
 66n – 56n = (62)3n – (52)3n = 363n – 253n
Unit place of 1919! = 1
 This is divisible by (36 – 25) = 11 1
Unit place of 2020! = 0
Similarly, 66n – 56n = (63)2n – (53)2n = 2162n – 1252n
After this every power from 21! to 80! is a multiple of 4.
So the unit digit will remain same.  This is divisible by (216 – 125) = 91 and
Unit digit from 11! to 1010! (216 + 125) = 341.
=1+4+9+6+5+6+1+6+1+0=9 341 is divisible by 11, 91 and 341.
Unit digit from 1111! to 8080! Hence, option (5) is the correct choice.
= (1 + 6 + 1 + 6 + 5 + 6 + 1 + 6 + 1 + 0) × 7 = 1
 Unit digit from 11! to 8080! = 9 + 1 = 0. 15. 5 Any number in the form of an – bn is always divisible
by (a – b).
9. 1 Since 899 is divisible by 29, you can directly divide Therefore, (7413 – 4113) and (7513 – 4213) is divisible by
the remainder of 64 by 29, so 64 /29 will give 6 as a 33.
remainder, so option (1) is the answer. (7413 – 4113) is odd and (7513 – 4213) is also odd.
So, (7413 – 4113 + 7513 – 4213) is even and hence divisible
10. 4 Suppose x = 6k1 + 4 and y = 6k2 + 5 by 2.
x2 + y2 = (6k1 + 4)2 + (6k2 + 5)2 And we also know that (7413 – 4113 + 7513 – 4213) is
= 36k12 + 48k1 + 16 + 36k22 + 60k2 + 25 divisible by 33.
= 36k12 + 48k1 + 36k22 + 60k2 + 41 Therefore, (7413 – 4113 + 7513 – 4213) is also divisible by
Obviously, when this is divided by 6, the remainder 66. Hence, the remainder is zero.
will be 5.

Short cut: 42001

16. 4 To find the remainder when , let us use the
6
r11  r2 2 will also give the same remainder when divided
basic property of dividing the power of 4 by 6, i.e.,
by 6 (where ‘r 1’ and ‘r2’ are the remainders when ‘x’
and ‘y’ are divided by 6 respectively). 41 42 43 44
 4,  4,  4, 4
6 6 6 6
42  52 41
  will give 5 as a remainder.. Hence, any power of 4 when divided by 6 leaves a
6 6
remainder 4.

11. 0 4523 = (38 + 7)23 = 38x + (7) 23, where x is a natural 17. 2 650 = (63)16 × 62 = (216)16 × 36 = (215 + 1)16 × 36
number. When this is divided by 215, remainder will be
5023 = (57 – 7)23 = 57y + (–7)23, where y is a natural (1)16 × 36 = 36.
number

Page 2 Numbers - 3
 So, 531111 can be written as 17m + 9, where ‘m’ is a
 1010  10100  101000    1010000000 
18. 4 Rem   natural number.
 7  Therefore, 17m + 9 = 3k + 2
Or, 17m = 3k – 7, therefore we can conclude that
 310  3100    310000000  (m – 1) is a multiple of 3.
 Rem   531111 = 17m + 9 = 17(3y + 1) + 9, where ‘y’ is a natural
 7  number.
531111 = 51y + 26.
 3  39  3  999    3  3999999 
 Re m   Therefore, the remainder when 531111 is divided by 51
 7  is 26.

 (3)  (3)    7 times  21. 1 3040 = (34 – 4)40

 Rem   = 0
 7  When this is divided by 17 remainder will be 440, which
has to be again divided by 17 as remainder must be
 33K  less than divisor
 Rem  1 when K is odd number  . (4)40 = (42)20 = (16)20 = (17 – 1)20.
 7 
When this is divided by 17 remainder will be 1.

19. 3 683 = (7 – 1)83 22. 1 82361 + 83361 + 84361 + 85361 + 86361

 783  83
C1782  83
C2 781    83
C8172  83
C82 7  1 = [(84 – 2)361 + (84 – 1)361 + 84361 + (84 + 1)361
+ (84 + 2)361]
…(i)
Since 84 is a multiple of 7, the remainder when divided
883 = (7 + 1)83
by 7 will be (– 2)361 + (– 1)361 + 1361 + 2361 = 0.
= 783  83
C1782    83
C82 7  1 …(ii) Hence, the remainder is zero.
On adding (i) and (ii), we get
23. 1 N × M = (52p – 1) (5q + 1)2 (5r + 1)2
683  883  2  783  2  83
C2  781    2  83 C 82  7 = (52p – 1) (52q + 1 + 2.5q) (52r + 1 + 2.5r)
All the terms except the last one is divisible by 49 (52p – 1) when divided by 6 will yield a remainder of ‘0’.
 883  683   (N × M) when divided by 6, gives the remainder 0.
 Rem  
 49  24. 4 If p = 1! = 1, then
p + 2 = 3 when divided by 2! will give a remainder of 1.
 2 83 C  7  If p = 1! + 2 × 2! = 5, then
82
= Rem  49

p + 2 = 7 when divided by 3! will give a remainder of 1.
 
Hence, p = 1! + (2 × 2!) + (3 × 3!) + … + (10 × 10!) when
 2  83  7  divided by 11! leaves a remainder 1.
= Rem    35.
 49 
Alternative method:
P = 1 + 2.2! + 3.3! + … + 10.10!
20. 4 51 = 3 × 17.
= (2 –1)1! + ( 3 – 1)2! + (4 – 1)3! + … + (11 – 1)10!
Let us first find the remainder when 531111 is divided by
3. = 2! – 1! + 3! – 2! + … + 11! –10! = 1 + 11!
531111 = (54 – 1)1111. So the remainder when 531111 is Hence, the remainder is 1.
divided by 3 is when (– 1)1111 is divided by 3.
Therefore, the remainder is 2. 25. 2 Given expression is
So, 531111 can be written as 3k + 2, where ‘k’ is a n! + (n! + 1) + (n! – 2) + (n! + 3) + … + (n! – 2006)
natural number. = 2007 × n! + (1 – 2 + 3 – 4 … – 2006)
Let us now find the remainder when 531111 is divided = 2007 n! + 1003 × (–1)
by 17. Now, for n = 1003, the expression 2007 n! – 1003 is
531111 = (51 + 2)1111. So the remainder is when 21111 is clearly divisible by 1003.
divided by 17. Hence, the remainder is zero. Option (2) is the correct
 3 4 277  choice.
21111 
23.21108 
2 . 2

  
 
8. 17  1
277

  26. 1 (p – 2)! divided by p gives a remainder of 1 if p is prime.
17 17 17 17
Hence, the answer is 1.
Therefore, the remainder is 9.

Numbers - 3 Page 3
27. 12 Using the rule of 13, making pairs of 3 digits from the 29. 4 Any digit repeated 6 times will be divisible by 7 using
end, we get divisibility rule of 7. Hence, 4440 times 4’s will be
divisible by 7. Only 4 times 4 is remaining now. When
1234123
   4..........1234123
  412341234
 4444 is divided by 7, the remainder obtained is 6.
       

Here we see, while making pairs from the end, 1234 is 30. 3 Any digit repeated 18 times will be divisible by 19 and
used 3 times to make first 4 pairs after which the hence repeated 36 times will be divisible 19. So 33333
same pattern repeats. The resultant of these 3 pairs is … (36 times) will be divisible by 19.

1234 31. 2 If Q = 2P, then the highest power of 2 in Q! is Q – 1.

646 – 464 = 182. We will get this  411 times
3  Q! = (2K + 1) × 2Q –1
but 1 pair will be remaining. That one pair will be dealt  Q! 
separately as shown above.  Rem  Q 
2 
Hence, the final resultant is 182 × 411 + 234 – 1
= 75035. W hen 75035 is divided by 13 gives a (2K  1)2Q 1  2K  1 
remainder of 12.  Re m  2Q 1  Re m  Q 1
2 .
2Q  2 
28. 1 The number is a series of 1 natural number, 2 natural
numbers, 3 natural numbers and so on. Hence to get 32. 3 Sum of the digits at the even places of the number N is
equal to 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 45.
36 digits we need to find n for which 1 + 2 + 3 + … +
Sum of the digits at the odd places of the number N is
n  36. For n = 8, the sum is exactly 36 which means equal to 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45.
the number will have 12345678 at the end. Difference = 45 – 45 = 0.
To divide by 36, we need to divide the number by 4 Therefore, the number N is divisible by 11.
and 9. Hence, the remainder when (N + 1)(N + 2)…
The rule of 4 is to divide the last 2 digits of the number (N + 6)(N + 7) is divided by 11 is the remainder when
i.e. 78. 78 divided by 4 gives a remainder of 2. 1 × 2 × 3 × 4 × 5 × 6 × 7 is divided by 11, i.e., 2.
The rule of 9 is to divide the sum of the digits by 9. The
sum of digits is 1 × 8 + 2 × 7 + 3 × 6 + 4 × 5 + 5 × 4 + 6 33. 1 To find the remainder when a number N is divided by
3, we need to find the remainder when the sum of the
× 3 + 7 × 2 + 8 × 1 = 120 which divided by 9 gives a
digits of N is divided by 3. Since the sum of the digits of
remainder of 3.
A is 13, the number A when divided by 3 leaves a
Hence, the remainder by 36 is the smallest number remainder of 1.
which when divided by 4 and 9 leaves remainders of Hence, A4 = (3x + 1)4 leaves a remainder 1 when
2 and 3 respectively i.e., 30. Hence answer 30. divided by 3.

Page 4 Numbers - 3