Source: 2018 Canadian Open Math Challenge Part A Problem 1 Suppose $x$ is a real number such that $x(x+3)=154.$ Determine the value of $(x+1)(x+2)$.

Source: 2018 Canadian Open Math Challenge Part A Problem 2 Let $v$, $w$, $x$, $y$, and $z$ be five distinct integers such that $45 = v\times w\times x\times y\times z.$ What is the sum of the integers?

Source: 2018 Canadian Open Math Challenge Part A Problem 3 Points $(0,0)$ and $(3\sqrt7,7\sqrt3)$ are the endpoints of a diameter of circle $\Gamma.$ Determine the other $x$ intercept of $\Gamma.$

Source: 2018 Canadian Open Math Challenge Part A Problem 4 In the sequence of positive integers, starting with $2018, 121, 16, ...$ each term is the square of the sum of digits of the previous term. What is the $2018^{\text{th}}$ term of the sequence?

Source: 2018 Canadian Open Math Challenge Part B Problem 1 Let $(1+\sqrt2)^5 = a+b\sqrt2$, where $a$ and $b$ are positive integers. Determine the value of $a+b.$

Source: 2018 Canadian Open Math Challenge Part B Problem 2 Let ABCD be a square with side length 1. Points $X$ and $Y$ are on sides $BC$ and $CD$ respectively such that the areas of triangels $ABX$, $XCY$, and $YDA$ are equal. Find the ratio of the area of $\triangle AXY$ to the area of $\triangle XCY$.

Source: 2018 Canadian Open Math Challenge Part B Problem 3 The doubling sum function is defined by \[D(a,n)=\overbrace{a+2a+4a+8a+...}^{\text{n terms}}.\]For example, we have \[D(5,3)=5+10+20=35\]and \[D(11,5)=11+22+44+88+176=341.\]Determine the smallest positive integer $n$ such that for every integer $i$ between $1$ and $6$, inclusive, there exists a positive integer $a_i$ such that $D(a_i,i)=n.$

Source: 2018 Canadian Open Math Challenge Part B Problem 4 Determine the number of $5$-tuples of integers $(x_1,x_2,x_3,x_4,x_5)$ such that $\text{(a)}$ $x_i\ge i$ for $1\le i \le 5$; $\text{(b)}$ $\sum_{i=1}^5 x_i = 25$.

Source: 2018 Canadian Open Math Challenge Part C Problem 1 At Math-$e^e$-Mart, cans of cat food are arranged in an pentagonal pyramid of 15 layers high, with 1 can in the top layer, 5 cans in the second layer, 12 cans in the third layer, 22 cans in the fourth layer etc, so that the $k^{\text{th}}$ layer is a pentagon with $k$ cans on each side. $\text{(a)}$ How many cans are on the bottom, $15^{\text{th}}$, (A.)layer of this pyramid? $\text{(b)}$ The pentagonal pyramid is rearranged into a prism consisting of 15 identical layers. (B.)How many cans are on the bottom layer of the prism? $\text{(c)}$ A triangular prism consist of indentical layers, each of which has a shape of a triangle. (C.)(the number of cans in a triangular layer is one of the triangular numbers: 1,3,6,10,...) (C.)For example, a prism could be composed of the following layers: Prove that a pentagonal pyramid of cans with any number of layers $l\ge 2$ can be rearranged (without a deficit or leftover) into a triangluar prism of cans with the same number of layers $l$.

Source: 2018 Canadian Open Math Challenge Part C Problem 2 Alice has two boxes $A$ and $B$. Initially box $a$ contains $n$ coins and box $B$ is empty. On each turn, she may either move a coin from box $a$ to box $B$, or remove $k$ coins from box $A$, where $k$ is the current number of coins in box $B$. She wins when box $A$ is empty. $\text{(a)}$ If initially box $A$ contains 6 coins, show that Alice can win in 4 turns. $\text{(b)}$ If initially box $A$ contains 31 coins, show that Alice cannot win in 10 turns. $\text{(c)}$ What is the minimum number of turns needed for Alice to win if box $A$ initially contains 2018 coins?

Source: 2018 Canadian Open Math Challenge Part C Problem 3 Consider a convex quadrilateral $ABCD$. Let rays $BA$ and $CD$ intersect at $E$, rays $DA$ and $CB$ intersect at $F$, and the diagonals $AC$ and $BD$ intersect at $G$. It is given that the triangles $DBF$ and $DBE$ have the same area. $\text{(a)}$ Prove that $EF$ and $BD$ are parallel. $\text{(b)}$ Prove that $G$ is the midpoint of $BD$. $\text{(c)}$ Given that the area of triangle $ABD$ is 4 and the area of triangle $CBD$ is 6, (C.)compute the area of triangle $EFG$.

Source: 2018 Canadian Open Math Challenge Part C Problem 4 Given a positive integer $N$, Matt writes $N$ in decimal on a blackboard, without writing any of the leading 0s. Every minute he takes two consicutive digits, erases them, and replaces them with the last digit of their product. Any leading zeroes created this way are also erased. He repeats this process for as long as he likes. We call the positive integer $M$ obtainable from $N$ if starting from $N$, there is a finite sequence of moves that Matt can make to produce the number $M$. For example, 10 is obtainible from 251023 via \[2510\underline{23}\rightarrow\underline{25} 106\rightarrow 1\underline{06}\rightarrow 10\]$\text{(a)}$ Show that 2018 is obtainablefrom 2567777899. $\text{(b)}$ Find two positive integers $A$ and $B$ for which there is no positive integer $C$ (B.) such that both $A$ and $B$ are obtainablefrom $C$ $\text{(c)}$ Let $S$ be any finite set of positive integers, none of which contains the digit 5 (C.) in its decimal representation. Prove that there exists a positive integer $N$ (C.) for which all elements of $S$ are obtainable from $N$.