2024 Elmo
2024 Elmo
– Day 1
1 In convex quadrilateral ABCD, let diagonals AC and BD intersect at E. Let the circumcircles
of ADE and BCE intersect AB again at P ̸= A and Q ̸= B, respectively. Let the circumcircle
of ACP intersect AD again at R ̸= A, and let the circumcircle of BDQ intersect BC again at
S ̸= B. Prove that A, B, R, and S are concyclic.
Tiger Zhang
2 For positive integers a and b, an (a, b)-shuffle of a deck of a+b cards is any shuffle that preserves
the relative order of the top a cards and the relative order of the bottom b cards. Let n, k, a1 , a2 ,
. . . , ak , b1 , b2 , . . . , bk be fixed positive integers such that ai + bi = n for all 1 ≤ i ≤ k. Big Bird has
a deck of n cards and will perform an (ai , bi )-shuffle for each 1 ≤ i ≤ k, in ascending order of
i. Suppose that Big Bird can reverse the order of the deck. Prove that Big Bird can also achieve
any of the n! permutations of the cards.
Linus Tang
x1 + x2 + · · · + xn = x1 + x2 + · · · + xn .
Elmo inserts at least one f to the left side of the equation and adds parentheses to create a
valid functional equation. For example, if n = 3, Elmo could have created the equation
f (x1 + f (f (x2 ) + x3 )) = x1 + x2 + x3 .
– Day 2
4 Let n be a positive integer. Find the number of sequences a0 , a1 , a2 , . . . , a2n of integers in the
range [0, n] such that for all integers 0 ≤ k ≤ n and all nonnegative integers m, there exists an
integer k ≤ i ≤ 2k such that ⌊k/2m ⌋ = ai .
Andrew Carratu
5 In triangle ABC with AB < AC and AB + AC = 2BC, let M be the midpoint of BC. Choose
point P on the extension of BA past A and point Q on segment AC such that M lies on P Q.
Let X be on the opposite side of AB from C such that AX ∥ BC and AX = AP = AQ. Let
BX intersect the circumcircle of BM Q again at Y ̸= B, and let CX intersect the circumcircle
of CM P again at Z ̸= C. Prove that A, Y , and Z are collinear.
Tiger Zhang
6 For a prime p, let Fp denote the integers modulo p, and let Fp [x] be the set of polynomials with
coefficients in Fp . Find all p for which there exists a quartic polynomial P (x) ∈ Fp [x] such that
for all integers k, there exists some integer ℓ such that P (ℓ) ≡ k (mod p). (Note that there are
p4 (p − 1) quartic polynomials in Fp [x] in total.)
Aprameya Tripathy