Bulgaria International

Mathematics Competition 2023

(Virtual)
Bulgaria, 1st to 7th July 2023
Invitational World Youth Mathematics Intercity Competition

Individual Contest
Section A.
In this section, there are 12 questions. Fill in the correct answer in the space
provided at the end of each question. Each correct answer is worth 5 points.
1. Let x be some real number, and y = 3x + 4 + 4 − 3x .
What is the minimum possible value of y 2 ?【Submitted by Singapore】
【Solution】
4 4
From 3x + 4  0 and 4 − 3x  0 , we can obtain the domain of x: −  x  .
3 3
To find the minimum value of y,
y 2 = ( 3x + 4 + 4 − 3x )2 = 8 + 2 (3x + 4)(4 − 3x)
4 4
So the minimum value of y 2 is 8 when x = − or .
3 3
Answer：8
2. A circle of radius 1 cm is drawn touching the three
edges of an equilateral triangle. Starting from this
circle, three infinite sequences of smaller circles are
then drawn, one at each corner, such that each circle
touches tangentially the previous circle and two of the
edges of the triangle, as shown in the diagram below.
What is the sum of the circumferences, in cm, of all
the circles? (Take  = 3.14 )【Submitted by Nepal】
【Solution 1】
Since the triangle is an equilateral triangle, its each angle
is 60 . The triangle ABC and FEC are right angled
triangles where ACB = 30 .
EF AB 1
So = = , i.e. CE = 2 EF and BC = 2 AB = 2 cm.
CE BC 2
Since BC = BD + CD = 1 + DE + CE = 1 + EF + CE = 1 + 3EF ,
BC − 1 2 − 1 1 B
EF = = = . So we know
3 3 3 D
Radius of first circle is 1 cm, E 1

C F A
 1
Radius of second circle is cm,
3
1
Radius of third circle is cm and so on.
9
The sum of circumferences is
1 1 1 1 1 1
2  1 + 3  2  + 3  2  + 3  2  + ... = 2 + 6 ( + + + ...)
3 9 27 3 9 27
1 3
= 2 + 6  
3 2
= 5
= 15.7cm
【Solution 2】
Since the triangle is an equilateral triangle, its each angle is 60 .
The triangle ABC and FEC are right angled triangles where
ACB = 30 , so BC = 2 cm. Note that the line segment
CD consists of the diameters of all the touching circles
between the circle with centre B and vertex C (excluding
the circle with centre B itself), thus the total diameter of
B
these circles is CD = BC − BD = 2 − 1 = 1cm.
Since there are 3 such sets of touching circles (one set for D
each vertex of the equilateral triangle), the total diameter E 1
of all circles, including the circle with centre B, is
C F A
1 3 + 2 = 5 cm, and therefore their total area is
5 = 15.7 cm.
Answer： 15.7 cm
3. Let ABCDEF and AGHIJK be two regular hexagons that do not overlap, as
shown in the diagram below. Assume that FAK = 90 and that the areas satisfy
3  [ AGHIJK ] = 4  [ ABCDEF ] . What is the ratio of [ ABG]:[ AGHIJK ] ?
(Note: [P] denotes the area of polygon P.)【Submitted by Mexico】

H I

G
J
B
C
A K

D F
E
【Solution】 H I
The ratio between the areas of the two hexagons is 3 : 4.
Therefore the ratio between the side lengths is 3 : 2.
It is clear that triangle ABG is a 30 − 60 − 90 G
J
triangle with hypotenuse AG. B
We divide the regular hexagon AGHIJK into 12
equal triangles, as shown in the diagram, each is C
A K
congruent to triangle ABG,
hence [ ABG]:[ AGHIJK ] = 1:12 .
Answer： 1:12 D F

4. The 53-digit number E

