APMO/md/en-apmo2005_sol.md

XVII APMO - March, 2005

Problems and Solutions

Problem 1. Prove that for every irrational real number $a$, there are irrational real numbers $b$ and $b^{\prime}$ so that $a+b$ and $a b^{\prime}$ are both rational while $a b$ and $a+b^{\prime}$ are both irrational. (Solution) Let $a$ be an irrational number. If $a^{2}$ is irrational, we let $b=-a$. Then, $a+b=0$ is rational and $a b=-a^{2}$ is irrational. If $a^{2}$ is rational, we let $b=a^{2}-a$. Then, $a+b=a^{2}$ is rational and $a b=a^{2}(a-1)$. Since

$$a=\frac{ab}{a^2}+1a=\backslash frac\{a\; b\}\{a^\{2\}\}+1$$

is irrational, so is $a b$. Now, we let $b^{\prime}=\frac{1}{a}$ or $b^{\prime}=\frac{2}{a}$. Then $a b^{\prime}=1$ or 2 , which is rational. Note that

$$a+b^{\mathrm{\prime }}=\frac{a^2+1}{a}\text{ or }a+b^{\mathrm{\prime }}=\frac{a^2+2}{a}\mathrm{.}a+b^\{\backslash prime\}=\backslash frac\{a^\{2\}+1\}\{a\}\; \backslash quad\; \backslash text\; \{\; or\; \}\; \backslash quad\; a+b^\{\backslash prime\}=\backslash frac\{a^\{2\}+2\}\{a\}\; .$$

Since,

$$\frac{a^2+2}{a}-\frac{a^2+1}{a}=\frac{1}{a}\backslash frac\{a^\{2\}+2\}\{a\}-\backslash frac\{a^\{2\}+1\}\{a\}=\backslash frac\{1\}\{a\}$$

at least one of them is irrational.

Problem 2. Let $a, b$ and $c$ be positive real numbers such that $a b c=8$. Prove that

$$\frac{a^2}{\sqrt{(1+a^3)(1+b^3)}}+\frac{b^2}{\sqrt{(1+b^3)(1+c^3)}}+\frac{c^2}{\sqrt{(1+c^3)(1+a^3)}}\ge \frac{4}{3}\mathrm{.}\backslash frac\{a^\{2\}\}\{\backslash sqrt\{\backslash left(1+a^\{3\}\backslash right)\backslash left(1+b^\{3\}\backslash right)\}\}+\backslash frac\{b^\{2\}\}\{\backslash sqrt\{\backslash left(1+b^\{3\}\backslash right)\backslash left(1+c^\{3\}\backslash right)\}\}+\backslash frac\{c^\{2\}\}\{\backslash sqrt\{\backslash left(1+c^\{3\}\backslash right)\backslash left(1+a^\{3\}\backslash right)\}\}\; \backslash geq\; \backslash frac\{4\}\{3\}\; .$$

(Solution) Observe that

$$\frac{1}{\sqrt{1+x^3}}\ge \frac{2}{2+x^2}\backslash frac\{1\}\{\backslash sqrt\{1+x^\{3\}\}\}\; \backslash geq\; \backslash frac\{2\}\{2+x^\{2\}\}$$

In fact, this is equivalent to $\left(2+x^{2}\right)^{2} \geq 4\left(1+x^{3}\right)$, or $x^{2}(x-2)^{2} \geq 0$. Notice that equality holds in (1) if and only if $x=2$.

We substitute $x$ by $a, b, c$ in (1), respectively, to find

