Olympiad 11 - Part Test 2

Questions

1. Find the last two digits of 10321032. Express your answer as a two-digit number.

2. Let a be the base 10 integer equivalent to 202120 and let b the base 10 integer equivalent to 202121. Compute sum of digits of (b – a).

3. Determine the number of pairs (x, y) of integer solutions for 22x – 32y = 55.

4. The number of positive integral values of n of which n3 – 9n2 + 27n – 26 represents a positive prime number.

5. Find last two digit of (4! + 8! + 12! + …… + 96!)2

6. Find the sum of all real x satisfy: 23x + 2 – 33 × 22x + 2x + 3 = 0.

7. Compute the remainder of 210 + 211 + 510 + 511 + 1010 + 1011 when divided by 13.

8. (x+3)
250
(x−3)
141

Number of integer values of x < 10 satisfy 268

⩾ 0 .
(3x−2)

9. You can buy biscuits in the packets of 7 biscuits or 10 biscuits. what is the largest number of biscuits that you cannot buy, if you have infinite amount of money?

10. Find the smallest base b so that the number 144b is a perfect cube.

11. If positive integers n, x, y, z satisfy equation nx + ny = nz. Find n(2z - x - y).

12. Find the number of prime numbers that divide 112222110?

13. Let n be an integer such that n4 – 2n3 - n2 + 2n + 2 is a prime number. What is the sum
of all possible n?

14. Computer the length of the interval of values x for which 1

+
1
⩾ 1
x+√x x−√x

15. Three positive integers are such that they differ from each other by at most 5. It is also known that the product of these three integers is 2652. What is the smallest integer among them?

16. If n be the largest 5-digit number such that

(i) it contains distinct digits
(ii) it is a multiple of 21 and 9.
Find sum of digit of n.

17. In a mathematical game, eighty people are standing in a line, and they are required to count off in fives as one, two, three, four, five, one, two, three, four, five and so on from the first
person in the line. The person who says ‘five’ is taken out of the line. Those remaining repeat this procedure until only four people remain in the line. What was the original position in
the line of the last person to leave?

18. How many ordered pairs of integers (x, y) satisfy the equation x2 + y2 = 2 (x + y) + xy?

19. Find the remainder when 201959 315 315

divide by 16?
2(2018 ) 2018
+ 4(201959) + 10

20. Find the sum of last three digits of 2105 10

+ 2105
12
+. . +2105
2106
?

21. Positive integers x, y, z satisfies, xyz = 2(xy + yz + zx). Find the number of ordered pairs (x, y, z) if x ≤ y ≤ z.

22. 5
4
3
2
1

Write the number 7 in base 12, then add the digits of its base 12 representation. Now convert that sum into base 12 and find the sum of its digits. Repeat this process until a single
6

base 12 digit remains. Find that digit.

For example, let n = 12310 = 10 × 12 + 3 = 10 312
S(n) = 10 + 3 = 1310 = 12 + 1 = 1 112
S(S(n)) = 210 = 212

23. Number of integer solutions of the system of equations

a + b + c = 3 and a3 + b3 + c3 = 3

24. In the value of the number 30!, all the zeroes at the end are erased. Then, the unit digit of the number that is left is

25. Find number of pairs of prime numbers (m, n) for which the congruence x 3mn
≡ x ( mod 3mn) holds for all integers x.

26. For integers a and n, (5a – 2)5 + (4a + 2)5 + (3a + 3)5 + a5 = n5. If a = 27, find the value of n/2.

27. Four distinct numbers have pairwise sums, in no particular order, are 392, 405, 370, x, 349, and y, If N be the greatest possible value of x + y. Find Sum of digits of N.

28. If n be the largest integer less than 1029 such that all the divisors of n have at most two 1’s in their binary representations. Find sum of digits of n.

29. For positive integers n, let K(n) be the largest factor of n other than n itself. Determine the number of ordered pairs of composite positive integers (m, n) for which K(m)K(n) = 60.

