1

IOQM 2025
Number Theory (Part-03) DPP-05

1. A standard six-sided die is rolled, and P is the 6. Let N = 1234567891011124344 be the 79

product of the five numbers that are visible. What digit number that is formed by writing the
is the largest number that is certain to divide P? integers from 1 to 44 in order, one after the other.
What is the remainder when N is divided by 45?
2. Find the remainder obtained, when the number

1010 + 10
(10 ) + .......... + 10(10 ) is divided by 7.
2 10
7. Find the sum of digits of the largest positive
integer n such that n! ends with exactly 100 zeros.

n
3. For how many integers n is the square of 8. Find the remainder when 128129 is divided by 17
20 − n
an integer ?
9. The product (8) (888....8), where the second

4. If k is the smallest positive integer such that factor has k digits, is an integer whose digits have
a sum of 1000. What is sum of digits of k?
962 + k is divisible by 242. Then find k − 100

5. For each integer n  2 , let Sn be the sum of all 10. Suppose that 4a = 5,5b = 6,6c = 7 , and 7d = 8 .

products jk, where j and k are integers and What is 2  a  b  c  d ?

1  j  k  n .Let P is the sum of the 10 least

values of n such that Sn is divisible by 3 then find
sum of digits of P
 2

Answer Key
DPP-05
1. (12) n  0 ( mod3) and n  2 ( mod3) , then we have
P can take values
n(n + 1)2
P = 243251 , 233251 , 223251, 2432 , 233151  0 ( mod3) . However, for n  1( mod3) ,
2
gcd = 2231 = 12 we have 1 2  2 ( mod3) Clearly, S2  2 ( mod3) .
2

2
2. (05) Using the above result, we have S5  1( mod3) ,
By Fermat's theorem 106  1 mod 7 and S0 ,S0 and S10 are all divisible by 3, After
Hence, 106m  1 mod 7 for all m. 3,3 = 9 , we have S17 ,S15 and S19 all divisible by
Now 10  4 mod 6, 102  40  4 mod 6
3 , as well as S26 ,S27 ,S28 , and S35 . Thus, our
By induction 10n  4 mod 6 for all n.
answer is
Thus, 10n = 6m + 4
8 + 9 + 10 + 17 + 18 + 19 + 26 + 27 + 28 + 35
and 10(10n) = 106m. 104  104 mod 7 = 4 mod (7)
= 27 + 54 + 81 + 35 = 162 + 35 = 197.
consequently 1010 + 10
(10 ) + ............ + 10(10 )
2 10

4 × 10 mod 7  5 mod 7 6. (09)

The remainder is 5 We only need to find the remainders of N when
divided by 5 and 9 to determine the answer. By
3. (04) inspection, N  4 (mod 5). The remainder when
n N is divided by 9 is 1 + 2 + 3 + 4 +
Let x2 = , with x  0
20 − n + 1 + 0 + 1 + 1 + 1 + 2 + + 4 + 3 + 4 + 4 , but
since 10  1 (nod 9 ), we can also write this as
20 x 2
Then rewriting, n = 2 , 44  45
x +1 1 + 2 + 3 + + 10 + 11 + 12 + 43 + 44 =
2
(
since gcd x2 , x 2 + 1 = 1 ) = 22  45 , which has a remainder of 0 mod 9 .
it follows that x2 + 1 divides 20, listing the factors Solving these modular congruence using the
of 20 we find x=0,1,2,3 are the only, so n = 0, 10, Chinese Remainder Theorem we get the
16, 18 are 4n solutions . remainder to be 9 ( mod45) .

4. (61) 7. (13)
3  1( mod242)
5
If n ! ends with exactly 100 zeros, then in the

( )  (1) ( mod242)  1( mod242)

m prime factorization of n !, the prime factor 5
 35 m = 35 m
ocars exactly 100 times (we need not worry about
( 3 ) ( 3 )  3 mod ( 242 ) 9  81mod ( 242)
5 24 4 4 62 the prime factor 2 since it will occur more than
100 times). The number of times that 5 occurs in
Therefore, the minimum value of k is equal to
n n 
242 − 81 = 161 n! is given by + 2 + 3 + , where +,
5 5 5
represents the greatest integer function.
5. (197)
100 100
To get from Sn to Sn +1 we add Let, n = 100 , then we have, + 2 [Because
5 5
1( n + 1) + 2 ( n + 1) + + n ( n + 1) the higher power of 5 are greater then 100,
n(n + 1)2 so = 0] = 20 + 4 = 24 Thus, the factor 5 occurs 24
= (1 + 2 + + n )( n + 1) =
Now, we can
times in 100!.
2
look at the different values of n mod3 , for Hence, the value of n is more than 100.
 3

Let, n = 300 , then we have 8.8 = 64

300 300 300 8.88= 704
+ 2 + = 60 + 12 + 2 = 74. Thus, the
5 5 5 8.888= 7104
factor 5 occur 74 times in 300! So, let n = 400 , 8. 8888= 71104
400 400 400 8. 88888= 711104
then we have, + 2 + 3 By now it's clear that the numbers will be in the
5 5 5
= 80 + 16 + 3 = 99 .It follows that 400! ends with form 7, k –21's' and 04. We want to make the
numbers sum of 1000, so 7 + 4 (k –2) = 1000.
exactly 99 zeros. The next 5 appears in 405 and
Solving, we get
the next in 410. Therefore, all the numbers 405 to
k = 991, meaning the answer is (991). Another
410 have 100 zeros, in their factorial. Thus the
way to proceed is that we know the difference
largest such number is 409.So, sum of the digits
between the sum of the digits of each product and
of the number is 4 + 0 + 9 = 13.
k always 9, so just do 1000 – 9 = 991

8. (09) 10. (03)

The correct answer is (9) 8 = 7d
Since the number 128 is not divisible by the prime
( )
d
8 = 6c
17, so we get 128  1(mod 17)(1)
16

by Fermat's Little Theorem. By the division

algorithm 129 = 16 × 8 + 1
(( ) )
8 = 5b
c d

8 =  (( 4 ) ) 
Since 128129 = 128(16×8+1) = (1288)16 × 128! Then c d
 a b 
128129  18 128  9(mod 17) [using (1)]  
Hence, 9 is the answer.
8 = 4abcd
23 = 22abcd
9. (19)
3 = 2a bcd
We can list the first few numbers in the form
3
(8,....8) (Hard problem to do without the a bcd =
multiplication, but you can see the pattern early 2
on)

PW Web/App
Library
Telegram
YouTube