1

ASSIGNMENT

LEVEL - A
1. Determine if there is a natural number k such that the sum of the two numbers
3k 2 + 3k − 4 and 7k 2 − 3k + 1 is a perfect square.
2. Prove that the equation a2 + b2 – 8c = 6 has no integer solution
3. Three prime numbers p, q, and r, all greater than 3, form an arithmetic progression: p, q = p + d, and
r = p + 2d. Prove that d is divisible by 6.
4. Prove that the number 100…00500..001 (100 zeros in each group) is not a perfect cube.
5. Prove that the number 6n3 + 3 cannot be a perfect sixth power of an integer for any natural number n.
6. (a) If it is known that a + 1 is divisible by 3, prove that 4 +7a is also divisible by 3.
b) It is known that 2 + a and 35 – b are divisible by 11. Prove that a + b is also divisible by 11
14
7. Find the last two digits of 1414
8. (SSSMO(J)/2001) Write down the last four digits of the number 7128
9. Prove that 103n+1 cannot be represented as a sum of the cubes of two integers.
10. A three digit number was decreased by the sum of its digits. Then the same operation was carried out
with the resulting number, et cetera, 100 times in all. Prove that the final number is zero

LEVEL - B
4444
11. Let A be the sum of the digits of 4444 , and B the sum of the digits of A. Find the sum of the
digits of B
(i) Find the remainder of ( 25733 + 46 )
26
12. when it is divided by 50
27
(ii) Find the remainder of 4737 when it is divided by 11.
13. Prove that the product of the last digit of the number 2n and of the sum of all its digit but the last is
divisible by 3.
14. Call a natural number n “convenient”, if n2+ 1 divisible by 1000001. Prove that among the number
1,2,……1000000 there are evenly many “convenient” numbers.
15. The sum of the numbers a, b and c is divisible by 30. Prove that a5 + b5 + c5 is also divisible by 30.
 2

Answer Key
1. No, No 7. 36 8. 6801 11. 7 12. 29,5

Video Solutions Links

1 https://youtu.be/lxxxUDBbWXs
2 https://youtu.be/QZQB2hLlGrg
3 https://youtu.be/PosNTzol1zc
4 https://youtu.be/EfQgYdxMkY8
5 https://youtu.be/-SkhqWggTfU
6 https://youtu.be/LtsUlQjSm_o
7 https://youtu.be/yx414XXdqcc
8 https://youtu.be/tpgcHeQXI2Q
9 https://youtu.be/THf2uFmcvvY
10 https://youtu.be/svdv7pX3uWM
11 https://youtu.be/RBglG-9zbr4
12 https://youtu.be/71CZa2q-UK4
13 https://youtu.be/tiSOFL9lTQk
14 https://youtu.be/shbAmbtBTdk
15 https://youtu.be/Pzk2IHr6l5A

Solutions
LEVEL - A
1. Determine if there is a natural number k such that the sum of the two numbers
3k 2 + 3k − 4 and 7k 2 − 3k + 1 is a perfect square.
Sol. 3k2 + 3k –4 + 7k2 – 3k + 1
= 10k2 – 3  2 mod (5)
Not possible for square
OR 10k2–3 has unit digit 7, not possible for square

2. Prove that the equation a2 + b2 – 8c = 6 has no integer solution

Sol. a2 + b2 – 8c = 6
a2 + b2 = 8c + 6
 3

a2  0, 1, 4 mod (8)
b2  0, 1, 4 mod (8)
a2 + b2  0, 1, 4, 2, 5 mod (8)
 a2 + b2 ≠ 8c + 6

3. Three prime numbers p, q, and r, all greater than 3, form an arithmetic progression: p, q = p + d, and
r = p + 2d. Prove that d is divisible by 6.
Sol. Prime number greater than 3, is of the form 6k+1 or 6k+5.
⇒ At least two of the primes of same form.
If p & q or q & r, of same form, then it is easily observed that d is divisible by 6.
Other cases:
CASE 1: If possible, let p = 6k+1, q = 6r+5 and r = 6t+1
2q = p + r ⇒ 12r + 10 = 6(k + t) +2
12r + 10 ≡ 6(k + t) +2(mod6)
⇒ 4 ≡ 2(mod6) contradiction
So this case not possible.
CASE 2: If possible, let p = 6k+5 and q = 6r+1and r = 6t+5
2q = p + r ⇒ 12r + 2 = 6(k + t) +10
12r + 2 ≡ 6(k + t) +10(mod6)
⇒ 2 ≡ 4(mod6) a contradiction
So this case not possible.

4. Prove that the number 100…00500..001 (100 zeros in each group) is not a perfect cube.
Sol. 100…00500..001 = 10202 + 5⨯10101 + 1 ≡ 6(mod9)
But cube of any number is of the form a3 ≡ 0, 1, 8(mod9).
⇒ Given number is not perfect cube.

5. Prove that the number 6n3 + 3 cannot be a perfect sixth power of an integer for any natural number n.
Sol. n3 ≡ 0, 1, 6(mod7)
6n3 + 3 ≡ 3, 2, 4(mod7)
But a6 ≡ 0, 1(mod7)
Therefore given expression is not perfect sixth power of an integer.

6. (a) If it is known that a + 1 is divisible by 3, prove that 4 +7a is also divisible by 3.

b) It is known that 2 + a and 35 – b are divisible by 11. Prove that a + b is also divisible by 11
Sol (a) 4 + 7a ≡ 1 + a(mod3)
(b) 2 + a ≡ 0(mod11) & 35 – b ≡ 0(mod11)
2 + a – 35 + b ≡ 0(mod11)
a + b ≡ 0(mod11)

14
7. Find the last two digits of 1414
 4

