PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

Solutions
1. If x is a real number that satisfies

é 11 ù é 12 ù é 99 ù
ê x + 100 ú + ê x + 100 ú +.......+ ê x + 100 ú = 765,
ë û ë û ë û

Find the value of [10x]. Here [a] denotes that largest integer £ a.
Ans. 85

é k ù
Sol. First observe that ê x + ú = [x] or [x] + 1 for 11 £ x £ 99. Since there are 89 terms on the
ë 100 û
left-hand side of the equation and 89 × 8 < 765 < 89 × 9, we deduce that [x] = 8. Now suppose

é k ù é k ù
ê x + 100 ú = 8 for 11 £ k £ m and ê x + 100 ú = 9 for m + 1 £ k £ 99. Then
ë û ë û

8(m – 10) + 9(99 – m) = 765,

é 46 ù é 47 ù 46
which gives m = 46. Therefore ê x + ú = 8 and ê x + ú = 9, which imply 8 £ x + < 9
ë 100 û ë 100 û 100

47
and 9 £ x + < 10 respectively. The inequalities lead to
100

7.54 £ x < 8.54 and 8.53 £ x < 9.53. Consequently, we see that 8.53 £ x < 8.54. Hence we
conclude that [10x] = [85.3] = 85.
2. Let a, b and c be digits with a ¹ 0. The three-digit integer abc lies one third of the way from the
square of a positive integer to the square of the next larger integer. The integer acb lies two thirds
of the way between the same two squares. What is a + b + c?
Ans. 16
Sol. The difference between acb and abc is given by
(100a + 10c + b) – (100a + 10b + c) = 9(c – b)
The difference between the two squares is three times this amount or 27(c – b)
The difference between two consecutive squares is always an odd number therefore c – b is odd.
We will show that c – b must be 1. Otherwise we would be looking for two consecutive squares
that are at least 81 apart. But already the equation (x + 1)2 – x2 = 27 × 3 solves to x = 40 and
402 has more than three digits.
The consecutive squares with common difference 27 and 132 = 169 and 142 = 196. One third of
the way between them is 178 and two thirds of the way is 187.
This gives a = 1, b = 7, c = 8
a + b + c = 16

Your Hard Work Leads to Strong Foundation 1/13

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

3. In each of the following 7-digit natural numbers:

1001011, 5550000, 3838383, 7777777,
every digit in the number appears at least 3 times. If the number of such 7-digit natural numbers

N - 2018
is N, find .
14
Ans. 59
Sol. If only one digit appears, then there are 9 such numbers. If the two digits that appear are both
nonzero, then the number of such numbers is

2´ ( C )( C )
7
3
9
2 = 2520.
If one of two digits that appear is 0, then the number of such numbers is

( ( C ) + ( C ) ) ´ ( C ) = 315.
6
4
6
3
9
1

Hence N is 9 + 2520 + 315 = 2844.

4. Let S = {1,2,3,........, 20} be the set of all positive from 1 to 20. Suppose that N is the smallest
positive integer such that exactly eighteen numbers from S are factors of N, and the only two
numbers from S that are not factors of N are consecutive integers. Find the sum of the digits of
N.
Ans. 36
Sol. We first find out which two consecutive numbers from S are not factors of N. Clearly 1 is a
factor of N. Note that if an integer k is not a factor of N, then 2k is not a factor of N either.
Therefore for 2£ k £ 10, since 2k is in S, k must be a factor of N, for otherwise there would be
at least three numbers from S (the two consecutive numbers including k and 2k) that are not
factors of N. Hence 2,3,.......10, are factors of N. Then it follows that 12 = 3 × 4, 14 = 2 × 7, 15
= 3 × 5, 18 = 2 × 9, 20 = 4 × 5 are also factors of N. Consequently, since the two numbers from
S that are not factors of N are consecutive, we deduce that 11, 13 and 19 are factors of N as
well. Thus we conclude that 16 and 17 are the only two consecutive numbers from S that are not
factors of N. Hence
N = 23 × 32 × 5 × 7 × 11 × 13 × 19 = 6846840,
so the sum of digits of N = 2 × (6 + 8 + 4) = 36.
5. Given that
x = [11/3 ] + [2 1/3 ] + [3 1/3 ] + .......+ [79991/3 ]