37,984,318,966,591,152,105,649,545,470,741,788,308,402,068,827,142,719
can be expressed as n21 , where n is a positive integer. What is the value of n?
【Submitted by Thailand】
【Solution】
Since 10021 = 1042  n21  1063 = 100021 , so n is a 3–digit number.
Consider 30021 = 321 1042 = 3  910 1042  3 1052  n21
and 40021 = 421 1042 = 4 1610 1042  4 1052  n21 .
Therefore, 300  n  400 .
Since the unit digit of n21 is 9, the unit digit of n is 9.
Since 3 − 7 + 9 − 8 + 4 − 3 + ... + 7 − 1 + 9 = 0 , so n is divisible by 11.
Therefore, n = 319 .
Answer： 319
5. Consider the equation 10 y − 9 x = y , where x and y are integers. If m is the
2 2022 4

greatest possible value of x + y and n is the number of solutions (x, y), what is
m + n ?【Submitted by Indonesia】
【Solution 1】
Observe that (x, y) = (0, 0) is a solution.
The equation above can be rewritten as:
10 y 2 − 9 x 2022 = y 4
9 x 2022 + y 4 − 10 y 2 + 25 = 25
(3x1011 )2 + ( y 2 − 5)2 = 25
Since x and y are integers, so the possible solutions for the equation are
(3x1011 )2 = 9 and ( y 2 − 5)2 = 16 .
Since (3x1011 )2 = 9 , we know 3x1011 = 3. So x = −1 or 1.
Since ( y 2 − 5)2 = 16 , we know y 2 − 5 = 4 . So y = −3 , −1, 1 or 3.
The greatest possible for x + y is for x = 1 and y = 3 , and thus m = 1 + 3 = 4 .
The possible number of pairs of (x, y) is n = 1 + 8 = 9 .
Thus, we get m + n = 4 + 9 = 13 .
【Solution 2】
y 4 = 10 y 2 − 9 x 2022
9 x 2022 = 10 y 2 − y 4
9 x 2022 = y 2 (10 − y 2 )
Since 9x2022  0 and y 2  0 , we have 10 − y 2  0 . Therefore, y = 0 , 1, −1, 2, −2 ,
3 or −3 .
For y = 0 , we get x = 0 and we have one solution
For y = 1 or −1 , we get 10 − 9x2022 = 1 . Thus 9x2022 = 9 and we have x = 1 or
−1. So we have the solutions (1, 1), (1, −1), ( −1, 1) and ( −1, −1).
For y = 2 or −2 , we get 40 − 9x2022 = 16 . Thus 9x2022 = 24 which has no solution.
For y = 3 or −3 , we get 90 − 9x2022 = 81 . Thus 9x2022 = 9 and we have x = 1 or
−1. So we have the solutions (3, 1), (3, −1), ( −3 , 1) and ( −3 , −1).
The maximum value of m = x + y is 3 + 1 = 4 . And there are n = 1 + 4 + 4 = 9
solutions. Thus m + n = 4 + 9 = 13 . Answer：13
6. Let a, b and c be three non-zero real numbers that satisfy a + b + c = 0 . What is
a4 b4 c4
the value of S = 4 + + ?【Submitted
a − (b2 − c2 )2 b4 − (c2 − a2 )2 c4 − (a2 − b2 )2
by Vietnam】
【Solution】
Lemma If a + b + c = 0 , then a3 + b3 + c3 = 3abc .
Proof:
a3 + b3 + c3 − 3abc = (a + b + c)(a 2 + b2 + c 2 − ab − bc − ca)
= 0  (a 2 + b2 + c 2 − ab − bc − ca) = 0

a 4 − (b2 − c 2 )2 = (a 2 + b2 − c 2 )(a 2 + c 2 − b2 )
= ((a + b)2 − 2ab − c 2 )((a + c)2 − 2ac − b2 )
= (c 2 − 2ab − c 2 )(b2 − 2ac − b2 )
= 4a 2bc
Alternatively,
a 4 − (b2 − c 2 )2 = a 4 − (b + c)2 (b − c)2
= a 4 − (−a)2 (b − c)2
= a 2 (a + b − c)(a − b + c)
= a 2 (a + b + c − 2c)(a + b + c − 2b) = a 2 (−2c)(−2b) = 4a 2bc
a4 a4 a3 b4 b3
Therefore 4 = = . Similarly, 4 = ,
a − (b2 − c 2 )2 4a 2bc 4abc b − (c 2 − a 2 )2 4abc
c4 c3
= . Now, from the above lemma, we have:
c4 − (a 2 − b2 )2 4abc
 a3 + b3 + c3 3abc 3