14
Sol First of all, we find remainder of 1414 modulo 25.
142 = 196  –4 (mod 25)  (14)5  (–4)2 .14  224 = –1 (mod 25)
So (14)10  1 (mod 25). On the other hand
142 = 196  6 (mod 10)  1414  67  6 (mod 10)
So, 1414 = 10t + 6 for some positive integer t, hence
1414 = 1410t +6 = (1410 ) .145.14  (1)( −1)(14 )  11 (mod 25)
14 t

1414
= 0 (mod 4)
14 14
Since 1414 = (2 × 7)14 = 45t+3.710t+6 which is divisible by 4, so 14
1414 = 25K + 11 where K is a positive integer, then
14

25 K + 11  0 (mod 4)
K–10 (mod4)
K  1 (mod 4), i.e. K = 4m + 1 for some m∊N.
1414 = 25 (4m + 1) + 11 = 100m + 36
14

14
Thus, the last two digits of 1414 are 36.

8. (SSSMO(J)/2001) Write down the last four digits of the number 7128
Sol. Here the recursive method is effective. Start from 74 = 2401, then
7 4 = 2401  2401 ( mod 104 )

78 = ( 74 ) = ( 2400 + 1) = ( 2400) + 4800 + 1  4801 ( mod 104 )

2 2 2

716 = ( 4800 + 1) = 9601 ( mod 104 ) ,

2

732  ( 9600 + 1)  9201 ( mod104 ) ,

2

764  ( 9200 + 1)  8401 ( mod104 ) ,

2

7128  ( 8400 + 1)  6801 ( mod104 ) ,

2

Therefore, the last four digits of 7128 is 6801.

9. Prove that 103n+1 cannot be represented as a sum of the cubes of two integers.
Sol. 103n+1 ≡ (3)3n⨯3 ≡ -3 or 3(mod7)
but a3 + b3 ≡ 0, 1, 2, 5, 6(mod7)
⇒ 103n+1 cannot be represented as a sum of the cubes of two integers.

10. A three digit number was decreased by the sum of its digits. Then the same operation was carried out
with the resulting number, et cetera, 100 times in all. Prove that the final number is zero
Sol. Since after the first subtraction the result is divisible by9, all numbers we obtain in the process have
the sum of their digits no less than 9. Therefore, if the original number was not greater than 891 =
9⨯99 then the proof is now obvious.
 5

For number greater than 891, we can prove this by using the fact that sum of digits of a three digit
number divisible by 9 can be 18 also. So there are enough numbers between having digits sum is 18
make the final number zero.

LEVEL - B
11. Let A be the sum of the digits of 44444444, and B the sum of the digits of A. Find the sum of the
digits of B
44444444  (104 )
4444
Sol.
 1017776
A < 177760
B<6×9
B < 59
Max (Sum of digits of B ) = 4 + 9 = 13
44444444  7 mod (9)
 Sum of digit of B = 7 only possibility
(i) Find the remainder of ( 25733 + 46 )
26
12. when it is divided by 50
37 27
(ii) Find the remainder of 47 when it is divided by 11.
Sol. (i) 257  7 mod (50)
(257)33  733  (72)16 71  (–1)16 71  7mod (50)
(257)33 + 46  7 + 46  3 mod (50)
(25733 + 46)26  326 mod (50)
35  –7 mod (50)  310 = –1 mod (50)
326 = (310)2 × 36  1 x 29 mod (50)
37 27
(ii) 47
4737 = 337 (mod 11)
27 27

35  1 mod (11)
37  2 mod ( 5)
37 27  227  413  2  ( −1)  2  −2 mod ( 5 )
13

3727  3mod ( 5)
37 27 = 5m + 3
4737  35m +3  27  5 mod (11)
27

13. Prove that the product of the last digit of the number 2n and of the sum of all its digit but the last is
divisible by 3.
Sol. n = 4k, 4k +1, 4k + 2, 4k + 3
24k+1 → 2
 6

24k+2 → 4
24k+3 → 8
24k → 6
(i) For n = 4k last digit is 6, divisible by 3.
(ii) For n = 4k + 1, 4k + 2, 4k + 3
2n  (–1)n mod (3)
For n = 4k + 1
2n –1 mod (3)
2n – 2  0 mod (3)
Sum of digits of (2n – 2) = Sum of digits of 2n – unit digit
⇒ Sum of digits of 2n – unit digit divisible by 3.
(iii) For n = 4k + 2
2n  1 mod (3)
2n  4 mod (3)
2n –4 0 mod (3)
(iv) n = 4k+ 3
2n  –1 mod (3)
2n  8 mod (3)
2n– 8  0 mod (3)

14. Call a natural number n “convenient”, if n2+ 1 divisible by 1000001. Prove that among the number
1,2,……1000000 there are evenly many “convenient” numbers.
Sol. Let x2  –1 mod (106 + 1)
(106 + 1 –x)2 = (106 + 1)2 – 2 (106 + 1)x + x2  –1 mod (106 + 1)
 if x is convenient then 1000001 - x is also convenient

15. The sum of the numbers a, b and c is divisible by 30. Prove that a5 + b5 + c5 is also divisible by 30.
Sol. x5 – x = (x-1)(x)(x+1)(x2 +1)
In three consecutive numbers, there is at least one number is multiple of 3 and one is multiple of 2
x = 5k, 5k+1, 5k+2, 5k+3, 5k+4
It can be easily observed that, for x = 5k, 5k+1 and 5k+4, (x-1)(x)(x+1)(x2 +1) divisible by 5.
For x = 5k+2 & 5k+3, x2 +1is divisible by 5.
⇒ x5 – x is divisible by 30.
⇒ a5 + b5 + c5 – a – b – c is divisible by 30.
Given a + b + c is divisible by 30 therefore a5 + b5 + c5 is also divisible by 30.