$$\begin{array}{c}{\displaystyle \frac{a^2}{\sqrt{(1+a^3)(1+b^3)}}+\frac{b^2}{\sqrt{(1+b^3)(1+c^3)}}+\frac{c^2}{\sqrt{(1+c^3)(1+a^3)}}}\\ {\displaystyle \ge \frac{4a^2}{(2+a^2)(2+b^2)}+\frac{4b^2}{(2+b^2)(2+c^2)}+\frac{4c^2}{(2+c^2)(2+a^2)}}\end{array}\backslash begin\{gathered\}\; \backslash frac\{a^\{2\}\}\{\backslash sqrt\{\backslash left(1+a^\{3\}\backslash right)\backslash left(1+b^\{3\}\backslash right)\}\}+\backslash frac\{b^\{2\}\}\{\backslash sqrt\{\backslash left(1+b^\{3\}\backslash right)\backslash left(1+c^\{3\}\backslash right)\}\}+\backslash frac\{c^\{2\}\}\{\backslash sqrt\{\backslash left(1+c^\{3\}\backslash right)\backslash left(1+a^\{3\}\backslash right)\}\}\; \backslash \backslash \; \backslash geq\; \backslash frac\{4\; a^\{2\}\}\{\backslash left(2+a^\{2\}\backslash right)\backslash left(2+b^\{2\}\backslash right)\}+\backslash frac\{4\; b^\{2\}\}\{\backslash left(2+b^\{2\}\backslash right)\backslash left(2+c^\{2\}\backslash right)\}+\backslash frac\{4\; c^\{2\}\}\{\backslash left(2+c^\{2\}\backslash right)\backslash left(2+a^\{2\}\backslash right)\}\; \backslash end\{gathered\}$$

We combine the terms on the right hand side of (2) to obtain

$$\text{ Left hand side of }(2)\ge \frac{2S(a,b,c)}{36+S(a,b,c)}=\frac{2}{1+36\mathrm{/}S(a,b,c)}\backslash text\; \{\; Left\; hand\; side\; of\; \}(2)\; \backslash geq\; \backslash frac\{2\; S(a,\; b,\; c)\}\{36+S(a,\; b,\; c)\}=\backslash frac\{2\}\{1+36\; /\; S(a,\; b,\; c)\}$$

where $S(a, b, c):=2\left(a^{2}+b^{2}+c^{2}\right)+(a b)^{2}+(b c)^{2}+(c a)^{2}$. By AM-GM inequality, we have

Note that the equalities holds if and only if $a=b=c=2$. The above inequalities yield

$$S(a,b,c)=2(a^2+b^2+c^2)+(ab{)}^2+(bc{)}^2+(ca{)}^2\ge 72S(a,\; b,\; c)=2\backslash left(a^\{2\}+b^\{2\}+c^\{2\}\backslash right)+(a\; b)^\{2\}+(b\; c)^\{2\}+(c\; a)^\{2\}\; \backslash geq\; 72$$

Therefore

$$\frac{2}{1+36\mathrm{/}S(a,b,c)}\ge \frac{2}{1+36\mathrm{/}72}=\frac{4}{3}\backslash frac\{2\}\{1+36\; /\; S(a,\; b,\; c)\}\; \backslash geq\; \backslash frac\{2\}\{1+36\; /\; 72\}=\backslash frac\{4\}\{3\}$$

which is the required inequality.

Problem 3. Prove that there exists a triangle which can be cut into 2005 congruent triangles. (Solution) Suppose that one side of a triangle has length $n$. Then it can be cut into $n^{2}$ congruent triangles which are similar to the original one and whose corresponding sides to the side of length $n$ have lengths 1 .

Since $2005=5 \times 401$ where 5 and 401 are primes and both primes are of the type $4 k+1$, it is representable as a sum of two integer squares. Indeed, it is easy to see that

Let $A B C$ be a right-angled triangle with the legs $A B$ and $B C$ having lengths 39 and 22 , respectively. We draw the altitude $B K$, which divides $A B C$ into two similar triangles. Now we divide $A B K$ into $39^{2}$ congruent triangles as described above and $B C K$ into $22^{2}$ congruent triangles. Since $A B K$ is similar to $B K C$, all 2005 triangles will be congruent.

