Enumeration 2023 Prelims

Solutions Document

Kazi Aryan Amin

July 29, 2023

Contents

1 Problems 2
1.1 Computational Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Subjective Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

2 Answer Key to Computational Problems 5

3 Solutions 6
3.1 Computational Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.2 Subjective Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13

1
1 Problems

1.1 Computational Problems

1. Let x and y be positive real numbers satisfying x + y = 1. The maximum possible value of x 4 y + xy 4
a
can be expressed as b for relatively prime positive integers a, b. Compute a + b.

2. Anna writes a sequence of positive integers (a1 , a2 , · · · , an ), such that

a1 + a2 + · · · + an = 2023

Suppose the sequence Anna picks is equally likely to be any sequence satisfying the above condition.
Find the expected value of n.
Note: The expected value of n is the average value of n across all possibilities.

3. For a positive integer n relatively prime to 2023, we define its order modulo 2023, to be the smallest
positive integer d such that 2023 divides nd − 1. Find the number of integers n relatively prime to
2023 such that 1 ≤ n ≤ 2023 and the order of n modulo 2023 is 136.
50 X50  
i+j 100
X
4. Let S = (−1) . Given that S is a positive integer, find the highest exponent of 2
i +j
i=0 j=0
dividing S.

5. Let ABCD be a bicentric quadrilateral, that is, it has both an incircle and a circumcircle. Suppose
the incircle of ABCD is tangent to BC at X. If AD = 5, BX = 4 and CX = 6, then the area of
√
ABCD can be expressed as a b where a, b are positive integers and b isn’t divisible by the square of
any prime. Compute ab.

6. An ice cream parlour with infinitely many identical stalls allows one customer to enter every minute.
Upon entry, a customer goes to an empty stall and stays there till their order is delivered, and then
leaves the parlor instantly. The probability that it takes exactly n minutes to prepare their order is
1
n(n+1) . Let T denote the expected amount of time after the first customer walks in, for someone’s
order to be delivered. Find ⌊10T ⌋.

Note : ⌊x⌋ is the smallest integer not exceeding x.

√
7. Let O denote the circumcenter of ∆ABC with AB = 3 and AC = 2. Suppose the circumcircle of
△BOC intersects AB and AC again at X, Y , respectively. If XY is tangent to the circumcircle of
√
a+b c
triangle ∆ABC, then BC 2 can be expressed as d , where a, b, c, d are positive integers such that
gcd(a, b, d) = 1 and c isn’t divisible by the square of any prime. Compute a + b + c + d.

8. Find the number of ways of placing 4 knights on a 4 × 4 board such that for every knight, there is an
unique knight attacking it.

9. Let P1 , P2 , P3 be three monic quadratic polynomials, which are pairwise unequal and have no double

2
 root. Suppose for every i = 1, 2, 3, there exists an unique real number ai ̸= 1 such that the equation

Pi (x) = ai Pi+1 (x)

−2 3
has exactly one solution xi (where P4 ≡ P1 ). If x1 = 3, a1 = 3 and a2 = 5, find the sum of all
possible values of x2 + x3 .

10. Circles ω1 and ω2 with centres O1 and O2 , and radii 13, 15 respectively, intersect at points X, Y .
Points P, Q lie on ω1 , ω2 respectively such that P, Y, Q are collinear in that order. Suppose P O1 and
QO2 intersect at T . If XT ∥ P Q, and O1 O2 = 14, then the circumradius of △XP Q can be expressed
as ba , for relatively prime positive integers a, b. Compute a + b.

11. Consider the polynomial :

Y
P (x) = (x − a5 )
1≤a≤101

Let Q(x) be the remainder obtained when P (x) is divided by x 3 − 1. Find the remainder when Q(2)
is divided by 101.

12. Let A, B be points on an eliipse E with focii F1 , F2 . Suppose AF2 intersects BF1 at C and AF1
intersects BF2 at D. The tangents to E at A, B intersect at P . Suppose C, D, F1 , F2 lie on a circle. If
a
P F1 = 5, F1 F2 = 7 and P F2 = 8, then CD can be expressed as b for relatively prime positive integers
a, b. Compute a + b.