S= = = .
4abc 4abc 4
3
Answer：
4
7. If a number can be expressed as 2 + 2 , where a, b are non-negative integers
a b

and a  b , then this number is called a “Lucky number.” Suppose all lucky
numbers are listed in increasing order. What is the 64th lucky number?
【Submitted by China】
【Solution】
Observe that the lucky numbers are the numbers with exactly two 1’s in the base-2
numeral system.
The 1st lucky number is 112 = 21 + 20 = 3 ,
the 2nd lucky number is 1012 = 22 + 20 = 4 + 1 = 5 ,
the 3rd lucky number is 1102 = 22 + 21 = 4 + 2 = 6 ,
the 4th lucky number is 10012 = 23 + 20 = 8 + 1 = 9 ,
the 5th lucky number is 10102 = 23 + 21 = 8 + 2 = 10 ,
the 6th lucky number is 11002 = 23 + 22 = 8 + 4 = 12 ,
the 7th lucky number is 100012 = 24 + 20 = 16 + 1 = 17 ,
…
To find the 64th lucky number, we need to confirm the number of digits of the 64th
lucky number first. Assume the number of digits of the 64th lucky number is m + 1.
We can observe that
1 + 2 + 3 + ... + (m − 1)  64  1 + 2 + 3 + ... + (m − 1) + m
m(m − 1) m(m + 1)
 64 
2 2
m(m − 1)  128  m(m + 1)
1112
Since 11 10 = 110  128  11 12 = 132 , m = 11 . Then since = 66 ,
2
the 66th lucky number is 1100000000002 = 211 + 210 ,
the 65th lucky number is 1010000000002 = 211 + 29 ,
the 64th lucky number is 1001000000002 = 211 + 28 = 2048 + 256 = 2304 .
Answer：2304

8. Let ABC be an equilateral triangle whose area is 36 cm2, and EFD be an

isosceles triangle with EF = FD . The point F is the centre of triangle ABC, and
the points B and C are the midpoints of EF and FD, respectively, as shown in the
diagram below. If BG ⊥ EF and CH ⊥ DF , what is the area, in cm2, of the
shaded region?【Submitted by Indonesia】
 A

B C

E G H D
【Solution】
Since, F is the centre of ABC, so, EFD = 120 and FDE = FED = 30 .
Draw the line AI through F such that AI ⊥ ED ,
and the segments FG and FH. Since BG ⊥ EF , A
CH ⊥ DF , EB = BF and FC = CD , we
observe that BEG, BGF, CFH and CDH are
congruent 30 − 60 − 90 right triangles.
Furthermore, the triangles FGI and FIH are F
also 30 − 60 − 90 right triangles, which are
congruent to BEG, BGF, CFH, and CDH. Thus, B C
1
the area of each of them is area of EFD.
6
E H D
G I
2
Since, F is the centre of ABC, the area of ABFC is of the area of ABC and the
3
1
area of BCF is of the area of ABC.
3
Since BC//ED and EB = BF , FC = CD , the area of EFD is 4 times area of BCF or
4
of the area of ABC:
3
1 1
Area of BGE + area of CDH = area of EFD + area of EFD
6 6
1 4
= area of EFD or area of ABC.
3 9
Area of the shaded region = area of ABFC + area of BGE + area of CDH
2 4 10
= ( + ) area of ABC = area of ABC
3 9 9
10
=  36 = 40 cm2
9
Answer：40 cm2
9. A very secret company develops a hi-tech machine. There are 20 different
blueprints needed to construct it. Every employee has access to exactly 5
different blueprints and every combination of 5 different blueprints is accessible
by at least one employee. The CEO wants to distribute employees into
departments so that no department could make the machine by itself. That is,
there should not be any department where every blueprint is accessible by at
least one of its members. What is the smallest number of departments the CEO
needs to create?【Submitted by Russia】
【Solution】
Suppose there are no more than 5 departments. For every department, choose a
blueprint that is not accessible here, 5 blueprints in total. If there are less than 5
departments or some of the chosen blueprints are the same, just add random
blueprints to get 5. But, the person that has access to these 5 blueprints cannot work
in any department. Therefore, it is not possible to have 5 departments or less.
If there are 6 departments, the CEO can send the employees who do not have access
to the 1st blueprint to 1st department, the employees who do not have access to the 2nd
blueprint to the 2nd department, and so on, the employees who do not have access to
the 5th blueprint – to the 5th department. Then, there are left only those employees
who have access to blueprints 1-5. They are all sent to the last department.
Answer： 6
10. A V-Tromino is made up of three 11 squares, as diagrams shown below:

