APMO 2024 – Problems and Solutions

Problem 1
Let ABC be an acute triangle. Let D be a point on side AB and E be a point on side AC such
that lines BC and DE are parallel. Let X be an interior point of BCED. Suppose rays DX
and EX meet side BC at points P and Q, respectively such that both P and Q lie between B
and C. Suppose that the circumcircles of triangles BQX and CP X intersect at a point Y 6= X.
Prove that points A, X, and Y are collinear.
Solution 1

Y
Z0
D E

B Q Z P C

Let ` be the radical axis of circles BQX and CP X. Since X and Y are on `, it is sufficient to
show that A is on `. Let line AX intersect segments BC and DE at Z and Z 0 , respectively.
Then it is sufficient to show that Z is on `. By BC k DE, we obtain

BZ DZ 0 PZ
= 0 = ,
ZC ZE ZQ
thus BZ · QZ = CZ · P Z, which implies that Z is on `.
Solution 2

A
T
S
Y

D E

B Q P C

1
Let circle BQX intersect line AB at a point S which is different from B. Then ∠DEX =
∠XQC = ∠BSX, thus S is on circle DEX. Similarly, let circle CP X intersect line AC at a
point T which is different from C. Then T is on circle DEX. The power of A with respect
to the circle DEX is AS · AD = AT · AE. Since AD AB
= AE
AC
, AS · AB = AT · AC. Then A is
in the radical axis of circles BQX and CP X, which implies that three points A, X and Y are
collinear.
Solution 3
Consider the (direct) homothety that takes triangle ADE to triangle ABC, and let Y 0 be the
image of Y under this homothety; in other words, let Y 0 be the intersection of the line parallel
to BY through D and the line parallel to CY through E.

Y0
Y

D E

B Q P C

The homothety implies that A, Y , and Y 0 are collinear, and that ∠DY 0 E = ∠BY C. Since
BQXY and CP XY are cyclic,
∠DY 0 E = ∠BY C = ∠BY X + ∠XY C = ∠XQP + ∠XP Q = 180◦ − ∠P XQ = 180◦ − ∠DXE,
which implies that DY 0 EX is cyclic. Therefore
∠DY 0 X = ∠DEX = ∠P QX = ∠BY X,
which, combined with DY 0 k BY , implies Y 0 X k Y X. This proves that X, Y , and Y 0 are
collinear, which in turn shows that A, X, and Y are collinear.
Marking scheme – Problem 1
All solutions found so far involve three steps: (1) constructing an extra point, (2) using a
geometric fact, and (3) reaching a fact that essentially finishes the problem. The marking
scheme reflects this common structure in the solutions, and should be followed for any solution
that shares this structure.
ˆ Step 1 : Constructing and explicitly defining points Z and Z 0 (solution 1), points S and
T (solution 2), or point Y 0 (solution 3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 points
0
ˆ Step 2 : Proving that BZ
CZ
= DZ
Z0E
= QZ PZ
(solution 1), AS · AD = BT · BE (solution 2), or
0
DY EX is cyclic (solution 3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +2 points
ˆ Step 3 : Proving that BZ · QZ = CZ · P Z (solution 1), AS · AB = AT · AC (solution 2),
or Y 0 X k Y X (solution 3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +2 points
ˆ Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +1 point
ˆ Stating, with or without proof, that DEX and P QX are similar triangles . . . . . . 0 points

2
Problem 2
Consider a 100 × 100 table, and identify the cell in row a and column b, 1 ≤ a, b ≤ 100, with
the ordered pair (a, b). Let k be an integer such that 51 ≤ k ≤ 99. A k-knight is a piece that
moves one cell vertically or horizontally and k cells to the other direction; that is, it moves from
(a, b) to (c, d) such that (|a − c|, |b − d|) is either (1, k) or (k, 1). The k-knight starts at cell
(1, 1), and performs several moves. A sequence of moves is a sequence of cells (x0 , y0 ) = (1, 1),
(x1 , y1 ), (x2 , y2 ), . . . , (xn , yn ) such that, for all i = 1, 2, . . . , n, 1 ≤ xi , yi ≤ 100 and the k-knight
can move from (xi−1 , yi−1 ) to (xi , yi ). In this case, each cell (xi , yi ) is said to be reachable. For
each k, find L(k), the number of reachable cells.
(
1002 − (2k − 100)2 if k is even
Answer: L(k) = 1002 −(2k−100)2 .
2
if k is odd

Solution
Cell (x, y) is directly reachable from another cell if and only if x − k ≥ 1 or x + k ≤ 100 or
y−k ≥ 1 or y+k ≤ 100, that is, x ≥ k+1 or x ≤ 100−k or y ≥ k+1 or y ≤ 100−k (∗). Therefore
the cells (x, y) for which 101 − k ≤ x ≤ k and 101 − k ≤ y ≤ k are unreachable. Let S be this
set of unreachable cells in this square, namely the square of cells (x, y), 101 − k ≤ x, y ≤ k.
If condition (∗) is valid for both (x, y) and (x ± 2, y ± 2) then one can move from (x, y) to
(x ± 2, y ± 2), if they are both in the table, with two moves: either x ≤ 50 or x ≥ 51; the
same is true for y. In the first case, move (x, y) → (x + k, y ± 1) → (x, y ± 2) or (x, y) →
(x ± 1, y + k) → (x ± 2, y). In the second case, move (x, y) → (x − k, y ± 1) → (x, y ± 2) or
(x, y) → (x ± 1, y − k) → (x ± 2, y).
Hence if the table is colored in two colors like a chessboard, if k ≤ 50, cells with the same
color as (1, 1) are reachable. Moreover, if k is even, every other move changes the color of
the occupied cell, and all cells are potentially reachable; otherwise, only cells with the same
color as (1, 1) can be visited. Therefore, if k is even then the reachable cells consists of all
cells except the center square defined by 101 − k ≤ x ≤ k and 101 − k ≤ y ≤ k, that is,
L(k) = 1002 − (2k − 100)2 ; if k is odd, then only half of the cells are reachable: the ones with
the same color as (1, 1), and L(k) = 21 (1002 − (2k − 100)2 ).

Marking scheme – Problem 2

ˆ Showing that all cells in S are unreachable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 points

ˆ If k is odd, after coloring the cells, proving that cells with opposite colors from (1, 1) are
unreachable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +1 point

– Only coloring the cells . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0 points

ˆ Proving that one can move from (x, y) to (x ± 2, y ± 2) if (x ± 2, y ± 2) ∈

/ S . . +2 points

ˆ Concluding that all other cells are reachable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +1 point

ˆ Computation of L(k). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .+1 point

3
Problem 3
Let n be a positive integer and a1 , a2 , . . . , an be positive real numbers. Prove that
n  2i
X 1 2 2 1
i
≥ − n
.
i=1
2 1 + a i 1 + a 1 a 2 . . . an 2

Solution
We first prove the following lemma:
Lemma 1. For k positive integer and x, y > 0,
 2k  2k  2k−1
2 2 2
+ ≥2 .
1+x 1+y 1 + xy
The proof goes by induction. For k = 1, we have
 2  2  
2 2 2
+ ≥2 ,
1+x 1+y 1 + xy
which reduces to
xy(x − y)2 + (xy − 1)2 ≥ 0.

2k−1  2k−1
2 2 2 2 2
For k > 1, by the inequality 2(A +B ) ≥ (A+B) applied at A = and B = 1+x 1+y
followed by the induction hypothesis
 2k  2k !  2k−1  2k−1 !2
2 2 2 2
2 + ≥ +
1+x 1+y 1+x 1+y
 2k−2 !2  2k−1
2 2
≥ 2 =4 ,
1 + xy 1 + xy

from which the lemma follows.

The problem now can be deduced from summing the following applications of the lemma,
multiplied by the appropriate factor:
 2n  2n  2n−1
1 2 1 2 1 2
+ n ≥
2n 1 + an 2 1+1 2n−1 1 + an · 1
 2n−1  2n−1  2n−2
1 2 1 2 1 2
+ n−1 ≥
2n−1 1 + an−1 2 1 + an 2n−2 1 + an−1 an
 2n−2  2n−2  2n−3
1 2 1 2 1 2
+ n−2 ≥
2n−2 1 + an−2 2 1 + an−1 an 2n−3 1 + an−2 an−1 an
···
 2k  2k  2k−1
1 2 1 2 1 2
k
+ k ≥
2 1 + ak 2 1 + ak+1 . . . an−1 an 2k−1 1 + ak . . . an−2 an−1 an
···
 2  2
1 2 1 2 2
+ ≥ .
2 1 + a1 2 1 + a2 . . . an−1 an 1 + a1 . . . an−2 an−1 an

Comment: Equality occurs if and only if a1 = a2 = · · · = an = 1.

4
Comment: The main motivation for the lemma is trying to “telescope” the sum
n  2i
1 X 1 2
+ ,
2n i=1 2i 1 + ai

that is,
 2  2n−1  2n  2n
1 2 1 2 1 2 1 2
+ ··· + + n + n
2 1 + a1 2n−1 1 + an−1 2 1 + an 2 1+1

to obtain an expression larger than or equal to

2
.
1 + a1 a2 . . . an
It seems reasonable to obtain a inequality that can be applied from right to left, decreases the
exponent of the factor 1/2k by 1, and multiplies the variables in the denominator. Given that,
the lemma is quite natural:
 2k  2k  2i−1
1 2 1 2 1 2
+ k ≥ ,
2k 1+x 2 1+y 2k−1 1 + xy
or  2k  2k  2k−1
2 2 2
+ ≥2 .
1+x 1+y 1 + xy

Marking scheme – Problem 3

ˆ Proof of the lemma or an equivalent result (namely, the step that binds the chain of
inequalities that solves the problem) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (total) 4 points

– Only conjecturing the lemma . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0 points

– Base case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 points
– Induction step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +2 points

ˆ Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +3 points

Observation: The 3 points from the conclusion may be awarded independently from the first
4 marks. For instance, if the student conjectures the lemma, do not prove it, but correctly
applies the lemma to finish the problem, they are awarded at least 3 points for the conclusion
(they may also earn 2 additional points, for instance, from performing the induction step but
failing to prove the base case.)

5
Problem 4
Prove that for every positive integer t there is a unique permutation
 a
0 , a1 , . . . , at−1 of 0, 1, . . . , t−
t+i
1 such that, for every 0 ≤ i ≤ t − 1, the binomial coefficient is odd and 2ai 6= t + i.
2ai
Solution
We constantly make use of Kummer’s theorem which, in particular, implies that nk is odd if

and only if k and n − k have ones in different positions in binary. In other words, if S(x) is the
set of
positions of the digits 1 of x in binary (in which the digit multiplied by 2i is in position
i), nk is odd if and only if S(k) ⊆ S(n). Moreover, if we set k < n, S(k) is a proper subset of
S(n), that is, |S(k)| < |S(n)|.
We start with a lemma that guides us how the permutation should be set.

Lemma 1.
t−1
X t−1
X
|S(t + i)| = t + |S(2i)|.
i=0 i=0

The proof is just realizing that S(2i) = {1+x, x ∈ S(i)} and S(2i+1) = {0}∪{1+x, x ∈ S(i)},
because 2i in binary is i followed by a zero and 2i + 1 in binary is i followed by a one. Therefore
t−1
X 2t−1
X t−1
X t−1
X t−1
X t−1
X
|S(t + i)| = |S(i)| − |S(i)| = |S(2i)| + |S(2i + 1)| − |S(i)|
i=0 i=0 i=0 i=0 i=0 i=0
t−1
X t−1
X t−1
X t−1
X t−1
X
= |S(i)| + (1 + |S(i)|) − |S(i)| = t + |S(i)| = t + |S(2i)|.
i=0 i=0 i=0 i=0 i=0

The lemma has an immediate corollary: since t + i > 2ai and t+i


2ai
is odd for all i, 0 ≤ i ≤ t − 1,
S(2ai ) ⊂ S(t + i) with |S(2ai )| ≤ |S(t + i)| − 1. Since the sum of |S(2ai )| is t less than the sum
of |S(t + i)|, and there are t values of i, equality must occur, that is, |S(2ai )| = |S(t + i)| − 1,
which in conjunction with S(2ai ) ⊂ S(t+i) means that t+i−2ai = 2ki for every i, 0 ≤ i ≤ t−1,
ki ∈ S(t + i) (more precisely, {ki } = S(t + i) \ S(2ai ).)
In particular, for t + i odd, this means that t + i − 2ai = 1, because the only odd power of 2 is
1. Then ai = t+i−12
for t + i odd, which takes up all the numbers greater than or equal to t−1 2
.
Now we need to distribute the numbers that are smaller than t−1 2
(call these numbers small ).
t+i

t+i


If t + i is even then by Lucas’ Theorem 2ai ≡ ai (mod 2), so we pair numbers from dt/2e
2

to t − 1 (call these numbers big) with the small numbers.

Say that a set A is paired with another set B whenever |A| = |B| and there exists a bijection
π : A → B such that S(a) ⊂ S(π(a)) and |S(a)| = |S(π(a))| − 1; we also say that a and π(a) are
paired. We prove by induction in t that At = {0, 1, 2, . . . , bt/2c − 1} (the set of small numbers)
and Bt = {dt/2e, . . . , t − 2, t − 1} (the set of big numbers) can be uniquely paired.
The claim is immediate for t = 1 and t = 2. For t > 2, there is exactly one power of two in Bt ,
since t/2 ≤ 2a < t ⇐⇒ a = dlog2 (t/2)e. Let 2a be this power of two. Then, since 2a ≥ t/2, no
number in At has a one in position a in binary. Since for every number x, 2a ≤ x < t, a ∈ S(x)
and a ∈ / S(y) for all y ∈ At , x can only be paired with x − 2a , since S(x) needs to be stripped
of exactly one position. This takes cares of x ∈ Bt , 2a ≤ x < t, and y ∈ At , 0 ≤ y < t − 2a .
Now we need to pair the numbers from A0 = {t − 2a , t − 2a + 1, . . . , bt/2c − 1} ⊂ A with the
numbers from B 0 = {dt/2e, dt/2e + 1, . . . , 2a − 1} ⊂ B. In order to pair these t − 2(t − 2a ) =
2a+1 − t < t numbers, we use the induction hypothesis and a bijection between A0 ∪ B 0 and
B2a+1 −t ∪ A2a+1 −t . Let S = S(2a − 1) = {0, 1, 2, . . . , a − 1}. Then take a pair x, y, x ∈ A2a+1 −t
and y ∈ B2a+1 −t and biject it with 2a − 1 − x ∈ B 0 and 2a − 1 − y ∈ A0 . In fact,
 a+1     
2 −t a t t
0≤x≤ −1=2 − − 1 ⇐⇒ ≤ 2a − 1 − x ≤ 2a − 1
2 2 2

6
and
2a+1 − t
     
a t a+1 a a t
=2 − ≤y≤2 − t − 1 ⇐⇒ t − 2 ≤ 2 − 1 − y ≤ − 1.
2 2 2

Moreover, S(2a − 1 − x) = S \ S(x) and S(2a − 1 − y) = S \ S(y) are complements with respect
to S, and S(x) ⊂ S(y) and |S(x)| = |S(y)| − 1 implies S(2a − 1 − y) ⊂ S(2a − 1 − x) and
|S(2a − 1 − y)| = |S(2a − 1 − x)| − 1. Therefore a pairing between A0 and B 0 corresponds to a
pairing between A2a+1 −t and B2a+1 −t . Since the latter pairing is unique, the former pairing is
also unique, and the result follows.
We illustrate the bijection by showing the case t = 23:

A23 = {0, 1, 2, . . . , 10}, B23 = {12, 13, 14, . . . , 22}.

The pairing is  
12 13 14 15 16 17 18 19 20 21 22
,
8 9 10 7 0 1 2 3 4 5 6
in which the bijection is between
     
12 13 14 15 3 2 1 0 5 6 7 8
and → .
8 9 10 7 7 6 5 8 1 2 3 0

Marking scheme – Problem 4

ˆ Proving lemma 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 point

ˆ Showing that ai = t+i−1

2
if t + i is odd . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +1 point

ˆ Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (total) 5 points

– Proving that pairing x with x − 2a , 2a ≤ x < t, a = blog2 (t/2)c is the only possibility
+1 point
– Finding the bijection x → 2a − 1 − x, with complete description of how it pairs the
current case with a previous case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +2 points
– Making the proper induction step . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +2 points

7
Problem 5
Line ` intersects sides BC and AD of cyclic quadrilateral ABCD in its interior points R and
S respectively, and intersects ray DC beyond point C at Q, and ray BA beyond point A at P .
Circumcircles of the triangles QCR and QDS intersect at N 6= Q, while circumcircles of the
triangles P AS and P BR intersect at M 6= P . Let lines M P and N Q meet at point X, lines
AB and CD meet at point K and lines BC and AD meet at point L. Prove that point X lies
on line KL.
Solution 1
We start with the following lemma.