é x ù
find the value of ê ú , where [y] denotes the greatest integer less than or equal to y.
ë10000 û

(For example, [2.1] = 2, [30] = 30, [–10.5] = –11]

Ans. 11
Sol. Note that
x = [11/3 ] + [2 1/3 ] + [31/3 ]+.....+ [79991/3 ]

2/13 Your Hard Work Leads to Strong Foundation

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

= å [k1/ 3 ] + å [k1/ 3 ] + å [k1/ 3 ] +...+ å [k1/3 ]

13 £k <23 23 £ k <33 33 £ k < 4 3 193 £ k <203

= (2 3 – 13) + 2(33 – 23 ) + 3(4 3 – 33 ) +...+ 18(193 – 183 ) + 19(203 – 193 )

2
æ 19 ´ 20 ö
= 19(8000) – ç ÷
è 2 ø

= 115900

é x ù
\ ê10000 ú = 11
ë û

6. How many integers can be expressed as a sum of three distinct numbers if chosen from the set
{4, 7, 10, 13,......46}?
Ans. 37
Sol. Since each number is of the form 1 + 3n, n = 1,2,3....., 15 the sum of the three numbers will be
of the from 3 + 3k + 3l + 3m where k, l and m are chosen from {1, 2, 3,.....15}. so the
question is equivalent to the easier question of, ‘How many distinct integers can be formed by
adding three numbers from, {1,2,3,....15}?
The smallest is 1 + 2 + 3 = 6 and the largest is 13 + 14 + 15 = 42.
It is clearly possible to get every sum between 6 and 42 by:
(a) Increasing the sum by one replacing a number with one that is 1 larger or,
(b) decreasing the sum by one by decreasing one of the addends by 1.
Thus all the integers from 6 to 42 inclusive can be formed.
This is the same as asking. “ How many integers are there between 1 and 37 inclusive?’ The
answer, of course, is 37.
7. The product of the digits of a four-digit number is 810. If none of the digits is repeated, the sum
of the digits is
Ans. 23
Sol. Suppose that the four digit number has digits a, b, c and d i.e. the product abcd = 810. We must
determine how to write 810 as the product of 4 different digits, none of which can be 0. So we
must start by factoring 810. As 810 = 81 × 10 = 3 4 × 2 × 5.
So one of the digits must have a factor of 5. But the only non-zero digit having a factor of 5 is
5 itself, so 5 is one of the required digits.
Now we need to find 3 different digits whose product is 3 4 × 2.
The only digits with a factor of 3 are 3, 6 and 9 and since we need 4 factors of 3, we must use
each of these digits (the 9 contributes 2 factors of 3; the other contribute 1 each).
In fact 3 × 6 × 9 = 34 × 2 = 162.
Therefore, the digits of the number are 3, 5, 6 and 9, and so the digits is 23.

Your Hard Work Leads to Strong Foundation 3/13

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