All the V-Trominos must be aligned with the board cells. What is the minimum
number of the V-Trominos needed to be placed on an 8  8 board so that one
cannot fit a 2  2 square in the remaining space?【Submitted by Singapore】
【Solution】
We colour the 8  8 board as follows:

It is clear that each V-Tromino can only block at most one of the shaded 2  2
squares, so we need at least 9 V-shapes.
There are many ways to show that 9 V-Trominos works, for example:

Answer： 9
11. There are 17 empty boxes and an infinite supply of balls. In each step, we
choose some number of boxes, then put in each chosen box a different number
of balls, where each number must be a power of 2 (including 2 to the power of
0). After k steps, it’s possible that all boxes have the same non-zero number of
balls inside. What is the smallest positive integer k to achieve this?【Submitted
by Vietnam】
【Solution】
Remark: For every n different nonnegative integers a1  a2  ...  an :
2a1 + 2a2 + ... + 2an  2an +1 −1
Let 2 m be the largest number of balls placed in a box at every step.
At each step, the total amount of balls used in that step is at most 2m+1 − 1.
On the other hand, at the end, each box must contain at least 2 m balls.
Therefore:
17  2m  k (2m+1 − 1)  k  2m+1 = 2k  2m
Thus k  9 .
We can show a valid sequence of 9 steps as follows:
Boxes 1 2 3 … 8 9 10 11 … 17

Step 1 20 21 22 … 27 28 0 0 … 0

Step 2 20 21 22 … 27 0 28 0 … 0

Step 3 21 22 23 0 0 0 28 … 0

… … … … … … … … … … …

Step 9 27 0 0 … 0 0 0 0 … 28
After 9 steps, all 17 boxes will have 28 = 256 balls.
Answer： 9
12. The diagram given below shows an underground maze in the form of a 4  4
square. A snake, initially at position P, starts crawling along the path P-Q-R-S in
a loop. A mouse, initially at position A, has to reach position B, moving across
the maze. The mouse can only move vertically up or horizontally right. If the
snake and the mouse reach the same position at the same time, the snake will eat
the mouse; also if the two cross each other along a path, the snake will eat the
mouse (the snake and the mouse move at the same speed). Given that the mouse
and the snake start moving at the same time, what is the number of safe paths for
the mouse to move from A to B? M L K J B
(For example, A-C-D-E-R-G-H-I-B is a
safe path for the mouse, since when the
mouse reaches R, the crawling snake W X Y
N I
will be at point P)【Submitted by UAE】
V P Q
O H

U S R
T G

【Solution】 A C D E F
Clearly, after 4k, 4k + 1 , 4k + 2 and 4k + 3 moves the snake will reach positions P,
Q, R and S respectively (where k = 0 , 1, 2, …).
Therefore, if the mouse reaches P in 4k moves, it will be eaten by the snake.
Similarly if it reaches Q, R and S in 4k + 1 , 4k + 2 and 4k + 3 moves respectively,
it will be eaten by the snake.
The mouse can reach S in three ways (A-C-D-S, A-C-U-S, A-T-U-S) each requires
three moves, so these paths must be avoided because the snake will also take 3 moves
to reach S.
Similarly, the mouse can reach P in three ways (A-T-U-V-P, A-T-O-V-P, A-C-U-V-P),
excluding the already counted paths that pass through S.
Now let’s analysis the paths that pass through R. If we exclude the paths that pass
through S, there is only one path (A-C-D-E-R) from A to R for the mouse, which
requires four moves and hence is a safe path as the snake will be at P when the mouse
reaches R. M L K J B
Now, if the mouse moves up from R, it will be
caught by the snake at Q. So, after the mouse
reaches R, the only safe way to get to B is to W X Y
move right, from R to G. N I
Notice that there is no path from A to Q which
does not pass through either of P, R or S. V
O H
Therefore, the effective safe network for the
mouse is as shown on the right. U R
T G

