1

International Mathematical Olympiad

Preliminary Selection Contest 2004 Hong Kong

Outline of Solutions

Answers:
1. 8 2. 10
3.
3
2
N
4. 49894
5.
1 1
2 2004!
6.
4011
4010

7. 63 8. 171
9. 5 10. 103
11.
3007
2

12. 280616
13. 2 + 14. 35 15. 603 16. 2475
17. 7 18. 540
19. 3 : 2
20. 518656

Solutions:

1. A total of
8
3
56 C triangles can be formed by joining any three vertices of the cuboid. Among
these, if any two vertices of a triangle are adjacent vertices of the cuboid, the triangle is right-
angled. Otherwise, it is acute angled. To see this latter statement, note that if the dimensions of
the cuboid are p q r , then we can find from the cosine law that the cosines of the angles of
such a triangle will be equal to
2
2 2 2 2
( )( )
p
p q p r + +
,
2
2 2 2 2
( )( )
q
q p q r + +
and
2
2 2 2 2
( )( )
r
r p r q + +
,
which are all positive.
For each fixed vertex (say A), we can form 6 triangles which are right-angled at A (two on each
of the three faces incident to A). Thus the answer is 56 6 8 8 .

2. Let the total weight of the stones be 100. Then the weight of the three heaviest stones is 35 and
that of the three lightest stones is
5
(100 35) 25
13
. The remaining 6 N stones, of total
weight 100 35 25 40 , has average weight between
25
3
and
35
3
. Since
35
40 3
3
> and
2
25
40 5
3
< , we must have 6 4 N , from which the answer 10 N follows.

3. From the first equation, we have 2 2 [ ] y N x + , which is an integer. Hence y is either an
integer or midway between two integers. The same is true for x by looking at the second
equation. Hence, either [ ] x x or
1
[ ]
2
x x , and either [ ] y y or
1
[ ]
2
y y .
If x and y are both integers, [ ] x x and [ ] y y . Solving the equations, we get
4
3
x N and
1
3
y N + which are not consistent with our original assumptions.
If x is an integer and y is midway between two integers, [ ] x x and
1
[ ]
2
y y . Solving the
equations, we have
5
3
x N and
1
6
y N + which are not consistent with our original
assumptions.
Similarly, if x is midway between two integers and y is an integer, we have
1
[ ]
2
x x and
[ ] y y . Solving the equations, we have
7
6
x N and
2
3
y N + which are again not
consistent with our original assumptions.
Finally, if x and y are both midway between two integers, we have
1
[ ]
2
x x and
1
[ ]
2
y y .
Solving the equations, we have
3
2
x N and
1
2
y N + . This gives the correct answer.

4. Let the answer be . abcba Note that
10001 1010 100 101(99 10 ) 2 abcba a b c a b c a c + + + + +
For the number to be divisible by 101, we must have 2 0 a c . For the number to be largest,
we may take 4 a , 8 c and 9 b . This gives the answer is 49894.

5. Note that
2 1 1 1 1
! ( 1)! ( 2)! !( 2) ( 2)! ( 1)! ( 2)!
k k
k k k k k k k k
+ +

+ + + + + + + +
.
Hence
3
3 4 2004
1! 2! 3! 2! 3! 4! 2002! 2003! 2004!
1 1 1 1 1 1
2! 3! 3! 4! 2003! 2004!
1 1
2 2004!
+ + +
+ + + + + +
_ _ _
+ + +

, , ,

L
L

6. Let x a b + , y b c + and z c a + . Then
2004 ( )( )( ) )( )( )
2005 ( )( )( )
a b b c c a z y y x x z
a b b c c a xyz
(

+ + +

and hence
2 2 2
1 1 1
2 2 2 2 2 2
3 1 ( )( )( )
2 2
3 1 2004
2 2 2005
4011
4010
a b c x y z y z x z x y
a b b c c a x y z
y z z x x y
x y z
z y y x x z
xyz
+ + +
+ + + +
+ + +
_ _ _
+ +

, ,
,
1

1
]
_


,

7. Draw E such that ABCE is a parallelogram.
Since AEC = ABC = 55 and ADC =
180 31 24 = 125, we have AEC +
ADC = 180 and thus ADCE is a cyclic
quadrilateral. Now EC = AB = DC, so CDE =
CED = CAD = 31. Considering CDE, we
have ACE = 180 31 31 24 = 94. It
follows that DAB = BAC 31 = ACE
31 = 94 31 = 63.
(Alternatively, instead of drawing the point E, one can reflect B across AC and proceed in
essentially the same way.)