8. A supermarket has 128 crates of apples. Each crate contains at least 120 apples and at most 144
apples. What is the largest integer n such that there must be at least n crates containing the same
number of apples?
Ans. 06
Sol. There are 25 different possibilities for the number of apples a crate can contain. If there were no
more than five crates containing any given number of apples, there could be at most 25(5) = 125
crates. since there are 128 crates, n ³ 6. We conclude that n = 6 by observing that it is quite
possible that there are exactly six crates containing k apples in each of the cases k = 120, 121,
122 and exactly five crates containing k apples in each of the case k = 123, 124, 125, .......144.
9. How many five-digit positive integers can be formed by arranging the digits 1, 1, 2, 3, 4 so that
the two 1s are not next to each other?
Ans. 36
Sol. Since the two 1s are not next to each other, then the two 1s can be placed in the following pairs
of positions, reading from the left: 1st and 3rd, 1st and 4th, 1st and 5th, 2nd and 4th, 2nd and
5th, 3rd and 5th.
There are 6 such pairs of positions.
Choose one of these pairs, say 1st and 3rd. This gives the number 1_ 1_ _ .
There are 3 digits left to place. We place these from left to right.
There are 3 possible digits the could go in the left most empty position.
After this digit is placed, there are 2 possible digits that could go in the next empty position.
Finally, the remaining digit is placed in the remaining empty position.
This process works for each of the pairs of positions for the two Is.
Therefore, there are 6 × 3 × 2 = 36 such five-digit integers (6 pairs of positions for the 1s, 3
choices for the first empty position and 2 choices for the second empty position.
OR
5! 120
Since there are 5 digits to arrange and 2 of them are the same, there are = = 60
2! 2
arrangements:
To see this, replace one of the 1s with and X so that the "digits" were 1, 2, 3, 4, X.
There would be 5 choices for the first digit, 4 choices for the second digit, and so on, giving
5! = 5 × 4 × 3 × 2 × 1 = 120 arrangements of the digits.
If we now replace the X with a 1, each arrangement is now counted 2 times. For example, 43X21
and 4312X become the same arrangement.
Therefore, we need to divide the total 120 by 2! = 2 since each arrangement is double-counted.
In some of these arrangements, the 1s will be next to each other and in some they will not be.
We will count the arrangements with the 1s next to each other and subtract this number from the
total.
If the two 1s are together, we can imagine arranging the four objects 11, 2, 3, 4.
There are 4! = 24 such arrangements.

4/13 Your Hard Work Leads to Strong Foundation

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

Thus, there are 60 – 24 = 36 arrangements of 1, 1, 2, 3, 4 with the two 1s not next to each other.
10. The number of positive integers a, b, c such that
a2 + b 2 + c2 = a2b 2
is
Ans. 00
Sol. Square of an integer is either 0 mod 4 or 1 mod 4 . Let us list all the possibilities mod 4:
2 2
a b c a +b +c
2 2 2 2 2 2
ab Possible solution?
0 0 0 0 0 Yes
0 0 1 1 0 No
0 1 0 1 0 No
0 1 1 2 0 No
1 0 0 1 0 No
1 0 1 2 0 No
1 1 0 2 1 No
1 1 1 3 1 No
Thus the only possibility for a solution is when all of a, b, c are even. Let a = 2a 1 , b = 2b 1 ,
c = 2c1 . Then we must have
4(a21 + b21 + c12 ) = 16a12 b12
and hence a 12 + b 12 + c 12 = 4a 12 b 12 . Arguing as above, we find that a 1 , b 1 , c 1 also must be even
numbers. If we let a1 = 2a2, b1 = 2b2, c1 = 2c2 , we must have
a22 + b22 + c22 = 16a22 b22
Proceeding thus, we find that a, b, c must be divisible by every power of 2 and the only
possibility for this is a = b = c = 0. Thus the given equation has no solution in positive integers.

2n 2 - 10n - 4
11. Given that n is an integer, for how many values of n is an integer?
n 2 - 4n + 3

Ans. 05
Sol. We start by dividing n 2 – 4n + 3 into 2n 2 – 10n – 4.

2
2
n2 – 4n + 3 2n – 10n – 4
2n2 – 8n + 6
–2n –10

This allows us to write the original expression in the following way.

2n 2 - 10n - 4 –2n - 10 2n + 10
= 2 + 2 = 2– 2 .
n - 4n + 3
2
n - 4n + 3 n - 4n + 3

2n + 10
The original question comes down to the consideration of and when this expression is
n - 4n + 3
2

an integer. This rational expression can only assume integer values when 2n + 10 ³ n2 – 4n + 3

Your Hard Work Leads to Strong Foundation 5/13

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

(the numerator must be greater than the denominator) and when 2n + 10 = 0

Or, n2 – 6n – 7 £ 0 and n = – 5
or. (n – 7) (n + 1) £ 0
– 1 £ n £ 7.
This means that we only have to consider values of n. – 1 £ n £ 7, n Î Z and n = – 5. Also
note that since n 2 – 4n + 3 = (n – 1) (n – 3) we can remove n = 1 and n = 3 from
consideration. We construct a table and check each value.

n –5 –1 0 2 4 5 6 7
2n + 10 10 5 22
0 +1 –14 6 1
(n - 3)(n - 1) 3 2 15

From this table we can see that there are just four acceptable values of n that produce an integer.
2n + 10
Also note that would also be an integer if 2n + 10 = 0 and n2 – 4n + 3 ¹ 0.
n - 4n + 3
2

Thus n = –5 is a fifth value since the denominator ¹ 0.

12. What is the smallest positive odd integer n such the product
13/7 23/7 .........2(2n + 1)/7
is greater than 1000? (In the product the denominators of the exponents are all sevens, and the
numerators are the successive odd integers from 1 to 2n + 1.)
Ans. 09
Sol. We recall that 1 + 3 + 5 + ........+ 2n + 1 = (n + 1)2 and write the product
2 / 7
21/723/7 .........2(2n + 1)/ 7 = 2{1 + 3 +......+ 2n + 1] / 7 = 2(n + 1) .
Since 210 = 1024, we consider values of n for which (n + 1)2 / 7 is approximately 10

2(7+1)
2
/7 = 2 9 + (1 / 7) < 29 . 21/2 = (512) (1.41.....) < 1000 < 1024 = 210 < 2(9+1)2 / 7 and n = 9.

13. A six digit number (base 10) is squarish if it satisfies the following conditions:
(i) none of its digits is zero;
(ii) it is a perfect square; and
(iii) the first two digits, the middle two digits and the last two digits of the number are all perfect
squares when considered as two digits numbers.
How many squarish numbers are there?
Ans. 02
Sol. That N is squarish may be expressed algebraically as follows: there are single digit integers A, B,
C, a, b, c such that
N = 10 4 A2 + 10 2 B 2 + C 2 = (10 2 a + 10b + c) 2 , where each of A, B, C exceeds 3, and so a
and c are positive. Since 102 B2 + C2 < 104 we can write.
104A 2 < (102 a + 10b + c)2 < 104 A2 + 104 < 104 (A + 1)2 .
Taking square roots we obtain

6/13 Your Hard Work Leads to Strong Foundation

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

100A < 100 a + 10b + c < 100A + 100, from which it follows than A = a. Now consider.
M = N – 104A 2 = (102a + 10b + c)2 – 104 a2 .
= 103 (2ab) + 102 (b 2 + 2ac) + 10 (2bc) + c2 .
Since M has only four digits, 2ab < 10, which implies that ab £ 4. Thus either (i) b = 0, or (ii)
a = 4 and b = 1. In case (ii),
N = (410 + c)2 = 168100 + 820 c + c2 .
If c = 1 or 2, the middle two digits of N form a number exceeding 81, hence not a square. If
c ³ 3, then the left most two digits of N are 17. Therefore case (i) must hold, and we have
N = (102a + c)2 = 104a2 + 102(2ac) + c2 .
Thus a ³ 4, c ³ 4 and 2ac is an even two-digit perfect square. It is now easy to check that either
a = 8, c = 4, N = 646416, or a = 4, c = 8, N = 166464.
14. Vishwa is walking up a stair that has 10 steps and with each stride he goes up either one step or
two steps. The number of different ways Vishwa can go up the stars is______.
Ans. 89
Sol. Solution 1: The number of different ways in which Vishwa can climb 10 steps with each stride of
one or two steps is the same as the number of ways in which we can write 10 as a sum of 1’s
and 2’s. The number of 2’s in the sum can be 0, 1, 2, 3, 4 or 5. If there are no 2’s, then there
is only one way to wirte 10 as a sum: 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1. If there is one 2,
then we must have 8 1’s and the number of ways of expressing 10 as a sum of 8 1’s and one 2

9!
is the same as arranging these in a row. This is clearly . The following table gives the
1!8!
number of ways for the different number of 2’s in the sum:
Number of 2's 0 1 2 3 4 5
Number of ways 1 9! 8! 7! 6! 1
=9 = 28 = 35 = 15
1!8! 2!6! 3!4! 4!2!
Hence the number of ways equals 1 + 9 + 28 + 35 + 15 + 1 = 89.
Solution 2: Let an denote the number of ways in which Vishwa can climb n steps taking one or
two steps in each stride. Either Vishwa can take one step in the first stride or two steps. If he
takes one step in the first stride, he can climb the rest of the n – 1 steps in an – 1 ways and if the
takes two steps in the first stride, he can climb the rest of n – 2 steps in an – 2 ways. Thus we have
an = an – 1 + an – 2 . Since a1 = 1 and a2 = 2, the successive an are given by
16, 2, 3, 5, 8, 13, 21, 34, 55, 89
Thus he can climb 10 steps in 89 ways.
15. Given a set of r points in the plane so that no three are collinear, by a closed polygon we mean
the polygon obtained by connecting them by r line segments as shown in the examples below in
Figure 1 (here r = 5).

Your Hard Work Leads to Strong Foundation 7/13

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

Figure 1
There are 10 points on a plane no three of which are
collinear. If the number of 5 sided closed polygons whose vertices are among these 10 points is

P
P then determine .
252

Ans. 12
Sol. Let us first find how many 5 sided closed polygons can be formed using 5 points. Let us name
the points 1, 2, 3, 4, 5. We can connect 1 to any of the remaining 4 points, and connect that
point to any of the remaining 3 points etc. and finally connect the last point to 1. Thus we can
have 4 × 3 × 2 × 1 = 24 polygons. Thus any permutation of 2, 3, 4, 5 gives a polygon. For
example, the permutation 3 2 4 5 gives raise to the polygon shown
2
3
1

4
5
above. However, the same polygon is also the result of the permutation 5, 4, 3, 2. Thus every
golygon is counted twice and hence the number of distinct polygons that could bo formed with 5

points is 12. Now, we can choose 5 points from 10 points in ( 10

C5 ) = 252 ways and for each

such choice we have 12 polygons. Thus the total number of polygons with 10 points is 252 × 12
= 3024.

P 252 ´ 12
Therefore = = 12
252 252

16. Given any 4-digit positive integer x not ending in ‘0’ we can reverse the digits to obtain another
4-digit integer y. For example if x is 1234 then y is 4321. How many possible 4-digit integers x
are there if y – x = 3177?
Ans. 48

Sol. Let x = abcd and y = dcba where a, d ¹ 0. Then

y – x = 1000 × d – d + 100 × c – 10 × c + l0 × b – 100 × b + a – 1000 × a
= 999(d – a) + 90(c – b) = 9 (111(d – a) + 10(c – b)).
So we have 111(d – a) + 10(c – b) = 353. Consider the remainder modulo 10, we obtain d – a
= 3, which implies that c – b = 2. Thus the values of a and b determines the values of d and c
respectively.

8/13 Your Hard Work Leads to Strong Foundation

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

a can take on any value from 1 to 6, and b can take any value from 0 to 7, giving 6 × 8 = 48
choices.
17. How many even positive integers ‘n’ divide (312 – 1) exactly but do not divide (3k – 1) exactly
for any positive integer k < 12.
Ans. 47
Sol. (312 – 1) = (36 – 1) (36 + 1) = 728 × 730
= 24 × 5 × 7 × 13 × 73
Total number of divisors is 5 × 2 × 2 × 2 × 2 = 80. Out of these 16 are odd numbers. So we
have 64 even divisors. Out of these 2, 2 2 , 23, 24 are divisors of 34 – 1 = 80. Also
2 × 5, 22 × 5, 23 × 5, 24 × 5, 2 × 13, 2 × 7, 22 × 13, 22 × 7, 23 × 13, 23 × 7, 2 × 7 × 13, 22 ×
7 × 13, 23 × 7 × 13 are divisors of 34 – 1 or 36 – 1. Totally 17 numbers are divisors of 3k – 1,
k = 1, 2×××11.
\ Rest of the 47 i.e., (64 – 17) are the required number of divisors.
18. If the number of first 1000 positive integers which can be expressed in the form of

N
[2x] + [4x] + [6x] + [8x] is N, then find
12
where x is a real number, and [z] denotes the greatest integer less than or equal to z?
Ans. 50
Sol. Introduce the notation
f(x) = [2x] + [4x] + [6x] + [8x], (1)
and observe that if n is a positive integer, then from (1)
f(x + n) = f(x) + 20n (2)
follows. In particular, this means that if an integer k caa be expressed in the form f(x0 ) for some
real number x0, then for n = 1, 2, 3,... one can express k + 20n similarly; i.e., k + 20n = f(x0 ) +
20n = f(x0 + n). In view of this, one may restrict attention to determining which of the first 20
positive integers are generated by f(x) as x ranges through the half-open interval (0, l].
Next observe that as x increases, the value of f(x) changes only when either 2x, 4x, 6x or 8x
attains an integral value, and that the change in f(x) is always to a new, higher value. In the
interval (0, 1] such changes occur precisely when z is of the form m/n, where 1 £ m £ n and
n = 2, 4, 6 or 8. There are 12 such fractions; in increasing order they are:
1 1 1 1 1 1 1 1 1 1 1
, , , , , , , , , , and 1.
8 6 4 3 8 2 8 3 4 6 8
Therefore, only 12 of the first 20 positive integers can be represented in the desired form. Since
1000 = (50)(20), in view of (2), this implies that in each of the 50 sequences,
1, 2, 3,..., 20; 21, 22, 23,..., 40; ... ; 981, 982, 983, ... , 1000,
of 20 consecutive integers only 12 can be so expressed, leading to a total of (50)(12) = 600 = N

N 600
therefore, = = 50
12 12

Your Hard Work Leads to Strong Foundation 9/13

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

19. Let m be the smallest positive integer whose cube root is of the form n + r, where n is a positive
integer and r is a positive real number less than 1/1000. Find n.
Ans. 19
Sol. We solve the equivalent problem of finding the smallest positive integer n for which
n3 + 1 < (n + 10–3 )3 . (1)
This is equivalent to the given problem because

n < 3
m < n + 10 Û n < m < (n + 10 ) ,
–3 3 –3 3

and because if some integer m satisfies the double inequality on the right above, then n 3 + 1 is
the smallest such m.
Rewriting (1) in the form
1000 n 1
< n2 + + ,
3 1000 3,000, 000
we observe that n2 must be near 1000/3, for the contributions of the other two terms on the right
side of (2) are relatively small. Consequently, since 18 2 < 1000/3 < 19 2 , we expect that either
n = 18 or n = 19. In the first case, (2) is not satisfied; this can be verified by an easy calculation.
It is even easier to show that n = 19 satisfies (2), so it is the smallest positive integer with the
desired property. The corresponding m = 19 3 + 1 = 6860 is the smallest positive integer whose
cube root has a positive decimal part which is less than 1/1000.
20. Let [r, s] denote the least common multiple of positive integers r and s. Find the number of
ordered triples (a, b, c) of positive integers for which [a, b] = 1000, [b, c] = 2000, and [c, a] =
2000.
Ans. 70
Sol. Since both 1000 and 2000 are of the form 2 m5 n , the numbers a, b and c must also be of this
form. More specifically,
a = 2m1 5n 1 , b = 2m2 5n 2 , c = 2m3 5n 3 , (1)
where the mi and n i are non-negative integers for i = 1, 2, 3.
Then, in view of the definition of [r, s], and since
[a, b] = 23 53, [b, c] = 24 53, [c, a] = 24 53 , (2)
the following equalities must hold:
max{m1 , m2} = 3, max{m2 , m3 } = 4, max(m3, m1 ) = 4, (3)
and max{n1, n2} = 3, max{n2 , n3 } = 3, max{n3 , n1 } = 3. (4)
To satisfy (3), we must have m 3 = 4, and either m 1 or m2 must be 3, while the other one can take
the values of 0, 1, 2, or 3. There are 7 such ordered triples, namely (0, 3, 4), (1, 3, 4), (2, 3, 4),
(3, 0, 4), (3, 1, 4), (3, 2, 4) and (3, 3, 4).
To satisfy (4), two of n1 , n2 and n3 must be 3, while the third one ranges through the values of
0, 1, 2 and 3. The number of such ordered triples is 10; they are (3, 3, 0), (3, 3, 1), (3, 3, 2),
(3, 0, 3), (3, 1, 3), (3, 2, 3), (0, 3, 3), (1, 3, 3), (2, 3, 3) and (3, 3, 3).
Since the choice of (m 1 , m2, m3 ) is independent of the choice of (n1 , n2, n3 ), they can be chosen
in 7 × 10 = 70 different ways. This is the number of ordered triples (a, b, c) satifying the given

10/13 Your Hard Work Leads to Strong Foundation

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

conditions.
21. Determine the number of five-digit integers (37abc) in base 10 such that each of the numbers
(37abc), (37bca) and (37cab) is divisible by 37.
Ans. 28
Sol. If x, y and z are numbers whose base 10 representations are (abc), (bca) and (cab), respectively,
then one can easily verify that
10x – y = 999a, 10y – z = 999b, 10z – x = 999c. (1)
Since 999 is a multiple of 37, it follows from (1) that if any one of x, y or z is divisible by 37,
then so are the others. Consequently, one may resjtrict attention to multiples of 37 of the desired
form. These are: 37000, 37037, 37074, 37111, 37999. Since 999 = 27 × 37, there are 28 of them.
22. Find all 7 digit numbers formed by using only the digits 5 and 7 and divisible by both 5 and 7.
Ans. 09
Sol. The last digit has to be 5 in order that the number is divisible by 5. WE note that a 7-digit number
N ending with 5 and formed using only the digits 5 and 7 is divisible by 7 if and only if
the number obtained from N by replacing 7 by 0 is divisible by 7. For instance is divisible by 7
iff 5000505 is divisible by 7. Each of such numbers is got by adding some of the numbers from
the set 50,500,5000,50000,500000,5000000 along with 5. Reading modulo 7 this set is 1,3,2,6,4,5
so we have to look for those combinations which ad upto 2, since the last digit is 5. These
combinations are 2, 3,6, 4,5, 2,3,4, 1,3,5, 1,2,6, 2,3,5,6, 1,4,5,6 and 1,2,3,4,6. These
combinations give the following number.
7775775, 7757575, 5577775, 7575575, 5777555, 7755755, 5755575, 5557755, 7555555
23. We say that a number is arithmetically sequenced if the digits, in order, form an arithmetic
sequence. Compute the number of 4-digit possitive integers which are arithmetically sequenced.
Ans. 30
Sol. There are 9 numbers with an arithmetic sequence of difference 0 (1111 through 9999). There are
6 with an arithmetic sequence of difference 1 (1234 through 6789). There are 3 with an arithmetic
sequence of difference 2(1357 through 3579). There are 7 with an arithmetic sequence of
difference – 1 (3210 through 9876). There are 4 with an arithmetic sequence of difference – 2
(6420 through 9753), and there is 1 with a difference of –3 (9630). The answer is therefore 9 +
6 + 3 + 7 + 4 + 1 = 30

24. Find the number of even digit in the product of the two 10-digit numbers
2222222222 × 9999999999.
Ans. 10
Sol. 2222222222 × (10 10 – 1) = 22222222220000000000 – 2222222222
= 222222222177777777778.

1
25. Consider the function f(x) = x . Find the value of
3 + 3

3 [f(–5) + f(–4) + f(–3) + f(–2) + f(–1) + f(0) + f(1) + f(2) + f(3) + f(4) + f(5) + f(6)]

Your Hard Work Leads to Strong Foundation 11/13

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

Ans. 06

1 1 3 3x 3x + 3 1
Sol. f(x) + f(1–x) = x + 1-x x + x = x =
3 + 3 3 + 3 3 + 3 +3 3+3 + 3 3+3 3 3

Therefore,

3 [f(–5) + f(6)] + 3 [f(–4) + f(5)] + 3 [f(–3) + f(4)]

+ 3 [f(–2) + f(3)] + 3 [f(–1) + f(2)] + 3 [f(0) + f(1)]

æ 1 1 1 1 1 1 ö
3ç + + + + + ÷ = 6
è 3 3 3 3 3 3ø

n2 - 9
26. How many positive integers n, where 10 £ n £ 100, are there such that is a fraction in its
n2 - 7
lowest terms?
Ans. 46
Sol. gcd(n 2 – 9, n 2 – 7) = 1 Þ gcd(n 2 – 9, 2) = 1. Hence n 2 – 9 must be an odd number Þ

100 - 10
n is even. Since 10 £ n £ 100, there are +1 = 46 possible positive integers n.
2

27. Consider the 800-digit integer

234523452345×××2345.
The first m digits and the last n digits of the above integer are crossed out so that the sum of the

m+n
remaining digits is 2345. Find the value of .
10

Ans. 13
Sol. Note that 2 + 3 + 4 + 5 = 14. Thus the sum of the 800 digits is 200 × 14 = 2800. Thus we need
to cross out digits with a sum equal to 2800 – 2345 = 455.
Observe that 455 = 32 × 14 + 7. Thus we have to cross out 32 blocks of four digits ‘2345’
either from the front or the back, a ‘2’ from the front that remains and a ‘5’ from the back that
remains. Thus, m + n = 32 × 4 + 2 = 130.

28. Let A = {1, 2, 3, 4,..., 1000}. Let m be the number of 2 element subsets {a, b} of A such that

a × b is divisible by 6. Find the value of é

M ù
ê10000 ú . (Here [x] denotes the greatest integer less than
ë û
or equal to x.)
Ans. 20
Sol. Let
A6 = {k Î A : 6 | k}; A2 = {k Î A : 2 | k, 6 k}, A3 = {k Î A : 3|k, 6 k}.

12/13 Your Hard Work Leads to Strong Foundation

 PRE REGIONAL MATHEMATICS OLYMPIAD MOCK TEST-2

Note that

é1000 ù é1000 ù é1000 ù

|A6| = ê ú = 166; |A2| = ê ú-ê ú = 334;
ë 6 û ë 2 û ë 6 û

é1000 ù é1000 ù
|A3 | = ê ú-ê ú = 167.
ë 3 û ë 6 û
For the product a × b to be divisible by 6, either (i) one or both of them are in A6 or (ii) one is
in A2 and the other is in A3. Hence

m = ( 166
C2 ) + 166 × (1000 – 166) + 334 × 167 = 207917.

8n3 - 96n2 + 360n - 400

29. Let S be the set of all integers n such that is an integer. Find the value of
2n - 7

å| n | .
nÎS

Ans. 50

8n3 - 96n2 + 360n - 400 27

Sol. Note that = 4n 2 – 34n + 61 + . Since 4n2 – 34n + 61 is an integer
2n - 7 2n - 7
for all integers n we must have that 27 divisible by 2n – 7.
Hence, 2n – 7 = –1, 1, –3, 3, –9, 9 –27, 27, so that n = 3,4,2,5, –1,8,–10,17. Hence the required
sum equals 50.
30. Determine the number of ordered pairs of positive integers (a, b) satisfying the equation
100(a + b) = ab – 100.
(Note: As an illustration, (1, 2) and (2, 1) are considered as two distinct ordered pairs.)
Ans. 18

100a + 100
Sol. Solving for b, we get b = . Since a and b are positive, we must have a > 100. Let a =
a - 100

100(100 + m) + 100 10100

100 + m, where m is a positive integer. Thus b = = 100 + . Therefor m
m m
must be a factor of 10100 = 101 × 22 × 52. Conversely, each factor r of m determines a unique

10100
solution (a, b) = (100 + r, 100 + ) of the equation 100(a + b) = ab – 100. There are 18 =
r
(1 + 1) (2 + 1) (2 + 1) factors of 10100. Consequently there are 18 solutions of the given
equation. In fact, these 18 solutions can be found to be (a, b) = (101, 10200), (102,5150),
(104,2625), (105,2120), (110,1110), (120, 605), (125,504), (150,302), (200, 201), (201,200),
(302,150), (504, 125), (605, 120), (1110, 110), (2120, 105),
(2625, 104) (5150, 102), (10200, 101).

Your Hard Work Leads to Strong Foundation 13/13