A C D E F
To count the total number of safe paths, lets consider the following cases.
Note that the safe paths either pass through M, E or W.
Paths passing through M Paths passing through E
A-C-D-E-F-G-H-I-B,
A-T-O-N-M-L-K-J-B
A-C-D-E-R-G-H-I-B
Paths passing through W
= (number of paths from A to W)  (number of paths from W to B)
= 4  4 = 16
Therefore, total number of safe paths is 3 + 16 = 19 .
Answer： 19
Section B.
Answer the following 3 questions, and show your detailed solution in the
space provided after each question. Each question is worth 20 points.
1. What is the number of real number solutions of the equation x 2 − 8[ x] + 7 = 0 ?
Note: [ x] denotes the largest integer that is not greater than x. For example,
[3.14] = 3 and [−3.14] = −4 .【Submitted by Bulgaria】
【Solution 1】
If x  1 , then [ x]  0 and hence x 2 − 8[ x] + 7  0 . So the equation has no solutions
in the domain of real numbers.
Now we can assume x  1 and let [ x] = n , where n is a positive integer. Thus
x 2 − 8n + 7 = 0
x = 8n − 7
Since [ x]  x  [ x] + 1 ,
n  8n − 7  n + 1
n  8n − 7  n2 + 2n + 1
2

So
(i) n2 − 8n + 7  0 , or (n − 1)(n − 7)  0 , hence 1  n  7
(ii) n2 − 6n + 8  0 , or (n − 2)(n − 4)  0 , hence n  2 or n  4
Thus n = 1 , 5, 6 or 7. There are 4 solutions: 8  1 − 7 = 1, 8  5 − 7 = 33 ,
8  6 − 7 = 41 and 8  7 − 7 = 49 = 7 . Hence the number of solutions is 4.
【Marking Scheme 1】
⚫ Say something about negative solutions .............................................. 5 marks
⚫ Find the inequality about [x]................................................................. 5 marks
⚫ Find [ x] = 1 , 5, 6 or 7 ........................................................................... 5 marks
⚫ Find all solutions (if some solutions are wrong or missing, minus one point for
each occurrence) and give the correct answer ...................................... 5 marks
⚫ Only given 4 as answer......................................................................... 0 marks
【Solution 2】
Since x − 1  [ x]  x , we must have
x2 − 8x + 7  x2 − 8[ x] + 7 = 0  x2 − 8( x − 1) + 7 = x2 − 8x + 15 .
From x2 − 8x + 7  0 factors into ( x − 1)( x − 7)  0 and implies
1 x  7 (1)
From x − 8x + 15  0 factors into ( x − 3)( x − 5)  0 and implies
2

x  3 or x  5 (2)
From (1) and (2), the possible range for x is 1  x  3 or 5  x  7 . Thus we only
need to check the cases that [ x] = 1 , 2, 5, 6 and 7.
When [ x] = 1 , we need x 2 = 8[ x] − 7 = 1 , which yields a solution x = 1 .
When [ x] = 2 , we need x 2 = 8[ x] − 7 = 9 , but x = 3 does not satisfy the condition
[ x] = 2 , so there is no solution.
When [ x] = 5 , we need x 2 = 8[ x] − 7 = 33 , which yields a solution x = 33 .
When [ x] = 6 , we need x 2 = 8[ x] − 7 = 41, which yields a solution x = 41 .
When [ x] = 7 , we need x 2 = 8[ x] − 7 = 49 , which yields a solution x = 7 .
Hence the number of solutions is 4.
Answer： 4
【Marking Scheme 2】
⚫ Observe x2 − 8x + 7  0 or find 1  x  7 .......................................... 5 marks
⚫ Observe x2 − 8x + 15  0 or find x  3 or x  5 .............................. 5 marks
⚫ Find [ x] = 1 , 2, 5, 6 or 7 ....................................................................... 5 marks
⚫ Find all solutions (if some solutions are wrong or missing, minus one point for
each occurrence) and give the correct answer ...................................... 5 marks
⚫ Only given 4 as answer......................................................................... 0 marks