Lemma 1. Points M, N, P, Q are concyclic.

Point M is the Miquel point of lines AP = AB, P S = `, AS = AD, and BR = BC, and point
N is the Miquel point of lines CQ = CD, RC = BC, QR = `, and DS = AD. Both points
M and N are on the circumcircle of the triangle determined by the common lines AD, `, and
BC, which is LRS.
Then, since quadrilaterals QN RC, P M AS, and ABCD are all cyclic, using directed angles
(modulo 180◦ )

]N M P = ]N M S + ]SM P = ]N RS + ]SAP = ]N RQ + ]DAB = ]N RQ + ]DCB

= ]N RQ + ]QCR = ]N RQ + ]QN R = ]N QR = ]N QP,

which implies that M N QP is a cyclic quadrilateral.

L
`

M
P
T =V
E
A S
B

R
N
QC D

Let E be the Miquel point of ABCD (that is, of lines AB, BC, CD, DA). It is well known
that E lies in the line t connecting the intersections of the opposite lines of ABCD. Let lines
N Q and t meet at T . If T 6= E, using directed angles, looking at the circumcircles of LAB
(which contains, by definition, E and M ), AP S (which also contains M ), and M N QP ,

]T EM = ]LEM = ]LAM = ]SAM = ]SP M = ]QP M = ]QN M = ]T N M,