Problem 4. In a small town, there are $n \times n$ houses indexed by $(i, j)$ for $1 \leq i, j \leq n$ with $(1,1)$ being the house at the top left corner, where $i$ and $j$ are the row and column indices, respectively. At time 0 , a fire breaks out at the house indexed by $(1, c)$, where $c \leq \frac{n}{2}$. During each subsequent time interval $[t, t+1]$, the fire fighters defend a house which is not yet on fire while the fire spreads to all undefended neighbors of each house which was on fire at time $t$. Once a house is defended, it remains so all the time. The process ends when the fire can no longer spread. At most how many houses can be saved by the fire fighters? A house indexed by $(i, j)$ is a neighbor of a house indexed by $(k, \ell)$ if $|i-k|+|j-\ell|=1$. (Solution) At most $n^{2}+c^{2}-n c-c$ houses can be saved. This can be achieved under the following order of defending:

$$\begin{array}{c}{\displaystyle (2,c),(2,c+1);(3,c-1),(3,c+2);(4,c-2),(4,c+3);\dots }\\ {\displaystyle (c+1,1),(c+1,2c);(c+1,2c+1),\dots ,(c+1,n)}\end{array}\backslash begin\{gathered\}\; (2,\; c),(2,\; c+1)\; ;(3,\; c-1),(3,\; c+2)\; ;(4,\; c-2),(4,\; c+3)\; ;\; \backslash ldots\; \backslash \backslash \; (c+1,1),(c+1,2\; c)\; ;(c+1,2\; c+1),\; \backslash ldots,(c+1,\; n)\; \backslash end\{gathered\}$$

Under this strategy, there are 2 columns (column numbers $c, c+1$ ) at which $n-1$ houses are saved 2 columns (column numbers $c-1, c+2$ ) at which $n-2$ houses are saved ... 2 columns (column numbers $1,2 c$ ) at which $n-c$ houses are saved $n-2 c$ columns (column numbers $n-2 c+1, \ldots, n$ ) at which $n-c$ houses are saved Adding all these we obtain :

$$2[(n-1)+(n-2)+\cdots +(n-c)]+(n-2c)(n-c)=n^2+c^2-cn-c2[(n-1)+(n-2)+\backslash cdots+(n-c)]+(n-2\; c)(n-c)=n^\{2\}+c^\{2\}-c\; n-c$$

We say that a house indexed by $(i, j)$ is at level $t$ if $|i-1|+|j-c|=t$. Let $d(t)$ be the number of houses at level $t$ defended by time $t$, and $p(t)$ be the number of houses at levels greater than $t$ defended by time $t$. It is clear that

$$p(t)+\sum _{i=1}^{t}d(i)\le t\text{ and }p(t+1)+d(t+1)\le p(t)+1p(t)+\backslash sum\_\{i=1\}^\{t\}\; d(i)\; \backslash leq\; t\; \backslash text\; \{\; and\; \}\; p(t+1)+d(t+1)\; \backslash leq\; p(t)+1$$

Let $s(t)$ be the number of houses at level $t$ which are not burning at time $t$. We prove that

$$s(t)\le t-p(t)\le ts(t)\; \backslash leq\; t-p(t)\; \backslash leq\; t$$

for $1 \leq t \leq n-1$ by induction. It is obvious when $t=1$. Assume that it is true for $t=k$. The union of the neighbors of any $k-p(k)+1$ houses at level $k+1$ contains at least $k-p(k)+1$ vertices at level $k$. Since $s(k) \leq k-p(k)$, one of these houses at level $k$ is burning. Therefore, at most $k-p(k)$ houses at level $k+1$ have no neighbor burning. Hence we have

We now prove that the strategy given above is optimal. Since

$$\sum _{t=1}^{n-1}s(t)\le \left(\genfrac{}{}{0px}{}{n}{2}\right)\backslash sum\_\{t=1\}^\{n-1\}\; s(t)\; \backslash leq\backslash binom\{\; n\}\{2\}$$

the maximum number of houses at levels less than or equal to $n-1$, that can be saved under any strategy is at most $\binom{n}{2}$, which is realized by the strategy above. Moreover, at levels bigger than $n-1$, every house is saved under the strategy above.

The following is an example when $n=11$ and $c=4$. The houses with $\bigcirc$ mark are burned. The houses with $\otimes$ mark are blocked ones and hence those and the houses below them are saved.