2. Consider a regular hexagon. Paul wishes to colour each of the vertices of the
hexagon in green, red or blue, in such a way that there are no neighbouring
vertices coloured in the same colour. What is the total number of ways Paul can
do such a colouring?【Submitted by Mexico】
【Solution 1】
Since there are six vertices and three colours, one colour must be used three times or
each colour must be used exactly twice.
(a) If there is a colour appearing three times, such a colour must be either at the even
or odd vertices. When we only use two colours and so both even vertices and odd
vertices are monochromatic (meaning 1, 3, 5 are of one colour and 2, 4, 6 are of
another colour), there are 3  2 = 6 ways of colouring, since the colour of even
vertices can be chosen in three ways and then the colour of odd vertices can be
chosen from two options. Now, suppose that all three colours are used. There are
two options for choosing the three vertices to be monochromatic (even or odd)
and three ways to chose a colour for them. Then there will be two vertices with
the same colour and other vertex with other colour, hence there are two ways of
 choosing the colour that appear once and three ways of choosing the vertex with
that colour. Thus, the total ways of colouring when there are three numbers with
the same colour is 2  3  2  3 = 36 . Overall, there are 6 + 36 = 42 ways to
colour the hexagon where some colour is used three times.
(b) We consider two sub-cases when there are two vertices of each colour: when 1
and 4 are of the same colour and when 1 is of the same colour as 3 or 5. In the
first case, there are three ways of choosing the colour of 1 and 4 and, then,
numbers 2, 3, 5 and 6 must be coloured. Since 2 can not be of the same colour as
3, then number 2 must be of the same colour as 5 or 6 and this determines the
colour of the last two numbers. In this case, there are 3  2  2 = 12 ways. The
cases when 1 and 3 have the same colour and when 1 and 5 have the same colour
are symmetric, thus it suffices to count the case when 1 and 5 are of the same
colour and then multiply it by two. There are three ways of choosing the colour of
1 and 5 and, then, the numbers 2, 3, 4 and 6 must be coloured. Since there are
only two colours, two of the numbers 2, 3, 4 must be of the same colour, but they
can not be consecutive, then 2 and 4 must be of the same colour and 3 and 6 must
be of the remaining colour. Thus, we have to choose the colours of these two pairs.
Then, in this case there are 3  2 ways and, counting the case when 1 and 3 are
of the same colour, there are 2  3  2 = 12 possible ways. Thus, in the case when
there are two numbers of the same colour, there are 24 ways.
By adding both cases, we conclude that there are 66 possible colourings.
【Marking Scheme 1】
⚫ Find the correct ways for some colour is used three times .................. 10 marks
⚫ Find the correct ways for each colour must be used exactly twice ...... 10 marks
⚫ Only given 66 as answer....................................................................... 0 marks
⚫ Using brute force and obtain the correct answer .................................. 20 marks
No marks if the final answer is incorrect.
No marks if the process is not perfectly rigorous.
(Students should learn that using brute force without the ability to verify every
single detail often causes damage than doing goods.)