that is, T lies in the circumcircle ω of EM N . If T = E, the same computation shows that
]LEM = ]EN M , which means that t is tangent to ω.

8
Now let lines M P and t meet at V . An analogous computation shows, by looking at the
circumcircles of LCD (which contains E and N ), CQR, and M N QP , that V lies in ω as well,
and that if V = E then t is tangent to ω.
Therefore, since ω meet t at T , V , and E, either T = V if both T 6= E and V 6= E or
T = V = E. At any rate, the intersection of lines M P and N Q lies in t.
Solution 2
Barycentric coordinates are a viable way to solve the problem, but even the solution we have
found had some clever computations. Here is an outline of this solution.
Lemma 2. Denote by powω X the power of point X with respect to circle ω. Let Γ1 and
Γ2 be circles with different centers. Considering ABC as the reference triangle in barycentric
coordinates, the radical axis of Γ1 and Γ2 is given by
(powΓ1 A − powΓ2 A)x + (powΓ1 B − powΓ2 B)y + (powΓ1 C − powΓ2 C)z = 0.
Proof: Let Γi have the equation Γi (x, y, z) = −a2 yz − b2 zx − c2 xy + (x + y + z)(ri x + si y + ti z).
Then powΓi P = Γi (P ). In particular, powΓi A = Γi (1, 0, 0) = ri and, similarly, powΓi B = si
and powΓi C = ti .
Finally, the radical axis is
powΓ1 P = powΓ2 P
⇐⇒ Γ1 (x, y, z) = Γ2 (x, y, z)
⇐⇒ r1 x + s1 y + t1 z = r2 x + s2 y + t2 z
⇐⇒ (powΓ1 A − powΓ2 A)x + (powΓ1 B − powΓ2 B)y + (powΓ1 C − powΓ2 C)z = 0.
We still use the Miquel point E of ABCD. Notice that the problem is equivalent to proving
that lines M P , N Q, and EK are concurrent. The main idea is writing these three lines as
radical axes. In fact, by definition of points M , N , and E:
ˆ M P is the radical axis of the circumcircles of P AS and P BR;
ˆ N Q is the radical axis of the circumcircles of QCR and QDS;
ˆ EK is the radical axis of the circumcircles of KBC and KAD.
Looking at these facts and the diagram, it makes sense to take triangle KQP the reference
triangle. Because of that, we do not really need to draw circles nor even points M and N , as
all powers can be computed directly from points in lines KP , KQ, and P Q.

