
The 2019 Canadian Open Mathematics Challenge — Nov 7/8
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: 2018, 2017, 2016, 2015, 2014, or 2013!
Week 2
How many subsets with three elements can be formed from the set $\{ 1 , 2 , 3, \dots , 20 \}$ such that $4$ is a factor of the product of the three numbers in the subset?
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
Let $x$ be an integer of the form
$$
x=\underbrace{111\dots11}_{n \mbox{ times }}
$$
Show that, if $x$ is prime then $n$ is prime.
Problem B
Given a rectangle with sides $a$ and $b$, with $a>b$, fold it along the diagonal. Determine the area of the overlapping triangle (the shaded area in the picture).
Problem A
Problem 7 of the Chilean Mathematical Olympiads 199495, which appeared in Crux Mathematicorum [2001: 170]. We present the solution by Christopher J. Bradley that appeared at [2003: 294].
Since, we got a contradiction, our assumption that $n$ is composite is wrong.
Therefore, $n$ is not composite and $n\neq 1$ (since $x=1$ is not prime), which proves that $n$ is prime. ∎
Problem B
Problem 1 of the XV Gara Nazionale di Matematica 1999, which appeared in Crux Mathematicorum [2002: 481] . We present the solution by Bob Serkey that appeared at [2005: 37].
Let $E$ be the intersection of $BC$ and $AD$, and let $x=BE$.
Note that the right triangles $\Delta AEB$ and $\Delta CED$ have $CD=AB$ and $\angle AEB = \angle CED$, and thus are congruent. Therefore, we have $$ DE=BE=x \,. $$ We therefore also have $$ AE=CE=ax \,. $$ By Pythagoras theorem we have $$ (ax)^2+b^2=x^2 \, \Rightarrow \, x=\frac{a^2+b^2}{2a} \,. $$ In the triangle $\Delta BED$, $DC=b$ is the altitude to the base $BE=x$. Therefore $$ \mbox{Area} (BED)=\frac{bx}{2}= \frac{b}{4a} \left(a^2+b^2 \right) \,. $$
∎
To report errors or omissions for this page, please contact us at comc@cms.math.ca.