A
B C
E
D
55
24
31
4
8. We have
3 3
2 2
2
999973 1000000 27
100 3
(100 3)(100 100 3 3 )
97 10309
97 13 793
97 13 61


+ +




and so the answer is 97 13 61 171 + + .

9. We first note that the five primes 5, 11, 17, 23, 29 satisfy the conditions. So n is at least 5.
Next we show that n cannot be greater than 5. Suppose there are six primes satisfying the
above conditions. Let a be the smallest of the six primes and let d be the common difference of
the resulting arithmetic sequence. Then d must be even, for if d is odd then exactly three of the
six primes are even, which is not possible. Similarly, d must be divisible by 3, for otherwise
exactly 2 of the six primes are divisible by 3, which is not possible.
Moreover, if d is not divisible by 5, then at least one of the six primes must be divisible by 5.
Therefore 5 is one of the primes picked. But we have shown that d is divisible by 6, so 5 is the
smallest among the six primes. But then the largest of the six primes, 5 5d + , is also divisible
by 5 and is larger than 5. This is absurd.
Hence d is divisible by 2, 3 and 5, hence divisible by 30. So the largest of the 6 primes, which
is 5 a d + , must be larger than 150, a contradiction. It follows that the answer is 5.

10. By setting (0) 1 p , we may write (000) (001) (002) (999) (000) S p p p p p + + + + L . Since
we are now computing the product of non-zero digits only, we may change all the 0s to 1s,
i.e. (111) (111) (112) (999) (111) S p p p p p + + + + L . Each term is the product of three
numbers, and each multiplicand runs through 1, 1, 2, 3, 4, 5, 6, 7, 8, 9 (note that 1 occurs twice
as all 0s have been changed to 1s). Hence we see that
3
2
2
2
(1 1 2 3 9) (1 1 2 3 9) (1 1 2 3 9) 1
46 1
(46 1) (46 46 1)
3 5 2163
3 5 3 7 103
S + + + + + + + + + + + + + + +

+ +


L L L

It follows that the answer is 103.

5
11. Using
1 1 1
,
( 1) 1 k k k k

+ +
we have
1 1 1 1 1
1
2 3 4 2003 2004
1 1 1 1 1
1 2
2 2004 2 4 2004
1 1 1 1
1 1
2 2004 2 1002
1 1 1
1003 1004 2004
A + + +
_ _
+ + + + + +

, ,
_ _
+ + + + + +

, ,
+ + +
L
L L
L L
L

Consequently,
1 1 1 1 1 1
2
1003 2004 1004 2003 2004 1003
3007 3007 3007
1003 2004 1004 2003 2004 1003
3007
A
B
_ _ _
+ + + + + +

, , ,
+ + +

L
L
It follows that
3007
2
A
B
.

12. If a b is odd, both digits are odd and we have 5 5 25 choices. If it is even, we have
9 9 5 5 56 choices (note that both digits cannot be zero). The same is true for the
quantities c d and e f .
Now, for condition (b) to hold, either all three quantities a b , c d and e f are even, or
exactly two of them are odd. Hence the answer is
3 2
56 3 56 25 280616 + .

13. Observe that the graph is symmetric about the
x-axis and the y-axis. Hence we need only
consider the first quadrant. In the first quadrant,
the equation of the graph can be written as
2 2
x y x y + + , or
2 2
1 1 1
2 2 2
x y
_ _
+

, ,
,
which is a circle passing through (0, 0), (1, 0)
and (0, 1). By symmetry, the whole graph can
be constructed as shown.
Now the area bounded by the curve can be
thought of as a square of side length 2 plus
four semi-circles of diameter 2 . Its area is
1
1 1
y
1
x
6
( )
2
2
1 2
2 4 2
2 2

_
+ +


,
.

14. Using the identity
3 3 3 2 2 2
1
3 ( ) ( ) ( ) ( )
2
a b c abc a b c a b b c c a 1 + + + + + +
]
,
we have
3 3 3 3 3 3
2 2 2
99 33 ( 33) 3 ( 33)
1
( 33)[( ) ( 33) ( 33) ]
2
m n mn m n mn
m n m n m n
+ + + +
+ + + + +

For this expression to be equal to 0, we either have 33 m n + or 33 m n . The latter gives
one solution (33, 33) while the former gives the 34 solutions (0, 33), (1, 32), , (33, 0).
Hence the answer is 35.