30. If n = 1 × 5 × 9 × 13 × 17×. . . ×501. Find the sum of last three digits of n.

Answer Key

1. 76 2. 13 3. 1 4. 1.00 5. 36.00 6. 1.00

7. 5.00 8. 8 9. 53.00 10. 6.00 11. 4.00 12. 8.00
13. 2.00 14. 2.00 15. 12.00 16. 27.00 17. 79.00 18. 6.00
19. 15.00 20. 13.00 21. 10.00 22. 4.00 23. 4.00 24. 8.00
25. 2.00 26. 72.00 27. 20.00 28. 11.00 29. 18.00 30. 8.00

Solutions

1. (76)
The last two digits of 10321032 is the same as the last two digits of 321032. The last two digits of 32n repeat with a period of four as 32, 24, 68, 76, 32, 24, 68, 76, ……

2. (13)
Converting to base 10,
b – a = (2 ∙ 213 + 2 ∙ 21 + 1) – (2 ∙ 203 + 2 ∙ 20 + 1)
= 2(213 – 203) + 2(21 – 20)
= 2(1261) + 2(1)
= 2524.

3. (1)

4. (1.00)
If y = n3 – 9n2 + 27n – 26
Then y = (n2 – 7n + 13)(n – 2)
for n = 1, y = -7 not admissible
for n = 2, y = 0, not a prime number
for n = 3, y = 1, not a prime number
for n = 4, y = 2, a prime number
For n = 5, y = 9, not a prime
for n > 5, n – 2 > 3 is a factor of y
Hence, y is not prime.
Number of integral values of n for which y is prime is 1.

5. (36.00)
We know that,
4! + 8! + 12! + …… + 96! ≡ 44 mod 100
⇒ (4! + 8! + 12! + …… + 96!)2 ≡ 1936 mod 100
⇒ 1936 ≡ 36 mod 100
⇒ (4! + 8! + 12! + …… + 96!)2 ≡ 36 mod 100
∴ Last two digit is 36.