Problem 5. In a triangle $A B C$, points $M$ and $N$ are on sides $A B$ and $A C$, respectively, such that $M B=B C=C N$. Let $R$ and $r$ denote the circumradius and the inradius of the triangle $A B C$, respectively. Express the ratio $M N / B C$ in terms of $R$ and $r$. (Solution) Let $\omega, O$ and $I$ be the circumcircle, the circumcenter and the incenter of $A B C$, respectively. Let $D$ be the point of intersection of the line $B I$ and the circle $\omega$ such that $D \neq B$. Then $D$ is the midpoint of the arc $A C$. Hence $O D \perp C N$ and $O D=R$.

We first show that triangles $M N C$ and $I O D$ are similar. Because $B C=B M$, the line $B I$ (the bisector of $\angle M B C$ ) is perpendicular to the line $C M$. Because $O D \perp C N$ and $I D \perp M C$, it follows that

$$\mathrm{\angle }ODI=\mathrm{\angle }NCM\backslash angle\; O\; D\; I=\backslash angle\; N\; C\; M$$

Let $\angle A B C=2 \beta$. In the triangle $B C M$, we have

$$\frac{CM}{NC}=\frac{CM}{BC}=2\sin \beta \backslash frac\{C\; M\}\{N\; C\}=\backslash frac\{C\; M\}\{B\; C\}=2\; \backslash sin\; \backslash beta$$

Since $\angle D I C=\angle D C I$, we have $I D=C D=A D$. Let $E$ be the point of intersection of the line $D O$ and the circle $\omega$ such that $E \neq D$. Then $D E$ is a diameter of $\omega$ and $\angle D E C=\angle D B C=\beta$. Thus we have

$$\frac{DI}{OD}=\frac{CD}{OD}=\frac{2R\sin \beta }{R}=2\sin \beta \mathrm{.}\backslash frac\{D\; I\}\{O\; D\}=\backslash frac\{C\; D\}\{O\; D\}=\backslash frac\{2\; R\; \backslash sin\; \backslash beta\}\{R\}=2\; \backslash sin\; \backslash beta\; .$$

Combining equations (8), (9), and (10) shows that triangles $M N C$ and $I O D$ are similar. It follows that

$$\frac{MN}{BC}=\frac{MN}{NC}=\frac{IO}{OD}=\frac{IO}{R}\mathrm{.}\backslash frac\{M\; N\}\{B\; C\}=\backslash frac\{M\; N\}\{N\; C\}=\backslash frac\{I\; O\}\{O\; D\}=\backslash frac\{I\; O\}\{R\}\; .$$

The well-known Euler's formula states that

$$O{I}^2=R^2-2Rr\mathrm{.}O\; I^\{2\}=R^\{2\}-2\; R\; r\; .$$

Therefore,

$$\frac{MN}{BC}=\sqrt{1-\frac{2r}{R}}\backslash frac\{M\; N\}\{B\; C\}=\backslash sqrt\{1-\backslash frac\{2\; r\}\{R\}\}$$

(Alternative Solution) Let $a$ (resp., $b, c$ ) be the length of $B C$ (resp., $A C, A B$ ). Let $\alpha$ (resp., $\beta, \gamma$ ) denote the angle $\angle B A C$ (resp., $\angle A B C, \angle A C B$ ). By introducing coordinates $B=(0,0), C=(a, 0)$, it is immediate that the coordinates of $M$ and $N$ are

$$M=(a\cos \beta ,a\sin \beta ),N=(a-a\cos \gamma ,a\sin \gamma )M=(a\; \backslash cos\; \backslash beta,\; a\; \backslash sin\; \backslash beta),\; \backslash quad\; N=(a-a\; \backslash cos\; \backslash gamma,\; a\; \backslash sin\; \backslash gamma)$$

respectively. Therefore,

Now we claim

$$\cos \gamma +\cos \beta +\cos \alpha =\frac{r}{R}+1\backslash cos\; \backslash gamma+\backslash cos\; \backslash beta+\backslash cos\; \backslash alpha=\backslash frac\{r\}\{R\}+1$$