13. Let a, b, c, d be real numbers such that abcd = −1 and the following equations hold :

|d(a − b)(b − c)(c − a)| = 1

|a(b − c)(c − d)(d − b)| = 2

|b(c − a)(a − d)(d − c)| = 6

Find the sum of all possible values of |c(d − a)(a − b)(b − d)|.

14. A positive integer n is said to be a quadratic residue modulo 97, if there exists an integer m, such that
m2 − n is divisible by 97 and 97 ∤ n. Alice randomly picks a triple (a, b, c) of quadratic residues modulo
97, where 1 ≤ a, b, c ≤ 97 and her choice of triple is equally likely among all possible choices. If the
probability that a + b + c is NOT a quadratic residue modulo 97 can be expressed as yx , for relatively
prime positive integers x, y , then compute the value of x + y .

15. Let N denote the number of upright paths from (0, 0) to (10, 10) which intersect the line x = y at
exactly 5 points other than the start and end points. If N can be expressed as 2a × b, where b is an
odd positive integer, compute a + b.

Note : A upright path is one where we only take steps towards right or upwards. For example the
following is an upright path from (0, 0) to (2, 2):

(0, 0) → (1, 0) → (2, 0) → (2, 1) → (2, 2)

3
 whereas the following is not (as it has a leftward step):

(0, 0) → (1, 0) → (2, 0) → (3, 0) → (3, 1) → (3, 2) → (2, 2)

1.2 Subjective Problems

1. Find all functions f:R→R such that the following equation holds
for all x, y ∈ R :

f (y f (x)) + f (xy ) = 2y f (x)

2. Find all pairs of positive integers (a, b) such that for all positive integers
n> 20232023 , the number n2 + an + b has a divisor d > 1, such that n | d − 1.

3. Let ω denote the circumcircle of triangle ∆ABC. Suppose the internal and external bisectors of ∠BAC,
intersect BC and ω again at K, L respectively. Points X, Y lie on ω such that LK = LX = LY . Prove
that XY , and the line through K perpendicular to BC meet on the A-median.

4. 2002 people stand in a line. Each person either always tells the truth, or always lies. Starting from
the back, Alice asks 1995 people :

How many liars are are standing in front of you?

and records their answers. Prove Alice can pick a subset of non-negative integers S such that the sum
of elements of S is atmost 2023 and she can guarantee that number of truthful people is in S.

