# Solutions of APMO 2013 Problem 1. Let $A B C$ be an acute triangle with altitudes $A D, B E$ and $C F$, and let $O$ be the center of its circumcircle. Show that the segments $O A, O F, O B, O D, O C, O E$ dissect the triangle $A B C$ into three pairs of triangles that have equal areas. Solution. Let $M$ and $N$ be midpoints of sides $B C$ and $A C$, respectively. Notice that $\angle M O C=\frac{1}{2} \angle B O C=\angle E A B, \angle O M C=90^{\circ}=\angle A E B$, so triangles $O M C$ and $A E B$ are similar and we get $\frac{O M}{A E}=\frac{O C}{A B}$. For triangles $O N A$ and $B D A$ we also have $\frac{O N}{B D}=\frac{O A}{B A}$. Then $\frac{O M}{A E}=\frac{O N}{B D}$ or $B D \cdot O M=A E \cdot O N$. Denote by $S(\Phi)$ the area of the figure $\Phi$. So, we see that $S(O B D)=\frac{1}{2} B D \cdot O M=$ $\frac{1}{2} A E \cdot O N=S(O A E)$. Analogously, $S(O C D)=S(O A F)$ and $S(O C E)=S(O B F)$. Alternative solution. Let $R$ be the circumradius of triangle $A B C$, and as usual write $A, B, C$ for angles $\angle C A B, \angle A B C, \angle B C A$ respectively, and $a, b, c$ for sides $B C, C A, A B$ respectively. Then the area of triangle $O C D$ is $$ S(O C D)=\frac{1}{2} \cdot O C \cdot C D \cdot \sin (\angle O C D)=\frac{1}{2} R \cdot C D \cdot \sin (\angle O C D) $$ Now $C D=b \cos C$, and $$ \angle O C D=\frac{180^{\circ}-2 A}{2}=90^{\circ}-A $$ (since triangle $O B C$ is isosceles, and $\angle B O C=2 A$ ). So $$ S(O C D)=\frac{1}{2} R b \cos C \sin \left(90^{\circ}-A\right)=\frac{1}{2} R b \cos C \cos A $$ A similar calculation gives $$ \begin{aligned} S(O A F) & =\frac{1}{2} O A \cdot A F \cdot \sin (\angle O A F) \\ & =\frac{1}{2} R \cdot(b \cos A) \sin \left(90^{\circ}-C\right) \\ & =\frac{1}{2} R b \cos A \cos C \end{aligned} $$ so $O C D$ and $O A F$ have the same area. In the same way we find that $O B D$ and $O A E$ have the same area, as do $O C E$ and $O B F$. Problem 2. Determine all positive integers $n$ for which $\frac{n^{2}+1}{[\sqrt{n}]^{2}+2}$ is an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$. Solution. We will show that there are no positive integers $n$ satisfying the condition of the problem. Let $m=[\sqrt{n}]$ and $a=n-m^{2}$. We have $m \geq 1$ since $n \geq 1$. From $n^{2}+1=\left(m^{2}+a\right)^{2}+1 \equiv$ $(a-2)^{2}+1\left(\bmod \left(m^{2}+2\right)\right)$, it follows that the condition of the problem is equivalent to the fact that $(a-2)^{2}+1$ is divisible by $m^{2}+2$. Since we have $$ 0<(a-2)^{2}+1 \leq \max \left\{2^{2},(2 m-2)^{2}\right\}+1 \leq 4 m^{2}+1<4\left(m^{2}+2\right) $$ we see that $(a-2)^{2}+1=k\left(m^{2}+2\right)$ must hold with $k=1,2$ or 3 . We will show that none of these can occur. Case 1. When $k=1$. We get $(a-2)^{2}-m^{2}=1$, and this implies that $a-2= \pm 1, m=0$ must hold, but this contradicts with fact $m \geq 1$. Case 2. When $k=2$. We have $(a-2)^{2}+1=2\left(m^{2}+2\right)$ in this case, but any perfect square is congruent to $0,1,4 \bmod 8$, and therefore, we have $(a-2)^{2}+1 \equiv 1,2,5(\bmod 8)$, while $2\left(m^{2}+2\right) \equiv 4,6(\bmod 8)$. Thus, this case cannot occur either. Case 3. When $k=3$. We have $(a-2)^{2}+1=3\left(m^{2}+2\right)$ in this case. Since any perfect square is congruent to 0 or $1 \bmod 3$, we have $(a-2)^{2}+1 \equiv 1,2(\bmod 3)$, while $3\left(m^{2}+2\right) \equiv 0$ $(\bmod 3)$, which shows that this case cannot occur either. Problem 3. For $2 k$ real numbers $a_{1}, a_{2}, \ldots, a_{k}, b_{1}, b_{2}, \ldots, b_{k}$ define the sequence of numbers $X_{n}$ by $$ X_{n}=\sum_{i=1}^{k}\left[a_{i} n+b_{i}\right] \quad(n=1,2, \ldots) $$ If the sequence $X_{n}$ forms an arithmetic progression, show that $\sum_{i=1}^{k} a_{i}$ must be an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$. Solution. Let us write $A=\sum_{i=1}^{k} a_{i}$ and $B=\sum_{i=1}^{k} b_{i}$. Summing the corresponding terms of the following inequalities over $i$, $$ a_{i} n+b_{i}-1<\left[a_{i} n+b_{i}\right] \leq a_{i} n+b_{i} $$ we obtain $A n+B-k