From

we get

$$a(1+\cos \alpha )+b(1+\cos \beta )+c(1+\cos \gamma )=(a+b+c)(\cos \alpha +\cos \beta +\cos \gamma )a(1+\backslash cos\; \backslash alpha)+b(1+\backslash cos\; \backslash beta)+c(1+\backslash cos\; \backslash gamma)=(a+b+c)(\backslash cos\; \backslash alpha+\backslash cos\; \backslash beta+\backslash cos\; \backslash gamma)$$

Thus

On the other hand, from $R=\frac{a}{2 \sin \alpha}$ it follows that

Also from $\frac{1}{2}(a+b+c) r=\frac{1}{2} b c \sin \alpha$, it follows that

Combining (19), (20) and (21), we get (16) as desired. Finally, by (15) and (16) we have

$$\frac{MN}{BC}=\sqrt{1-\frac{2r}{R}}\backslash frac\{M\; N\}\{B\; C\}=\backslash sqrt\{1-\backslash frac\{2\; r\}\{R\}\}$$

Another proof of (16) from R.A. Johnson's "Advanced Euclidean Geometry" ${ }^{1}$ : Construct the perpendicular bisectors $O D, O E, O F$, where $D, E, F$ are the midpoints of $B C, C A, A B$, respectively. By Ptolemy's Theorem applied to the cyclic quadrilateral $O E A F$, we get

$$\frac{a}{2}\cdot R=\frac{b}{2}\cdot OF+\frac{c}{2}\cdot OE\backslash frac\{a\}\{2\}\; \backslash cdot\; R=\backslash frac\{b\}\{2\}\; \backslash cdot\; O\; F+\backslash frac\{c\}\{2\}\; \backslash cdot\; O\; E$$

Similarly

$$\frac{b}{2}\cdot R=\frac{c}{2}\cdot OD+\frac{a}{2}\cdot OF,\frac{c}{2}\cdot R=\frac{a}{2}\cdot OE+\frac{b}{2}\cdot OD\mathrm{.}\backslash frac\{b\}\{2\}\; \backslash cdot\; R=\backslash frac\{c\}\{2\}\; \backslash cdot\; O\; D+\backslash frac\{a\}\{2\}\; \backslash cdot\; O\; F,\; \backslash quad\; \backslash frac\{c\}\{2\}\; \backslash cdot\; R=\backslash frac\{a\}\{2\}\; \backslash cdot\; O\; E+\backslash frac\{b\}\{2\}\; \backslash cdot\; O\; D\; .$$

Adding, we get

$$sR=OD\cdot \frac{b+c}{2}+OE\cdot \frac{c+a}{2}+OF\cdot \frac{a+b}{2}s\; R=O\; D\; \backslash cdot\; \backslash frac\{b+c\}\{2\}+O\; E\; \backslash cdot\; \backslash frac\{c+a\}\{2\}+O\; F\; \backslash cdot\; \backslash frac\{a+b\}\{2\}$$

where $s$ is the semiperimeter. But also, the area of triangle $O B C$ is $O D \cdot \frac{a}{2}$, and adding similar formulas for the areas of triangles $O C A$ and $O A B$ gives

$$rs=\mathrm{△}ABC=OD\cdot \frac{a}{2}+OE\cdot \frac{b}{2}+OF\cdot \frac{c}{2}r\; s=\backslash triangle\; A\; B\; C=O\; D\; \backslash cdot\; \backslash frac\{a\}\{2\}+O\; E\; \backslash cdot\; \backslash frac\{b\}\{2\}+O\; F\; \backslash cdot\; \backslash frac\{c\}\{2\}$$

Adding (23) and (24) gives $s(R+r)=s(O D+O E+O F)$, or

$$OD+OE+OF=R+r\mathrm{.}O\; D+O\; E+O\; F=R+r\; .$$

Since $O D=R \cos A$ etc., (16) follows.

[^0] [^0]: ${ }^{1}$ This proof was introduced to the coordinating country by Professor Bill Sands of Canada.