【Solution 2】
We temporarily remove the edge between vertices 1 and 6. Without loss of generality,
let vertex 1 be green.
For each n = 1 , 2, …, let an denote the number of ways to paint vertices 1 through
n where vertex n is green, and bn denote the number of ways to paint vertices 1
through n where vertex n is blue (or equivalently, red).
Then, for n = 1 we have a1 = 1 and b1 = 0 .
For each n  1 , we have an = 2bn−1 , since a chain of length n ending in green can be
obtained by appending a green vertex to a chain of length n − 1 ending in either blue
or red.
Similarly, we have bn = an−1 + bn−1 , since a chain of length n ending in blue/red can be
obtained by appending a red/blue vertex to a chain of length n − 1 ending in either
green or red/blue.
These recursive relationships allow us to calculate:
there are a2 = 0 ways to paint vertex 2 green, and b2 = 1 way each to paint it blue
or red;
there are a3 = 2 ways to paint vertex 3 green, and b3 = 1 way each to paint it blue
or red;
there are a4 = 2 ways to paint vertex 4 green, and b4 = 3 ways each to paint it blue
or red;
there are a5 = 6 ways to paint vertex 5 green, and b5 = 5 ways each to paint it blue
or red;
there are a6 = 10 ways to paint vertex 6 green, and b6 = 11 ways each to paint it
blue or red.
Now we restore the edge between vertices 1 and 6. Then since vertex 6 cannot be
painted green, there are 11 2 = 22 ways to color all vertices given vertex 1 is green.
Since there are 3 ways to color vertex 1, the total number of ways is 22  3 = 66 .
【Solution 3】
There are 3  2n ways to colour a chain of n edges ( n + 1 vertices) such that no
neighbouring vertices are coloured the same. If the head and the tail are coloured
differently, add an edge between the head and the tail, and this becomes a way to
colour an ( n + 1)-gon properly. If the head and the tail are of the same colour,
identify/merge the head and the tail, and this becomes a way to colour an n-gon. Let
an be the number of ways to colour an n-gon properly, we have the recursive
formula 3  2n = an+1 + an with the initial condition a3 = 6 . Hence
a4 = 3  8 − 6 = 18
a5 = 3  16 − 18 = 30
a6 = 3  32 − 30 = 66
Answer：66
【Marking Scheme 2 and 3】
⚫ Making a table for fewer vertices and classifying the cases based on the colours
of head and tail. (Typo is OK) .............................................................. 10 marks
⚫ An attempt to write down any form of recursive relation. (Typo is OK, but the
student must look like s/he knows that the head and the tail should be coloured
differently. Simply saying an = 3  2n−1 is worth 0 points) ................. 10 marks
(PS. you can only get 10 points once.)
⚫ If the final answer obtained by a non-brute-force method is correct ... 10 marks
3. In triangle ABC, M is the midpoint of BC. We draw the circle P
with centre O that passes through the points A and C and is
tangent to the line AM. The extension of BA intersects the
circle at D and the extension of CD intersects the extension of
MA at P, as shown in the diagram below. Prove that OP ⊥ BC .
【Submitted by Singapore】
D
【Solution】
Let N be the midpoint of CD, so, CN = DN . Since M is
the midpoint of BC, MN//BD and hence BDC = MNC . A
Since AM tangent to circle O, with alternate
angle on triangle ADC to line AM we will O
get MAC = BDC = MNC and
DAP = DCA . Hence, A, M, C and N are
concyclic and ANM = ACM = DAN .
Draw line AO, AN, NO, DO and CO.
Since DO and CO are the radius B M C
of circle O and CN = DN , so,
DNO = CNO = PNO = 90
Radius AO ⊥ AM , so, PAO = 90 .
Observe that triangles PAO and PNO have same line OP and PAO = PNO = 90
face to the line PO and that makes A, N, O and P are concyclic. P
Since A, N, O and P are concyclic, so,
PAN + PON = 180
DAP + DAN + PON = 180
PON = 180 − (DAP + DAN )
= 180 − (DCA + ACM ) = PCR D
And this make triangles PON and PCR similar with
PNO = PRC = 90 . A
And this showed that OP ⊥ BC
N O

R
B M C
【Marking Scheme】
⚫ To add N as the midpoint of DC and found BDC = MNC = MAC
.............................................................................................................. 5 marks
⚫ To show that A, M, C and N are concyclic ........................................... 3 marks
⚫ To find show PAO = PNO = 90 and prove that A, N, O and P are concyclic
.............................................................................................................. 8 marks
⚫ To find show PON = PCR and complete the proof..................... 4 marks