5. The A-excircle of ∆ABC is tangent to BC at D. The line AD intersects the incircle of ∆ABC at points
Y, Z such that AZ > AY . The line through Z parallel to the external angle bisector of ∠BAC meets
BC at X. Prove that XY passes through the midpoint of arc BAC[ in the circumcircle of ∆ABC.

4
2 Answer Key to Computational Problems
1. 13

2. 1012

3. 128

4. 4

5. 90

6. 17

7. 25

8. 128

9. 7

10. 67

11. 83

12. 1209

13. 12

14. 3455

15. 435

5
3 Solutions

3.1 Computational Problems

These are intended to be solution sketches, rather than fully written out proofs.

Problem 1
Let x and y be positive real numbers satisfying x + y = 1. The maximum possible value of x 4 y + xy 4
a
can be expressed as b for relatively prime positive integers a, b. Compute a + b.

1
Sol : Write xy (x 3 + y 3 ) = xy (1 − 3xy ) ≤ 12 . This leads to an answer of 13 .

Problem 2
Anna writes a sequence of positive integers (a1 , a2 , · · · , an ), such that

a1 + a2 + · · · + an = 2023

Suppose the sequence Anna picks is equally likely to be any sequence satisfying the above condition.
Find the expected value of n.
Note: The expected value of n is the average value of n across all possibilities.

Sol : We may think of this in terms of putting a positive integer amount of "balls" in each of the ai , so
that we have 2023 balls in the end. We want to find the expected value of partitions. Lay out all the balls
in the straight line, and note that there are 2022 "spaces" between each two. As the partitions are picked
1
randomly, every space has a 2 chance of getting picked, leading to expected value of spaces picked being
1011. The number of partitions is one more than that and equal to 1012 .

Problem 3
For a positive integer n relatively prime to 2023, we define its order modulo 2023, to be the smallest
positive integer d such that 2023 divides nd − 1. Find the number of integers n relatively prime to 2023
such that 1 ≤ n ≤ 2023 and the order of n modulo 2023 is 136.

Sol : The multiplicative group (Z/2023Z)× is just (Z/7Z)× (call this A, with primitive root a) times
(Z/289Z)× (call this B, with primitive root b). Note that φ(2023) = 6 × 16 × 17, and we want order =136.
Now each element is just of the form ax by , and orders are just a function of x, y . So we want to multiply
factors of 6 and 16×17 to get 17 × 8? The only ways are:
order 1, 17*8 from A,B resp, AND order 2, 17*8 from A,B resp
So we want ax by such that ord7 (ax ) = 1 or 2 i.e. a2 = 1 and ord289 (by ) = 17 × 8 = (17 × 16)/2, so the
square of any primitive root works. That’s φ(17 × 8) = 16 × 4 = 64, so a total of 2 × 64 = 128 solutions.

6
 Problem 4
50 X
50  
X 100
Let S = (−1)i+j . Given that S is a positive integer, find the highest exponent of 2
i +j
i=0 j=0
dividing S.

50  
n 100
X
Sol : Write as {min(n, 100 − n) + 1} · (−1) . So this becomes equivalent to finding the coefficient
n
n=0
of x 100 in
(1 − x)100 (1 + 2x + 3x 2 + · · · + 50x 49 + 51x 50 + 50x 51 + · · · 2x 99 + x 100 )

The latter expression is (1 + x + x 2 + · · · + x 50 )2 , and hence S = 2 × 98

49 . One can now calculate
v2 (S) = 4 .

Problem 5
Let ABCD be a bicentric quadrilateral, that is, it has both an incircle and a circumcircle. Suppose the
incircle of ABCD is tangent to BC at X. If AD = 5, BX = 4 and CX = 6, then the area of ABCD
√
can be expressed as a b where a, b are positive integers and b isn’t divisible by the square of any prime.
Compute ab.

Sol : Let ta denote the length of tangent from A to the incircle. Define tb , tc , td analogously for the other
vertices. Then we claim that ta tc = tb td . Suppose the incircle is tangent to AB at P and CD at Q. Then
AP AP PI QI QD QD
note that △P AI ∼ △QIC and P BI ∼ QID. So we have : BP = PI · PB = ·
which implies
QC QI = QC
√
the claim. Now one can find that the sidelengths are 10, 5, 6, 9, which gives an area of 30 3. Thus the
answer is 90 .

Problem 6
An ice cream parlour with infinitely many identical stalls allows one customer to enter every minute.
Upon entry, a customer goes to an empty stall and stays there till their order is delivered, and then
leaves the parlor instantly. The probability that it takes exactly n minutes to prepare their order is
1
n(n+1) . Let T denote the expected amount of time after the first customer walks in, for someone’s
order to be delivered. Find ⌊10T ⌋.

Note : ⌊x⌋ is the smallest integer not exceeding x.

Pk 1 1
Sol : Note that the probability that a customer is in the store after k minutes is 1 − i=0 i(i+1) = k+1 .
Now note, that at the n-th minute, there are n + 1 customers, and the j-th customer is in the store for
n + 1 − j minutes. Thus Pr(T > n) = n+1 1 1
Q
j=0 n+1−j = (n+1)! Hence we have :

X X 1
E[T ] = Pr(T > n) = =e−1
(n + 1)!
n≥0 n≥0

So the answer is ⌊e − 1⌋ = 17

7
 Problem 7
√
Let O denote the circumcenter of ∆ABC with AB = 3 and AC = 2. Suppose the circumcircle of
△BOC intersects AB and AC again at X, Y , respectively. If XY is tangent to the circumcircle of
√
a+b c
triangle ∆ABC, then BC 2 can be expressed as d , where a, b, c, d are positive integers such that
gcd(a, b, d) = 1 and c isn’t divisible by the square of any prime. Compute a + b + c + d.

Sol : Note that XY is antiparallel to BC (as XY BC is cyclic), and hence AO ⊥ XY . Hence the tangency
is at the A-antipode of △ABC. Also one may prove via angle chasing, that O is the orthocenter of △AXY .
Thus we have ABCH ∼ AY XO, and also we know that H lies on the A-midline in △ABC. This gives the
b2 +c 2 −a2
equation (SA = 2 , etc) :

1 2 1
SB SC = SA (SB + SC ) =⇒ (a − 1)(a2 + 1) = a2 (7 − a2 )
4 2
r
1 √
=⇒ 3a4 − 14a2 − 1 = 0 =⇒ a = (7 + 2 13)
3
This gives a value of 25 .

Problem 8
Find the number of ways of placing 4 knights on a 4 × 4 board such that for every knight, there is an
unique knight attacking it.

Sol :(by Agamjeet Singh and Malay Mahajan)

8
 We colour the board as shown below. No knight in the shaded area can attack any other knight in the
shaded area. Same goes for the unshaded area. Also each knight is, in some sense, paired with another
knight (They are attacking each other). So there are 2 knights in shaded area and 2 knights in unshaded
area.
Now we consider all pairs of knights on the shaded area and consider the number of ways in which we
can place the other 2 knights in the unshaded area. From what follows, ’sharing a knight’ means if both the
knights in the shaded area attack a particular knight in the unshaded area. In the diagram, I have numbered
each shaded cell with the number of knights in the unshaded area that it can attack.
Two pairs would either share nothing, share one knight or share two knights. The first diagram shows
sharing no knights and the other one shows sharing two knights. In all other cases, exactly one knight is
shared.
We count from the top row, going down, from left to right (First fixing one cell, then varying the other
cell)
1·2+2·4+1·2+1·2+2·4+1·2+0+2·3+2·2+3·3+2·3+1·1+2·1+3·2+3·2+2·

9
2 + 3 · 2 + 4 · 2 + 1 · 1 + 2 · 3 + 3 · 3 + 2 · 1 + 2 · 3 + 2 · 2 + 2 · 1 + 3 · 2 + 4 · 2 + 2 · 1 = 128

Problem 9
Let P1 , P2 , P3 be three monic quadratic polynomials, which are pairwise unequal and have no double
root. Suppose for every i = 1, 2, 3, there exists an unique real number ai ̸= 1 such that the equation

Pi (x) = ai Pi+1 (x)

−2
has exactly one solution xi (where P4 ≡ P1 ). If x1 = 3, a1 = 3 and a2 = 35 , find the sum of all possible
values of x2 + x3 .

Sol : One can prove that for two quadratics P, Q which arent constant multiples of each other, and do not
have a double root, then there exists a k ∈ R, such that P − kQ has exactly one real root, iff P, Q share
exactly one root in common. This is just a discriminant calculation. This implies that all three quadratics
in question share one pair of roots each. With this in mind, its easy to see x2 = 6 and x3 = 1, leading to an
answer of 7 .

Problem 10
Circles ω1 and ω2 with centres O1 and O2 , and radii 13, 15 respectively, intersect at points X, Y . Points
P, Q lie on ω1 , ω2 respectively such that P, Y, Q are collinear in that order. Suppose P O1 and QO2
intersect at T . If XT ∥ P Q, and O1 O2 = 14, then the circumradius of △XP Q can be expressed as ba ,
for relatively prime positive integers a, b. Compute a + b.

Sol : First note by Salmon’s lemma that XO1 O2 ∼ XP Q, so that T ∈ ⊙(XP Q). Then let O denote the
circumcenter of △XP Q. One can prove the following using angle chasing :

• X, O, Y are collinear.
• XO ⊥ O1 O2
• X, O, O1 , O2 lie on a circle
63
Using this and power of point, we may conclude that XO = 4 , leading to an answer of 67 .

Problem 11
Consider the polynomial :
Y
P (x) = (x − a5 )
1≤a≤101

Let Q(x) be the remainder obtained when P (x) is divided by x 3 − 1. Find the remainder when Q(2) is
divided by 101.

Sol : Work in F101 [X]. We have :

Y
P (x) = x (x − a)5
a∈A

10
 Q 100
where A denotes the set of all non zero fifth powers modulo 101. Note that a∈A (x − a) = (x 5 − 1) =
(x 20 − 1). Thus we need to find x(x 20 − 1)5 ≡ x(x 2 − 1)5 modulo x3 − 1. This is found to be 9x − 9x 2 .
Plugging in x = 2 and taking the positive remainder, gives 83 .

Problem 12
Let A, B be points on an eliipse E with focii F1 , F2 . Suppose AF2 intersects BF1 at C and AF1 intersects
BF2 at D. The tangents to E at A, B intersect at P . Suppose C, D, F1 , F2 lie on a circle. If P F1 = 5,
a
F1 F2 = 7 and P F2 = 8, then CD can be expressed as b for relatively prime positive integers a, b.
Compute a + b.

Sol :(by David Altizio) Let S and T be the reflections of F1 across AP and BP , respectively. Recall that S,
A, and F2 are collinear, as are T , B, and F2 . Furthermore, P S = P F1 = P T and F2 T = F2 S. It follows that
triangles P F2 S and P F2 T are congruent, implying F2 P bisects ∠BF2 A. Analogously, F1 P bisects ∠AF1 B.
Combined with the fact that F1 CF2 D is cyclic, we deduce that ∠P F1 C + ∠P F2 C = 90◦ .
There are several ramifications to the above claim. First, remark that

∠F1 CF2 = ∠F1 P F2 + ∠P F1 C + ∠P F2 C = 150◦ .

Second, observe by a similar angle chase that ∠P SF2 + ∠P F2 S = 90◦ , so SP ⊥ P F2 . From P S = 5 and
P F2 = 8 we deduce sin ∠SF2 P = √5 and cos ∠SF2 P = √8 , so
89 89

5 8 80
sin ∠CF2 D = sin(2∠P F2 C) = 2 · √ · √ = .
89 89 89

Finally, Extended Law of Sines on cyclic quadrilateral F1 CF2 yields

F1 F2 CD 89CD
14 = = = ,
sin ∠F1 CF2 sin ∠CF2 D 80

1120
whence CD = 89 .

Problem 13
Let a, b, c, d be real numbers such that abcd = −1 and the following equations hold :

|d(a − b)(b − c)(c − a)| = 1

|a(b − c)(c − d)(d − b)| = 2

|b(c − a)(a − d)(d − c)| = 6

Find the sum of all possible values of |c(d − a)(a − b)(b − d)|.

Sol : Plot points A(a, 1a ), B(b, b1 ), C(c, c1 ) and D(d, d1 ) on the coordinate plane. abcd = −1, implies
that the points form a orthoentric system, in particular one of the points lies in the interior of the triangle
determined by the rest. Now note that that the first expression is twice the area of △ABC, the next is twice
the area of △BCD, and the next of △CDA. Hence twice the area of △ABD must either be the sum of all

11
the three values (=9), if C lies in the interior of △ABD, or it should be the difference of the largest minus
the sum of other two (=3) (if B lies in △CAD.) Thus the sum of possible values is 12 .

Problem 14
A positive integer n is said to be a quadratic residue modulo 97, if there exists an integer m, such that
m2 − n is divisible by 97 and 97 ∤ n. Alice randomly picks a triple (a, b, c) of quadratic residues modulo
97, where 1 ≤ a, b, c ≤ 97 and her choice of triple is equally likely among all possible choices. If the
x
probability that a + b + c is NOT a quadratic residue modulo 97 can be expressed as y, for relatively
prime positive integers x, y , then compute the value of x + y .

Sol : One can prove that a QR can be written as a sum of two QRs in 23 ways and in the sum of two NQRs
in 24 ways. Now we complementary count. Instead of counting a + b + c = d, we count a + b = c + d (as
x is a QR iff −x is a QR, since 97 is 1 mod 4. The common value is equal to a QR for 48 × 232 choices,
equal to a NQR for 48 × 242 choices and equal to zero for 482 choices. Complimentary counting gives the
1151
probability to be 2304 , giving an answer of 3455

Problem 15
Let N denote the number of upright paths from (0, 0) to (10, 10) which intersect the line x = y at
exactly 5 points other than the start and end points. If N can be expressed as 2a × b, where b is an odd
positive integer, compute a + b.

Note : A upright path is one where we only take steps towards right or upwards. For example the
following is an upright path from (0, 0) to (2, 2):

(0, 0) → (1, 0) → (2, 0) → (2, 1) → (2, 2)

whereas the following is not (as it has a leftward step):

(0, 0) → (1, 0) → (2, 0) → (3, 0) → (3, 1) → (3, 2) → (2, 2)

Sol : We will solve this using generating functions. Consider the line segment with endpoints at (0, 0) and
√
(10, 10). We are basically dividing this segment into 6 parts. For each sub segment of length k 2, we can
from one endpoint of it to the other using 2 × Ck−1 ways. (Cn denotes n-th Catalan Number). So the
problem boils down to finding the coefficient of x 10 in

26 (x + x 2 + 2x 3 + 5x 4 + 14x 5 + · · · )6

Actually we just need to find the coefficient of x 4 in (1 + x + 2x 2 + 5x 3 + 14x 4 )6 . After some casework, it
comes out to be 429. This gives a final answer of 6 + 429 = 435

12
3.2 Subjective Problems

Problem 1 (Kazi Aryan Amin)

Find all functions f:R→R such that the following equation holds
for all x, y ∈ R :

f (y f (x)) + f (xy ) = 2y f (x)

Proof. The only solutions are f (x) = x for all x ∈ R and f (x) = 0 for all x ∈ R. Its easy to see that these
work. We now show that these are the only ones.
Let P (x, y ) denote the given assertion. Note that P (0, 0) gives f (0) = 0
Assume that there exists some a ̸= 0 with f (a) = 0. Then P ( xa , a), gives f (x) = 0 for all x ∈ R, which
is indeed a solution.
Now assume f (x) = 0 =⇒ x = 0. We show that f is injective. Indeed suppose f (a) = f (b) for some
a ̸= b. Then P (a, x) and P (b, x) imply f (ax) = f (bx) for all x ∈ R. And P (x, a) and P (x, b) gives a = b,
proving injectivity for f ̸≡ 0.
Finally, P (x, y ) and P (y , x) together give f (xf (y )) = f (y f (x)) for all x, y ∈ RR, implying xf (y ) =
f (x)
y f (x), so that x is constant for x ̸= 0. This implies f (x) = cx for some c ∈ R. Plugging back we observe
that only c = 1 works.

13
 Problem 2 (Kazi Aryan Amin)
Find all pairs of positive integers (a, b) such that for all positive integers
n > 20232023 , the number n2 + an + b has a divisor d > 1, such that n | d − 1.

Proof. The answer is all pairs of the form (a, 1), and (a, b) with a − b = 1. (where a, b are positive integers.
Indeed, if b = 1, then n2 + an + 1 is a 1 mod n factor of itself. For a − b = 1, n2 + an + b always has n + 1
as a factor.
We now show that no other pairs work. For any such working pair (a, b), and n large, there exists
integers xn , yn ≥ 0, such that n2 + an + b = (nxn + 1)(nyn + b).
Now we have two cases :

• yn = 0 for all large enough n. This implies b divides n2 + an + b for all large n. Hence b divides
(n + 1)2 + a(n + 1) + b − n2 − an − b = 2n + a + 1 for all large n. This can hold iff b = 1 or b = 2
and a is odd. In the later case, we have:

n2 + an + 2 n(n + a)
nxn + 1 = = +1
2 2
for all large n. However for n = 2k, with k odd, we see that the LHS is odd, whereas the RHS is even,
which leads to a contradiction. Hence b = 1.
• yn ≥ 1 for infinitely many n. In this case, we may bound:

(n2 + an + b) = (nxn + 1)(nyn + b) > xn yn · n2

However for sufficiently large n, n2 + an + b < 2n2 , implying xn yn < 2 for sufficiently large n. Thus
xn = yn = 1, for all large n. This implies n + 1 divides n2 + an + b for infinitely many integers n, thus
it must do so as a polynomial as well. This leads to a − b = 1.

Having exhausted all cases we are done.

14
 Problem 3 (Kazi Aryan Amin)
Let ω denote the circumcircle of triangle ∆ABC. Suppose the internal and external bisectors of ∠BAC,
intersect BC and ω again at K, L respectively. Points X, Y lie on ω such that LK = LX = LY . Prove
that XY , and the line through K perpendicular to BC meet on the A-median.

Proof.
Let M denote the midpoint of BC and suppose AM hits ⊙(ABC) again at M ′ . Suppose the line through
K perpendicular to BC hits M ′ L at K ′ . We have the following claims:

Claim. M ′ L passes through the reflection K1′ of K in M

Define f (Z) = ± BZ
CZ to be positive if Z and A are on the same side of BC, and negative otherwise.
Also define it to be negative on segment BC and positive on other points on line BC. Then by standard
applications of the ratio lemma, we have : f (M ′ )f (A) = f (M) = 1 and hence f (LM ′ ∩ BC) = f (L)f (M ′ ) =
1 1
f (A) = f (K) and thus the claim follows.

Claim. LK = LK ′

Angle chase:
∠K ′ KL = ∠KLM = ∠MLM ′ = ∠LK ′ K =⇒ LK = LK ′

Claim. K ′ , A, K, M ′ lie on a circle

15
Note that A, K, M, L are concyclic. Thus we have :

∠KAM ′ = ∠KLM = ∠MLM ′ = ∠KK ′ M ′

Conclude by radical axis on ⊙(ABC), ⊙(KXY ) and ⊙(K ′ AKM ′ ).

16
 Problem 4 (Kazi Aryan Amin and Pranjal Srivastava)
2002 people stand in a line. Each person either always tells the truth, or always lies. Starting from the
back, Alice asks 1995 people :

How many liars are are standing in front of you?

and records their answers. Prove Alice can pick a subset of non-negative integers S such that the sum
of elements of S is atmost 2023 and she can guarantee that number of truthful people is in S.

Proof. Number the people 1 through 2002 from left to right. We start with the set S = {0, 1, 2, · · · 7},
which denotes the number of possible truthful people amongst the first 7 people. Then we start asking from
the eighth person onwards, and inductively build our set S. At every stage, consider the answer given by
the i -th individual, say x. If x ̸∈ S, then person i must be a liar, as S must contain the number of truthful
people in [1, i − 1]. If x ∈ S, then we update x to x + 1. This works because if i was truthful, the number
of truthful people in [1, i + 1] should be x + 1 (in particular, not =x). Similarly if i is a liar, then number
of truthful people in [1, i ] is not equal to x, so we may delete x safely in this case. This covers all cases.
Note that the sum of elements of S increases by 1 at each stage, and hence the final sum of elenents of S
is atmost 0 + 1 + 2 + · · · + 7 + 1995 = 2023.

17
 Problem 5 (Kazi Aryan Amin)
The A-excircle of ∆ABC is tangent to BC at D. The line AD intersects the incircle of ∆ABC at points
Y, Z such that AZ > AY . The line through Z parallel to the external angle bisector of ∠BAC meets
[ in the circumcircle of ∆ABC.
BC at X. Prove that XY passes through the midpoint of arc BAC

Proof.
Rename the A-extouch point to be E and let the incircle be tangent to BC at D. Suppose the reflection
of AE over AI hits the incircle again at Z ′ and the circumcircle of △ABC at T . Let L denote the midpoint
[ in ⊙(ABC). It is well known that T is the tangency point of the A-mixtilinear incircle with the
of BAC
circumcircle of △ABC. We now proceed with the following claims:

Claim. Z ′ lies on XZ

Follows from the fact that, {Z, Z ′ } and {AE, AT } are reflections about AI.

Claim. Suppose LI hits BC again at R. Then RZ ′ is tangent to the incircle

18
 Note that T D and T A are isogonal in ∠BT C. Thus Z ′ and D are reflections of each other in T L. Since
RD is tangent to the incircle, the claim follows.
Now we’re ready to finish. Note that it is well known that MZ is tangent to the incircle. Suppose
RZ ′ ∩ MZ = K, and hence we have (XD; RM) = −1, as the incircle is the K-excircle in △KZZ ′ . Again
note we have :
L
−1 = (Y D; I∞DY ) = (LY ∩ BC, D; RM)

These together imply LY ∩ BC = X, as desired

19