
The 2018 Canadian Open Mathematics Challenge — Nov 8/9
by Prof. Nicolae Strungaru, Grant MacEwan University
The COMC has three parts. In part A solutions do not require work be shown and may be possible to do in your head. In part B the problems begin to draw on more knowledge and have some more challenging aspects that will need a pencil and paper to solve. By Part C the problems require that work be shown and involve arguments to support the answer.
We have selected a cross section of contest problems from a variety of national and regional contests that we hope will stimulate interest in problem solving and give some experience to get ready to write the Canadian Open Mathematics Challenge in November. The problem areas are not tied to particular grade levels, or to the curriculum but cover a number of areas from algebra, through logic and some geometry.
We will post solutions to these problems one week later, but teachers should be aware that determined students may be able to locate solutions elsewhere online before then.
For a more comprehensive set of problems and solutions at each of these levels, please feel welcome to download past official exams and solutions from our archive.
Need more COMC ProblemsoftheWeek? Take a look at the set from past years: 2017, 2016, 2015, or 2014!
Week 6
This week we will look at a geometry problem.
Let $ABC$ be an acuteangled triangle with $\angle B = \angle C$. Let $O$ be the circumcentre and let $H$ be the orthocentre of $\Delta ABC$. Prove that the centre of the circle $BOH$ lies on $AB$.
Week 5
This week we look at a functional equation.
Denote by $\mathbb{Q}$ the set of rational numbers. Find all functions $f: \mathbb{Q} \to \mathbb{Q}$ such that
(1)  $f\left(x+f(y)\right)=y+f(x) \qquad \forall x,y \in \mathbb{Q}.$ 
Problem 8 of the 15^{th} Irish Mathematical Olympiad, which appeared in Crux Mathematicorum [2005:437439]. We present the solution by Mohammed Aassila which appeared at [2007:33].
Setting $x=0$ in (1) we get $$ f(f(y))=y+f(0) \qquad \forall y \in \mathbb{Q}. $$
We claim that $f$ is a onetoone function. Indeed, if $f(a)=f(b)$ then $$ a+f(0)=f(f(a))=f(f(b))=b+f(0) \,,$$ and hence, $a=b$.
Next, setting $y=0$ in (1) we get $$f(x+f(0))=f(x).$$
Since $f$ is onetoone, we get that $x+f(0)=x$ and hence $$f(0)=0.$$
Therefore, we also have $$f(f(y))=y \qquad \forall y \in \mathbb{Q}.$$
Next, replacing $y$ by $f(y)$ in (1), and using $f(f(y))=y$ we get $$f(x)+f(y)=f(x+f(f(y))=f(x+y) \qquad \forall x, y \in \mathbb{Q}.$$
This is the well known Cauchy Functional Equation, and implies that, with $a=f(1) \in \mathbb{Q}$, we have $f(x)=ax \, \forall x \in \mathbb{Q}$.
Next, since $f(f(y))=y \, \forall y \in \mathbb{Q}$ we get $a=\pm 1$.
Therefore, there are only two possible solutions to this equation: $f(x)=x \, \forall x \in \mathbb{Q}$ and $f(x)=x \, \forall x \in \mathbb{Q}$.
It is easy to check that $f(x)=x$ and $f(x)=x$ are indeed solutions to (1).
Note: For the unfamiliar reader, we include below the Cauchy Functional Equation.
Let $f: \mathbb Q \to \mathbb Q$ be so that $$f(x+y)=f(x)+f(y) \qquad \forall x,y \in \mathbb Q$$ and let $a:=f(1)$.
Since $f(x+y)=f(x)+f(y)$, an easy induction argument shows that $f(nx)=nf(x) \, \forall x \in \mathbb Q, n \in \mathbb N$. Also, as $$ 0=f(0)=f(xx)=f(x)+f(x) \,,$$ it follows that $f$ is an odd function and hence $$f(nx)=nf(x) \qquad \forall x \in \mathbb Q, n \in \mathbb Z.$$
Let $x \in \mathbb Q$ be arbitrary, and write $x= \frac{m}{n}$ with $m,n \in \mathbb Z$ and $n >0$. Then, $$a=f(1)=f(n \cdot \frac{1}{n})=n f(\frac{1}{n}) \Rightarrow f(\frac{1}{n})=\frac{a}{n} \,,$$ and hence $$f(x)=f(\frac{m}{n})=f(m \cdot \frac{1}{n})=m f(\frac{1}{n}) =m \frac{a}{n}=ax.$$
This shows that $f(x)=ax$ for all $x \in \mathbb Q$.
Week 4
This week we look at a polynomial with integer coefficients.
Given $n$ distinct integers $m_1,...,m_n$, prove that there exists a polynomial $P(X)$ of degree $n$ with integer coefficients, which satisfies the following two conditions:
Problem 4 of the 4^{th} Mathematical Olympiad of Republic of China (Taiwan), which appeared in Crux Mathematicorum [1998:322323]. We present the solution by Pierre Bornsztein which appeared at [2000:75].
It is easy to see that $$ P(X)=(Xm_1)(Xm_2)..(Xm_n)1 $$ has integer coefficients and degree $n$. To complete the proof we show that $P(X)$ satisfies (ii).
Assume by contradiction that we can find $Q,R \in \mathbb{Z}[X]$ of degree at most $n1$ such that $$ P(X)=Q(X)\cdot R(X). $$
Then, for each $1 \leq k \leq n$ we have $$ Q(m_k)\cdot R(m_k)=1. $$
This implies that either $Q(m_k)=1, R(m_k)=1$ or $Q(m_k)=1, R(m_k)=1$. We therefore get $$ Q(m_k)+R(m_k)=0 \qquad \forall 1 \leq k \leq n. $$ It follows that $Q(X)+R(X)$ is a polynomial of degree at most $n1$, which has $n$ distinct roots. Therefore $$ Q(X)+R(X) \equiv 0. $$
This implies that $R(X)=Q(X)$ and hence $$ P(X)=\left( Q(X) \right)^2. $$
But this is not possible since the leading coefficient of $P(X)$ is one. We therefore get a contradiction.
Since we got a contradiction, our assumption that $P(X)$ is reducible is wrong, and therefore $P(X)$ is irreducible, as claimed.
Week 3
This week we look at areas inside a trapezoid.
The two diagonals of a trapezoid divide it into four triangles. The areas of three of them are 1, 2 and 4 square units. What values can the area of the fourth triangle take?
Problem 19 of the 19^{th} Lithuanian Team Contest, which appeared in Crux Mathematicorum [2008:282284]. We present the solution by George Tsapakidis which appeared at [2009:303].
For a triangle with vertices $X,Y$ and $Z$, we will denote by $[XYZ]$ its area.
Since $\Delta ABD$ and $\Delta ABC$ have the same basis $AB$ and equal altitudes to this basis, they have the same area. Therefore $$[OAD]+[OAB]=[ABD]=[ABC]=[OBC]+[OAB].$$
Therefore, $[OAD]=[OBC]$.
Next, since the altitude from $B$ to the sides $AO, OC$ is the same, we have $$\frac{[AOB]}{[BOC]}=\frac{AO}{CO}.$$
Same way, since the altitude from $D$ to the sides $AO, OC$ is the same, we have $$\frac{[DOA]}{[DOC]}=\frac{AO}{CO}.$$
Therefore, $$[DOA]\cdot [BOC] = [DOC] \cdot [AOB].$$
Since $[AOD]=[BOC]$ and three of the areas are $1,2,4$ it follows that $$[AOD]=[BOC] =2$$ that is, the fourth triangle has an area of $2$ square units.
Week 2
This week we look at a problem involving colourings of the positive integers.
Each positive integer is colored either red or green, so that the following three conditions hold:
Find all possible such colorings.
Problem 2 of the Bundeswettbewerb Mathematik 2007, which appeared in Crux Mathematicorum [2010:22]. We present the solution by Titu Zvonaru which appeared at [2011:31].
Let $R$ be the set of all red numbers and $G$ the set of all green numbers.
First let us prove by induction that if $a \in R$ and $n$ is a nonnegative integer, then $(2n+1) \cdot a \in R$. Indeed, the initial step $P(0): (2 \cdot 0+1)\cdot a \in R$ is by assumption, and the inductive step is immediate: $$(2(n+1)+1)\cdot a =((2n+1)\cdot a)+a+a$$ is the sum of three elements in $R$ and therefore, belongs to $R$.
Same way, we can prove by induction that if $b \in G$ and $n$ is a nonnegative integer, then $(2n+1)\cdot b \in G$.
We know by (iii) that there exists some numbers $a \in R, b\in G$. Therefore, by the above, $R$ and $G$ are infinite.
We know that $1 \in R$ or $1 \in G$. It is enough to study the case $1 \in R$, as the other case follows by flipping the colours.
So, for the rest of the proof we will assume that $1 \in R$. We show that $R$ is the set of all positive odd integers, and hence, it will follow that $G$ is the set of all positive even integers.
Indeed, since $1 \in R$, by the above $(2k+1)\cdot 1 \in R$ and hence $R$ contains all the odd positive integers.
Assume next by contradiction that $R$ contains an even integer $2m$. Then, for all $n >m$ we have $$2n=2m+(2(nm1)+1)+1 \in R.$$
Therefore, $R$ contains all odd integers, and all even integers larger than $2m$. But this contradicts the fact that $G$ is infinite.
Since we got a contradiction, our assumption that $R$ contains an even integer is wrong.
It follows that $R$ consists of all positive odd integers, and $G$ consists of all positive even integers.
Answer: There are exactly two such colorings:
Week 1
We give two entry level problems this week. Give them a try. Look for the source and the solution next week!
Problem A
Find the sum of all positive integers $n$, such that $2009+n^2$ is the square of a positive integer.
Problem B
The diagram shows three squares. Find the measure of the angle $\alpha +\beta$.
Problem A
Problem 8 of the Niels Henrik Abel Mathematical Contest 2008 2009, which appeared in the Skoliad Corner of Crux Mathematicorum [2009:481483]. We present the solution by Lena Choi that appeared at [2010: 358].
If $$n^2+2009=x^2$$ then $$x^2n^2=(xn)(x+n)=2009.$$
Since $2009=41 \cdot 7^2$, $2009$ can be written as a product of two positive integers in only three ways:
$2009=1$ · $2009$ 
$2009=7$ · $287$ 
$2009=41$ · $49.$ 
Since $x,n$ are both positive, $x+n >xn$. Therefore we have the solutions
$x+n = 2009$  $xn= 1$  ⇒ $n=1004$ 
$x+n = 287$  $xn= 7$  ⇒ $n=140$ 
$x+n = 49$  $xn= 41$  ⇒ $n=4$. 
Therefore, their sum is $$1004+140+4=1148.$$
Problem B
Problem 5 of the 2005 BC Colleges High School Mathematics High School Contest, Junior Final Round B, which appeared in the Skoliad Corner of Crux Mathematicorum [2004:385387]. We present the solution by Alex Wise, and a slight modification of the official solution that appeared at [2005: 135].
First Solution
We have $\tan(\alpha)=\frac{1}{3}$ and $\tan(\beta)=\frac{1}{2}$. Therefore $$\tan(\alpha+\beta)= \frac{\tan(\alpha)+\tan(\beta)}{1\tan(\alpha)\tan(\beta)}=\frac{\frac{1}{3}+\frac{1}{2}}{1\frac{1}{6}}=1.$$
Since $\alpha, \beta$ are acute, we have $0 < \alpha +\beta <180^\circ$ and hence $\alpha+\beta=45^\circ$.
Second SolutionIf we flip the squares as shown in the diagram above, we have $\Delta OA'A \equiv \Delta AB'B$, and hence
$OA$  $=$  $AB$ 
$\angle OAA'+ \angle BAB'$  $=$  $\angle OAA'+\angle AOA'=90^\circ.$ 
Therefore, $\Delta OAA'$ is an isosceles right triangle and hence $$\alpha+\beta =45^\circ.$$
To report errors or omissions for this page, please contact us at comc@cms.math.ca.