6. (1.00)
We can write the equation as 2x(4 × (2x)2 – 33 × (2x) + 8 = 0, or 4 × (2x)2 – 33 × (2x)+ 8 = 0. Make the substitution y = 2x
4y2 – 33y + 8 = 0
(y - 8)(4y - 1) = 0
y = 8, 1/4
= 2 = 8, and x = 3, –2.
x 1

7. (5.00)

8. (8)
250 141
(x+3) (x−3)

268
⩾ 0
(3x−2)

2
⇒ x = −3, ,3
3

Since, powers of (x + 3) and (3x − 2) are even

Therefore, wavy curve will not change its sign at these points.

⇒ x ∈ {−3} ∪ [3, ∞)

9. (53.00)
Method 1: By observation, we can achieve seven consecutive numbers 54 = 14 + 30, 55 = 35 + 20, 56, 57 = 7 + 50, 58 = 28 + 30, 59 = 49 + 10, 60. Now every number can be formed by
adding multiples of 7 into these numbers. If we check for 53, not achievable.
Method 2: By the Chicken McNugget Thorem, which states that if you buy items in packs of p and q, the largest number of items that you cannot make is p × q – p – q. our answer is 7 × 10
– 7 – 10 = 53 cookies.

10. (6.00)
If we write out base notation, Nb = 144b = b2 + 4b + 4. Then know from the base representation that b ≥ 5,
For b = 5, we have 52 + 20 + 4 = 4910 not a perfect cube.
For b = 6, we have 62 + 24 + 4 = 6410, which is a perfect cube.

11. (4.00)
We have may assume that x ≤ y ≤ z. We cannot have n = 1, hence n ≥ 2. We have
nx = nz - ny = nx(nz - x – ny - x), which implies nz - x – ny – x = 1. If we had y > x, then we would have n|1, which is impossible. Thus we must have y = x, hence nz - x = 2, which yields n = 2,
z – x = 1. We obtain therefore, n = 2, y = x, z = x + 1.
n(2z – x – y) = 4

12. (8.00)
We note that this is
1010 (x
5
+ x
4
+ x
3
+ x
2
+ x + 1) = 1010 (x + 1) (x
2
− x + 1) (x
2
+ x + 1) . When x = 10. So, we can factor it as 1010 x 11 x 91 x 111 = 2 x 5 x 101 x 11 x 7 x 13 x 3 x 37.

13. (2.00)

We can see that this expression must be an ever number since n4 and n2 are the same parity. The only even prime is 2. So we solve solutions to n4 – 2n3 – n2 + 2n + 2 = 2.

n4 – 2n3 – n2 + 2n = 0

n = 0, n3 – 2n2 – n + 2 = 0

(n – 1)(n – 2)(n + 1) = 0

n = -1, 1, 2

Sum of all possible n = 2

14. (2.00)

x+√x
1
+
x−√x
1
=
x(x−1)
2x
. The domain of the function is all positive x except 1. For x between 0 and 1, the denominator is negative, so the function is negative. For x greater than 1, the
function is strictly decreasing. It equal 1 when 2x

x(x−1)
= 1 → 2x = x
2
− x → x
2
− 3x = 0 → x = 3,

So, the interval is (1, 3), which has length 2.

15. (12.00)
Let x be the smallest integer. Then we have
3 2
x ⩽ 2652 ⩽ x(x + 5)

The first inequality implies that x ≤ 13, while the second inequality implies that x ≥ 11. If x = 13, then the product of the other integers is 204. This is impossible, since the smallest factor of
204 greater than 13 is 17 but 172 = 289 > 204. Therefore, we must have x = 12. The other two integer are easily seen to be 13 and 17.

16. (27.00)
LCM(21, 9) = 63
Let NK be the largest K-digit number which has distinct and is a multiple of 63. It can readily be verified that N1 = 0, N2 = 63, and N3 = 945. For K > 3, compute NK using the following
strategy: that with the number M0 = 9 8 7 … (10 – K); let M1 be the largest multiple of 63 not exceeding M0. That is, to compute M1, divide M0 by 63 and discard the remainder: M0 = 1587
× 63 + 44, so M1 = M0 – 44 – 1587 × 63. If M1 has distinct digits, then NK = M1. Otherwise, let M2 = M1 – 63, M3 = M2 – 63, and so on; then NK is the first term of the sequence M1, M2,
M3, … that has distinct digits. Applying this strategy gives N4 = 9765, N5 = 98721, N6 = 987651, and N7 = 9876510. With K = 5, the answer is 98721.

17. (79.00)
After the first cycle, 64 people will remain and 79th will be last. After the second cycle 52 people will remain and 79th will be the last. Now even after the subsequent cycles the 79th person
will not leave the queue as the number of remaining people will never be a multiple of 5. Note that the last person leaves the queue only if the number of remaining people is a multiple of 5

18. (6.00)
(M1) (x - y)2 + (x - 2)2 + (y - 2)2 = 8

(x - 2)2 , (y - 2)2, (x - y)2 = (4, 4, 0), (4, 0, 4),(0, 4, 4)

(x, y) = (4, 4),(0, 0),(4, 2),(0, 2),(2, 4),(2, 0)

(M2) We can rearrange the equation to get

x2 – x(2 + y) + y2 – 2y = 0
As a quadratic equation in the variable x, the discriminant of the above equation is given by
Discriminant = (2 + y)2 – 4(1) (y2 – 2y) = 1 + 12y – 3y2 = 16 – 3(y – 2)2
Since x is an integer, the discriminant must be a perfect square and thus it is non-negative Hence
2 2 16 4
16 − 3(y − 2) ⩾ 0 ⇒ (y − 2) ⩽ ⇒ |y − 2| < < 3
3 √3

Since y is an integer, it follows that its only possible values are given by y = 0, 1, 2, 3, 4.

When y = 1, 3 the discriminant is 12, which is not perfect square.

Thus, y = 0, 2, 4

When y = 0, we have x2 – 2x = 0 ⇒ x = 0, 2.

When y = 2 we have x2 – 4x = 0 ⇒ x = 0, 4

When y = 4, we have x2 – 6x + 8 = 0 ⇒ x = 2, 4

Thus, there are 6 solutions namely (0, 0), (2, 0),(0, 2),(4, 2),(2, 4),(4, 4)

19. (15.00)
201959 ≡ 7 (mod16)

2019592 ≡ 1 (mod16)
even
⇒ 201959 ≡ 1(mod16)

315 315
2(2018 ) 2018
201959 + 4(201959) + 10 ≡ 1 + 4 + 10 = 15(mod16)

20. (13.00)
Finding last n digits of a number is done by finding the remainder when said number is dived by 10 . n

We note that 2105 ≡ 105 (mod 1000), so the sum is congruent to

21052 ≡ 025 (mod 1000)
2105 + 2105
10
+. . +2105
12
≡ 25 + 25 +. . +25 (mod 1000) 2106 5 6 1053

11 12 2006
5 + 5 +. . +5 ( mod 1000) ,

We have 5 = 625 and 5 ⋅ 625 ≡ 125 (mod 1000), but 5 ⋅ 125 = 625, so powers of 5 modulo 1000 repeat periodically 625, 125, 625, 125, ….. that it to say 5
4 n
≡ 625 (mod 1000) for even
n ⩾ 4 and 5 = 125 (mod 1000) for odd m ⩾ 5 . So we can write the sum as
m

5 6 1053
25 + 25 +. . +25 ≡ 625 + 625 + 625+. . +625 + 625 ( mod 1000) ,

1049 terms

≡ 1049 ⋅ 625 ≡ 625 (mod 1000)

21. (10.00)
We need
xyz = 2(xy + yz + zx) or (x – 2)yz = 2x(y + z).
Since xy, xz ≤ yz from the first equation we get xyz ≤ 6yz. Thus x ≤ 6. From the second equation we see that x > 2. Thus x ∈ {3, 4, 5, 6}.
If x = 3 we need yz = 6(y + z) ⇒ (y – 6)(z – 6) = 36. We get five roots
{(3, 7, 42), (3, 8, 24), (3, 9, 18), (3, 10, 15), (3, 12, 12)}.
If x = 4 we need 2yz = 8(y + z) ⇒ yz = 4(y + z) ⇒ (y - 4)(z - 4) = 16. We get three roots
{(4, 5, 20), (4, 6, 12), (4, 8, 8)}.
If x = 5 we need 3yz = 10(y + z) ⇒ 9yz = 30(y + z) ⇒ (3y - 10)(3z - 10) = 100. We get
one root {(5, 5, 10)}.
If x = 6 we need 4yz = 12(y + z) ⇒ yz = 3(y + z) ⇒ (y - 3)(z - 3) = 9. We get one root
{(6, 6, 6)}.
Thus, there are 5 + 3 + 1 + 1 = 10 solutions.

22. (4.00)
For a positive integer n, let s(n) be the sum of digits when n is expressed in base 12. We claim that s(n) ≡ n (mod 11) for all positive integers n. Indeed, if n = dk 12k + dk – 1 12k –1 + … + d0
1
2
3
4
5

with each di an integer between 0 and 11, inclusive, because 12 ≡ 1 (mod 11), reducing modulo 11 gives exactly s(n). Thus, our answer is congruent to N 6
= 7 modulo 11, and
furthermore must be a one-digit integer in base 12; these two conditions uniquely determine the answer.
1
2
3

710 ≡
4

By Fermat’s Little Theorem 1 (mod 11), and also observe that 6 ≡ 6 (mod 10) because 6 ≡ 0 (mod 2) and 6 ≡ 1 (mod 5). Thus N ≡ 7 ≡ 343 ≡ 2 ≡ 4 (mod 11), which is our
5 6 2 2

answer. (Additionally, we note that this process of writing the number in base twelve and summing the digits must eventually terminate because the value decreases after each step.)

23. (4.00)
We have the identity:
…….(1)
3 3 3 3
(a + b + c) − (a + b + c ) = 3 (a + b) (b + c) (c + a)

Thus, if a, b and c are integers such that a + b + c = 3 and a3 + b3 + c3 = 3,

Then by (1) we get
8 = (a + b)(a + c)(b + c) = (3 – a) (3 – b)(3 – c), …..(2)
and in view of a + b + c = 3 we have
6 = (3 - a) + (3 - b) + (3 - c) …..(3)
The relation (3) implies that either all three numbers 3 – x, 3 – y, 3 – z are even or only one of them is even. In this first case, in view of (2), all these number are equal to 2 in absolute value;
thus by (3), they are equal to 2, and then x = y = z = 1. In the second case, in view of (2), one of the number 3 - x, 3 - y, 3 - z is equal to 8 in absolute value, and the remaining ones are equal
to 1 in absolute value; thus, in view of (3), one of them is 8, and the remaining are -1. Thus, yields x = - 5, y = z = 4, or x = y = 4, z = –5, or, finally, x = 4, y = –5, z = 4. Thus, our system of
equations has only four integer solutions, namely x, y, z = (1, 1, 1); (–5, 4, 4); (4, -5, 4); (4, 4, –5).

24. (8.00)
Finding the powers of all the prime factors in 30! We obtain ,
30! = 2 × 3 × 5 × 7 × 11 × 13 × 17 × 19 × 23 × 29. Removing 2 × 5 for the number of zeroes, we obtain 2
26 14 7 4 2 2 7 7 19 14
× 3
4
× 7 × 11
2
× 13
2
× 17 × 19 × 23 × 29 . We need to
find the unit digit of this product to find the right most nonzero digit. The unit digit of the product = unit digit of
8 × 9 × 1 × 1 × 9 × 7 × 9 × 3 × 9 = 8

25. (2.00)
Without loss of generality assume m < n; the unique solution will be (11, 17), for which one may check the congruence using the Chinese Remainder Theorem.
We can break x ≡ x ( mod 3mn) as
3mn

≡ x ( mod 3) , x ≡ x ( mod m) , x
3mn 3mn 3mn
x ≡ x ( mod n)

When x = 2, 2 3mn ≡ 2(mod 3), which means m and n are odd.

In additions, if x is coprime to m, then x3mn – 1 ≡ 1 (mod m) implies that m – 1 divides 3mn – 1 as well as 3mn – 1 – 3n (m – 1) = 3n – 1, and conversely that n – 1 divides 3m – 1. If m = n,
we now deduce m = n = 3, but 427 ≡ 1 (mod 27), so this fails, Hence, m < n.
Since m and n are odd primes, n > m + 2, so (3m – 1)/(n – 1) < 3. Since this quantity is an integer, and it is clearly greater than 1, it must be 2. That is, 2n = 3m + 1. One the other hand, m –
1 divides 3n – 1 = (9m + 1)/2 as well as (9m + 1) – (9m – 9) = 10. Hence, m = 11, n = 17.

26. (72.00)
1335 + 1105 + 845 + 275 = n5
Note that n is even, since the LHS consists of two odd and two even numbers. By Fermat's Little
Theorem, we know n5 is congruent to n modulo 5. Hence.
3 + 0 + 4 + 2 ≡ n (mod 5)
4 ≡ n (mod 5)
Continuing, we examine the equation modulo 3,
1 – 1 + 0 + 0 ≡ n (mod 3)
0 ≡ n (mod 3)
Thus, n is divisible by three and leaves a remainder of four when divided by 5. It's obvious that n > 133. So the only possibilities are n = 144 or n ≥ 174. It quickly becomes apparent that 174
is much too large, so n must be 144.
n/2 = 72

27. (20.00)
235, 213, 192, 157
448, 427, 392, 405, 370, 349
Let these four numbers be a, b, c and d, where a > b > c > d, x + y needs to be maximized, so let x = a + b and y = a + c because these are the two largest pairwise sums. Now x + y = 2a + b
+ c needs to be maximized. Notice that
2a + b + c = 3 (a + b + c + d) − (a + 2b − 2c + 3d)

= 3 ((a + c) + (b + d)) − ((a + d) + (b + c) + (b + d) + (c + d))

No matter how the numbers 392, 405, 370, and 349 are assigned to the values a + d, b + c, b + d and c + d, the sum (a + d) + (b + c) + (b + d) + (c + d) will always be 392 + 405 + 370
+ 349. Therefore, we need to maximize 3 ((a + c) + (b + d)) − (392 + 405 + 370 + 349).The maximum value of (a + c) + (b + d) is achieved when we let a + c and b + d be 405
and 392 because these are the two largest pairwise sums besides x and y. Therefore, the maximum possible value of x + y = 3 (405 + 392 ) − (392 + 405 + 370 + 349) = 875

28. (11.00)
Call a number good if all of its positive divisors have at most two 1’s in their binary representations. Then, if p is an odd prime divisor of a good number, p must be the form 2k + 1. The only
such primes less than 1029 are 3, 5, 17, and 257, so the only possible prime divisors of n are 2, 3, 5, 17, and 257.
Next, note the since (2i + 1) (2j + 1) = 2i+j + 2i + 2j + 1, if either i or j is greater than 1, then there will be at least 2 1’s in the binary representation of (2i + 1) (2j + 1), so (2i + 1) (2j + 1)
cannot divide a good number. On the other hand, if i = j = 1, then (21 + 1) (21 + 1) = 9 = 23 + 1, so 9 is a good number and can divide a good number. Finally note that since multiplication
by 2 in binary just appends additional 0s, so if n is a good number, then 2n is also a good number.
It therefore follows that any good number less than 1029 must be the form c.2k, where c belongs to {1, 3, 5, 9, 17, 257} (and moreover, all such numbers are good). It is then straightforward
to check that the largest such number 1028 = 257 × 4.

29. (18.00)
px
Let x be an integer, and let px be the smallest prime factor of x. Then, if K(a) = x, we note that we must have a = px for some prime p ⩽ px. (Otherwise, if p > px, then > x.
px

If p is composite, then kx > x for some factor k of x.)

So we have:
K(a) = 2, 4, 6, 10, 12, 20, 30 ⇒ 1 value for a
K(a) = 3, 15 ⇒ 2 values for a
K(a) = 5 ⇒ 3 values for a
Hence, we note that, since m and n are composite, we cannot have K(m) = 1 or K(n) = 1, so the possible pairs (K(m), K(n)) are (2, 30), (3, 20), (4, 15), (5, 12), (6, 10) and vice-versa.
We add the number of choices for each pair, and double since m and n are interchangeable, to get 2(1 × 1 + 2 × 1 + 1 × 2 + 3 × 1 + 1 × 1) = 18 possible ordered pairs (m, n).

30. (8.00)
It is clear that n is odd since it is the product of odd numbers. Let x be the last three digits in that order, then n ≡ x (mod 1000). Since 5, 25 are in the product, so n is divisible by 125, hence x
is divisible by 125. Thus, the possible values of x are 125, 375, 625, 875 only.
On the other hand, 1000 | (n – x) ⇔ 8 |(n – x), so n ≡ x (mod 8). For getting the remainder of n modulo 8, we find that
n = (1) (4 × 1 + 1) (4 × 2 + 1) (4 × 3 + 1)….(4 × 124 + 1)(4 × 125 + 1)
≡ (1 × 5) × (1 × 5) ×. . . . . . × (1 × 5) ≡ (25)×. . . . . ×(25) × 5 ( mod 8)
 
63 pairs of brackets 31 pairs

≡ 1×. . . . . ×1 × 5 ( mod 8)

≡ 5( mod 8)

Among 125, 375, 625, 875, only 125 has remainder 5 modulo 8, so x = 125 i.e. the last three digits of n is 125