# 39th Canadian Mathematical Olympiad Wednesday, March 28, 2007 ![](https://cdn.mathpix.com/cropped/2024_04_17_e8b78bc64605e45fe70fg-1.jpg?height=249&width=168&top_left_y=412&top_left_x=984) ## Solutions to the 2007 CMO paper ![](https://cdn.mathpix.com/cropped/2024_04_17_e8b78bc64605e45fe70fg-1.jpg?height=570&width=653&top_left_y=867&top_left_x=736) Solution to 1. Identify five subsets $A, B, C, D, E$ of the board, where $C$ consists of the squares occupied by the six dominos already placed, $B$ is the upper right corner, $D$ is the lower left corner, $A$ consists of the squares above and to the left of those in $B \cup C \cup D$ and $E$ consists of the squares below and to the right of those in $B \cup C \cup D$. The board can be coloured checkerboard fashion so that $A$ has 13 black and 16 white squares, $B$ a single white square, $E 16$ black and 13 white squares and $D$ a single black square. Each domino beyond the original six must lie either entirely in $A \cup B \cup D$ or $C \cup B \cup D$, either of which contains at most 14 dominos. Thus, altogether, we cannot have more that $2 \times 14+6=34$ dominos. This is achievable, by placing 14 dominos in $A \cup D$ and 14 in $E \cup B$. Solution to 2. If the triangles are isosceles, then they must be congruent and the desired ratio is 1 . For, if they share equal side lengths, at least one of these side lengths on one triangle corresponds to the same length on the other. And if they share unequal side lengths, then either equal sides correspond or unequal sides correspond in both directions and the ratio is 1. This falls within the bounds. Let the triangles be scalene. It is not possible for the same length to be an extreme length (largest or smallest) of both triangles. Therefore, we must have a situation in which the corresponding side lengths of the two triangles are $(x, y, z)$ and $(y, z, u)$ with $x1$. Thus, $y=r x$ and $z=r y=r^{2} x$. From the triangle inequality $z1,10 $$ $$ 1-\frac{a+b-2 a b}{1-a b}=\frac{(1-a)(1-b)}{1-a b}>0 . $$ Hence, it will never happen that a set of numbers will contain a pair of reciprocals, and the operation can always be performed. Solution 1. It can be shown by induction that any two numbers in any of the sets arise from disjoint subsets of $S$. Use an induction argument on the number of entries that one starts with. At each stage the number of entries is reduced by one. If we start with $n$ numbers, the final result is $$ \frac{\sigma_{1}-2 \sigma_{2}+3 \sigma_{3}-\cdots+(-1)^{n-1} n \sigma_{n}}{1-\sigma_{2}+2 \sigma_{3}-3 \sigma_{4}+\cdots+(-1)^{n-1}(n-1) \sigma_{n}} $$ where $\sigma_{i}$ is the symmetric sum of all $\left(\begin{array}{c}n \\ i\end{array}\right) i$-fold products of the $n$ elements $x_{i}$ in the list. Solution 2. Define $$ a * b=\frac{a+b-2 a b}{1-a b} . $$ This operation is commutative and also associative: $$ a *(b * c)=(a * b) * c=\frac{a+b+c-2(a b+b c+c a)+3 a b c}{1-(a b+b c+c a)+2 a b c} . $$ Since the final result amounts to a $*-$ product of elements of $S$ with some arrangement of brackets, the result follows. Solution 3. Let $\phi(x)=x /(1-x)$ for $01$ if and only if $01$ and $f(y)>1$, then also $f(x * y)>1$. It follows that if $x$ and $y$ lie in the open interval $(0,1)$, so does $x * y$. We also note that $f(x)$ is a one-one function. To each list $L$, we associate the function $g(L)$ defined by $$ g(L)=\sum\{f(x): x \in L\} $$ Let $L_{n}$ be the given list, and let the subsequent lists be $L_{n-1}, L_{n-2}, \cdots, L_{1}$, where $L_{i}$ has $i$ elements. Since $f(x * y)=$ $f(x)+f(y)-1, g\left(L_{i}\right)=g\left(L_{n}\right)-(n-i)$ regardless of the choice that creates each list from its predecessors. Hence $g\left(L_{1}\right)=g\left(L_{n}\right)-(n-1)$ is fixed. However, $g\left(L_{1}\right)=f(a)$ for some number $a$ with $0