# USA IMO TST 2016 Solutions
United States of America - IMO Team Selection Tests
Evan Chen《陳誼廷》
60 ${ }^{\text {th }}$ IMO 2016 Hong Kong ## Contents 0 Problems ..... 2 1 Solutions to Day 1 ..... 3 1.1 USA TST 2016/1, proposed by Maria Monks ..... 3 1.2 USA TST 2016/2, proposed by Evan Chen ..... 4 1.3 USA TST 2016/3, proposed by Mark Sellke ..... 6 2 Solutions to Day 2 ..... 8 2.1 USA TST 2016/4, proposed by Iurie Boreico ..... 8 2.2 USA TST 2016/5, proposed by Zilin Jiang ..... 9 2.3 USA TST 2016/6, proposed by Ivan Borsenco ..... 10 ## §0 Problems 1. Let $S=\{1, \ldots, n\}$. Given a bijection $f: S \rightarrow S$ an orbit of $f$ is a set of the form $\{x, f(x), f(f(x)), \ldots\}$ for some $x \in S$. We denote by $c(f)$ the number of distinct orbits of $f$. For example, if $n=3$ and $f(1)=2, f(2)=1, f(3)=3$, the two orbits are $\{1,2\}$ and $\{3\}$, hence $c(f)=2$. Given $k$ bijections $f_{1}, \ldots, f_{k}$ from $S$ to itself, prove that $$ c\left(f_{1}\right)+\cdots+c\left(f_{k}\right) \leq n(k-1)+c(f) $$ where $f: S \rightarrow S$ is the composed function $f_{1} \circ \cdots \circ f_{k}$. 2. Let $A B C$ be a scalene triangle with circumcircle $\Omega$, and suppose the incircle of $A B C$ touches $B C$ at $D$. The angle bisector of $\angle A$ meets $B C$ and $\Omega$ at $K$ and $M$. The circumcircle of $\triangle D K M$ intersects the $A$-excircle at $S_{1}, S_{2}$, and $\Omega$ at $T \neq M$. Prove that line $A T$ passes through either $S_{1}$ or $S_{2}$. 3. Let $p$ be a prime number. Let $\mathbb{F}_{p}$ denote the integers modulo $p$, and let $\mathbb{F}_{p}[x]$ be the set of polynomials with coefficients in $\mathbb{F}_{p}$. Define $\Psi: \mathbb{F}_{p}[x] \rightarrow \mathbb{F}_{p}[x]$ by $$ \Psi\left(\sum_{i=0}^{n} a_{i} x^{i}\right)=\sum_{i=0}^{n} a_{i} x^{x^{i}} . $$ Prove that for nonzero polynomials $F, G \in \mathbb{F}_{p}[x]$, $$ \Psi(\operatorname{gcd}(F, G))=\operatorname{gcd}(\Psi(F), \Psi(G)) $$ 4. Let $\sqrt{3}=1 . b_{1} b_{2} b_{3} \cdots(2)$ be the binary representation of $\sqrt{3}$. Prove that for any positive integer $n$, at least one of the digits $b_{n}, b_{n+1}, \ldots, b_{2 n}$ equals 1 . 5. Let $n \geq 4$ be an integer. Find all functions $W:\{1, \ldots, n\}^{2} \rightarrow \mathbb{R}$ such that for every partition $[n]=A \cup B \cup C$ into disjoint sets, $$ \sum_{a \in A} \sum_{b \in B} \sum_{c \in C} W(a, b) W(b, c)=|A||B||C| . $$ 6. Let $A B C$ be an acute scalene triangle and let $P$ be a point in its interior. Let $A_{1}$, $B_{1}, C_{1}$ be projections of $P$ onto triangle sides $B C, C A, A B$, respectively. Find the locus of points $P$ such that $A A_{1}, B B_{1}, C C_{1}$ are concurrent and $\angle P A B+\angle P B C+$ $\angle P C A=90^{\circ}$. ## §1 Solutions to Day 1 ## §1.1 USA TST 2016/1, proposed by Maria Monks Available online at https://aops.com/community/p5679356. ## Problem statement Let $S=\{1, \ldots, n\}$. Given a bijection $f: S \rightarrow S$ an orbit of $f$ is a set of the form $\{x, f(x), f(f(x)), \ldots\}$ for some $x \in S$. We denote by $c(f)$ the number of distinct orbits of $f$. For example, if $n=3$ and $f(1)=2, f(2)=1, f(3)=3$, the two orbits are $\{1,2\}$ and $\{3\}$, hence $c(f)=2$. Given $k$ bijections $f_{1}, \ldots, f_{k}$ from $S$ to itself, prove that $$ c\left(f_{1}\right)+\cdots+c\left(f_{k}\right) \leq n(k-1)+c(f) $$ where $f: S \rightarrow S$ is the composed function $f_{1} \circ \cdots \circ f_{k}$. Most motivated solution is to consider $n-c(f)$ and show this is the transposition distance. Dumb graph theory works as well. ## §1.2 USA TST 2016/2, proposed by Evan Chen Available online at https://aops.com/community/p5679361. ## Problem statement Let $A B C$ be a scalene triangle with circumcircle $\Omega$, and suppose the incircle of $A B C$ touches $B C$ at $D$. The angle bisector of $\angle A$ meets $B C$ and $\Omega$ at $K$ and $M$. The circumcircle of $\triangle D K M$ intersects the $A$-excircle at $S_{1}, S_{2}$, and $\Omega$ at $T \neq M$. Prove that line $A T$ passes through either $S_{1}$ or $S_{2}$. We present an angle-chasing solution, and then a more advanced alternative finish. 【 First solution (angle chasing). Assume for simplicity $A B\operatorname{deg} B$, then the remainder when $A$ is divided by $B$ is in $\beth$. Suppose $\operatorname{deg} A=p^{k}$ and $B=x^{p^{k-1}}-$ $c_{2} x^{p^{k-2}}-\cdots-c_{k}$. Then $$ \begin{aligned} x^{p^{k}} & \equiv\left(c_{2} x^{p^{k-2}}+c_{3} x^{p^{k-3}}+\cdots+c_{k}\right)^{p} \quad(\bmod B) \\ & \equiv c_{2} x^{p^{k-1}}+c_{3} x^{p^{k-2}} \cdots+c_{k} \quad(\bmod B) \end{aligned} $$ since exponentiation by $p$ commutes with addition in $\mathbb{F}_{p}$. This is enough to imply the conclusion. The proof if $\operatorname{deg} B$ is smaller less than $p^{k-1}$ is similar. Thus, if we view $\mathbb{F}_{p}[x]$ and $\beth$ as partially ordered sets under polynomial division, then gcd is the "greatest lower bound" or "meet" in both partially ordered sets. We will now prove that $\Psi$ is an isomorphism of the posets. We have already seen that $P|Q \Longrightarrow \Psi(P)| \Psi(Q)$ from the first solution. For the converse: Claim - If $\Psi(P) \mid \Psi(Q)$ then $P \mid Q$. Proof. Suppose $\Psi(P) \mid \Psi(Q)$, but $Q=P A+B$ where $\operatorname{deg} B<\operatorname{deg} P$. Thus $\Psi(P) \mid$ $\Psi(P A)+\Psi(B)$, hence $\Psi(P) \mid \Psi(B)$, but $\operatorname{deg} \Psi(P)>\operatorname{deg} \Psi(B)$ hence $\Psi(B)=0 \Longrightarrow$ $B=0$ 。 This completes the proof. Remark. In fact $\Psi: \mathbb{F}_{p}[x] \rightarrow \beth$ is a ring isomorphism if we equip $\beth$ with function composition as the ring multiplication. Indeed in the proof of the first claim (that $P|Q \Longrightarrow \Psi(P)|$ $\Psi(Q)$ ) we saw that $$ \Psi(R P)=\sum_{i=0}^{k} r_{i} \Psi(P)^{p^{i}}=\Psi(R) \circ \Psi(P) $$ ## §2 Solutions to Day 2 ## §2.1 USA TST 2016/4, proposed by lurie Boreico Available online at https://aops.com/community/p6368201. ## Problem statement Let $\sqrt{3}=1 . b_{1} b_{2} b_{3} \cdots(2)$ be the binary representation of $\sqrt{3}$. Prove that for any positive integer $n$, at least one of the digits $b_{n}, b_{n+1}, \ldots, b_{2 n}$ equals 1 . Assume the contrary, so that for some integer $k$ we have $$ k<2^{n-1} \sqrt{3}