E
D

C
Q
R

P A B K

The notation will be P Q = a, P K = b, and QK = c. Also, let AK = q, BK = p, CK = r,

and DK = s. Using Menelaus’s theorem one can prove that
as(b − q) ar(b − p) aq(s − c) ap(r − c)
PS = , PR = , SQ = , RQ = .
sb − qc rb − pc sb − qc rb − pc
Now all powers can be computed:

9
 P AS P BR QCR QDS KBC KAD
Power of K wrt circumcircle of qb pb rc sc 0 0
a2 q(s−c) a2 p(r−c)
Power of Q wrt circumcircle of sb−qc rb−pc
0 0 −c(r − c) −c(s − c)
a2 r(b−p) a2 s(b−q)
Power of P wrt circumcircle of 0 0 rb−pc sb−qc
b(b − p) b(b − q)

One can promptly verify that

a2 q(s − c) a2 p(r − c)
powP AS Q − powP BR Q = − =u
sb − qc rb − pc
a2 s(b − q) a2 r(b − p)
powQDS P − powQCR P = − = −u
sb − qc rb − pc

(one way to do it is just sum fractions with the same denominator to obtain a2 − a2 = 0.)
Applying the lemma, the equations from P M , QN , and EK are

ˆ P M : b(q − p)x + uy = 0

ˆ QN : c(s − r)x − uz = 0

ˆ EK: c(s − r)y + b(q − p)z = 0

Now, if v = b(q − p) and w = c(s − r), it suffices to show that

v u 0
w 0 −u = 0,
0 w v

which is a straightforward computation.

Marking scheme – Problem 5

ˆ There is no need to show that the Miquel point E of ABCD lies in line t connecting the
intersections of the opposite lines of ABCD.

ˆ No marks should be deduced for diagram dependence in this problem.

Solution 1:

ˆ Proof of lemma 1, ie, M, N, P, Q are concyclic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 points

ˆ Proving that T lies in the circumcircle of EM N . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +4 points

ˆ Conclusion (only awarded if all other points are obtained) . . . . . . . . . . . . . . . . . . . . +1 point

Solution 2:

ˆ Proof of lemma 2 (expressing radical axes from power of vertices) . . . . . . . . . . . . . . 2 points

ˆ Finding all relevant powers to compute the equations of the radical axes (ie, the table in
Solution 2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . +3 points

ˆ Conclusion (only awarded if all other points are obtained) . . . . . . . . . . . . . . . . . . . . +2 point

10