15. Let ( ) f n be the number of significant figures when 2
n
is written in decimal notation. Then
( ) ( 1) f n f n + when n is lucky, and ( ) 1 ( 1) f n f n + + otherwise. Now (2) 2 f , and we
want to compute (2004) f . We first note that
2004
2004
2004
5
2
10

,
so (2004) f is equal to the number of digits of
2004
5 . Now
2004
log5 2004(1 log 2) 2004 (0.7 0.001) 1402.8 2.004 1400.796 ,
so
2004
5 has 1401 digits. It follows that the number of lucky numbers less than 2004 is equal to
2004 1401 603 .

16. Let n be such a number. Since 3n is divisible by 3, the sum of the digits of 3n is divisible by 3.
But the sum of the digits of 3n is the same as the sum of the digits of n, so the sum of digits of
n is divisible by 3, i.e. n is divisible by 3. As a result, 3n is divisible by 9, so the sum of digits
of 3n is divisible by 9. Again, the sum of the digits of 3n is the same as the sum of the digits of
n, so the sum of digits of n is divisible by 9, i.e. n is divisible by 9.
Let n abcd . Since n is to be divisible by both 9 and 11, a b c d + + + is divisible by 9 and
( ) ( ) a c b d + + is divisible by 11. Considering the parities of a c + and b d + we see that
a b c d + + + has to be equal to 18 with 9 a c b d + + .
The rest is largely trial and error. Noting that a can be no larger than 3, we have the
possibilities (a, c) = (1, 8); (2, 7) or (3, 6). Considering the digits, the only possibilities for n
7
are 1287, 1386, 1485, 2079, 2475, 2574, 3465, 3762 and 3861. Among these, we find that only
2475 n works as 3 7425 n in this case.

17. Note that (10 1)
n
b a + , so .
1 10
2
a a
b
n
+
Let this be an integer d. Noting that
1
10 10
n n
a

<
and 1 n > , we must have 1 11 d < < . Since 10 1
n
+ is not divisible by 2, 3 and 5, the only
possible value of d is 7. Indeed, when 143 a , we have 143143 b and 7 d .

18. By the AM-GM inequality,
( )( )
2 2 2 2
9tan cot 2 9tan cot 6 x x x x + . It follows that the
minimum value of the right hand side is 1. On the other hand, the maximum value of the left
hand side is 1. For equality to hold, both sides must be equal to 1, and we must have
2 2
9tan cot x x (which implies
1
tan
3
x t ), cos12 1 x and sin3 1 x .
For
1
tan
3
x t , the solutions are x = 30, 150, 210, 330.
For cos12 1 x , the solutions are x = 0, 30, 60, , 330, 360.
For sin3 1 x , the solutions are x = 90, 210, 330.
Therefore the equation has solutions x = 210, 330 and so the answer is 210 330 540 + .

19. Let [DEF] = 2.
Since : 3: 2 CD DE , [FCD] = 3.
Since : 1: 2 AB BC , [FBD] = 1.
Since EF = FG, [GFD] = [DEF] = 2.
So [GBF] = 1 = [FBD], i.e. GB = BD.
Together with GF = FE, BF // CE.
Hence : : 1: 2 AF FD AB BC .
Let GB BD x , AF = y, FD = 2y.
Since CAD = EGD, GAFB is a cyclic quadrilateral.
Thus DB DG DF DA , i.e. (2 ) 2 (3 ) x x y y .
As a result we have : 3 x y .
It follows that : : 2 3 : 2 BD DF x y .

A
B
C
D
E
F
G
8
20. The key observation is that ( ) ( ) f n n g n , where ( ) g n is the number of 1s in the binary
representation of n. To see this, it suffices to check that for non-negative integers
1 2 k
a a a < < < L and
1 2
2 2 2
k
a a a
n + + + L , we have
2
2 2 2
k
a
n n n
n k
1 1 1
+ + +
1 1 1
] ] ]
L .
Such checking is straightforward.
Next we try to compute (0) (1) (1023) g g g + + + L . Note that the binary representations of 0
and 1023 are respectively 0000000000 and 1111111111, so as n runs through 0 to 1023, ( ) g n
is equal to 5 on average. Since (0) 0 g , we have
(1) (1023) 5 1024 5120 g g + + L .
Now we have
[ ]
(1) (2) (1023) (1 2 1023) (1) (2) (1023)
1023 1024
5120
2
512 (1023 10)
518656
f f f g g g + + + + + + + + +

L L L