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?

Faces of a convex polyhedron are six squares and 8 equilateral triangles and each edge is a common side for one triangle and one square. All dihedral angles obtained from the triangle and square with a common edge, are equal. Prove that it is possible to circumscribe a sphere around the polyhedron, and compute the ratio of the squares of volumes of that polyhedron and of the ball whose boundary is the circumscribed sphere.

A quadrilateral is cut from a piece of gift wrapping paper, which has equally wide white and gray stripes. The grey stripes in the quadrilateral have a combined area of $10$. Determine the area of the quadrilateral. [img]https://1.bp.blogspot.com/-ia13b4RsNs0/XzP0cepAcEI/AAAAAAAAMT8/0UuCogTRyj4yMJPhfSK3OQihRqfUT7uSgCLcBGAsYHQ/s0/2020%2Bmohr%2Bp2.png[/img]

Find all numbers $x$ such that: $1+2\cdot2^x+3\cdot3^x<6^x$

We are given a finite collection of segments in the plane, of total length 1. Prove that there exists a line $ l$ such that the sum of the lengths of the projections of the given segments to the line $ l$ is less than $ \frac{2}{\pi}.$

Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ that satisfy $$(f(a)-f(b))(f(b)-f(c))(f(c)-f(a)) = f(ab^2+bc^2+ca^2) - f(a^2b+b^2c+c^2a)$$for all real numbers $a$, $b$, $c$. [i]Proposed by Ankan Bhattacharya, USA[/i]

5. Tom has 13 weight pieces that look equal, however 12 of them weigh the same and the 13th piece is fake and weighs more than the others. He also has two balances: one shows correctly which pan is heavier or that their weights are equal, the other one gives the correct result when the weights on the pans differ, and gives a random result when the weights are equal. (Tom does not know which balance is which). Tom can choose the balance before each weighting. Prove that he can surely determine the fake weight piece in three weighings. Andrey Arzhantsev

Triangle $ABC$ has side lengths $AB=18$, $BC=36$, and $CA=24$. The circle $\Gamma$ passes through point $C$ and is tangent to segment $AB$ at point $A$. Let $X$, distinct from $C$, be the second intersection of $\Gamma$ with $BC$. Moreover, let $Y$ be the point on $\Gamma$ such that segment $AY$ is an angle bisector of $\angle XAC$. Suppose the length of segment $AY$ can be written in the form $AY=\frac{p\sqrt{r}}{q}$ where $p$, $q$, and $r$ are positive integers such that $gcd(p, q)=1$ and $r$ is square free. Find the value of $p+q+r$.

For any positive integer $d$, prove there are infinitely many positive integers $n$ such that $d(n!)-1$ is a composite number.

On a chessboard of $16 \times 16$ squares, a "horse" moves making only movements of two types: from each square you can move either two squares to the right and one up, or two boxes up and one to the right. Determine in how many ways different the horse can move from the lower left square of the board to the top right box.

Find all sequences ${{a}_{1}},{{a}_{2}},...,{{a}_{2000}}$ of real numbers such that $\sum\limits_{n=1}^{2000}{{{a}_{n}}=1999}$ and such that $\frac{1}{2}<{{a}_{n}}<1$ and ${{a}_{n+1}}={{a}_{n}}(2-{{a}_{n}})$ for all $n\ge 1$.

Let $O$ be the center of the circle of the triangle $ABC$ with $AB \ne AC$. Furthermore, let $S$ and $T$ be points on the rays $AB$ and $AC$, such that $\angle ASO = \angle ACO$ and $\angle ATO = \angle ABO$. Show that $ST$ bisects the segment $BC$.

Let $ABC$ be an acute-angled triangle in which no two sides have the same length. The reflections of the centroid $G$ and the circumcentre $O$ of $ABC$ in its sides $BC,CA,AB$ are denoted by $G_1,G_2,G_3$ and $O_1,O_2,O_3$, respectively. Show that the circumcircles of triangles $G_1G_2C$, $G_1G_3B$, $G_2G_3A$, $O_1O_2C$, $O_1O_3B$, $O_2O_3A$ and $ABC$ have a common point. [i]The centroid of a triangle is the intersection point of the three medians. A median is a line connecting a vertex of the triangle to the midpoint of the opposite side.[/i]

Let $M = F_1\times\cdots\times F_k$ be the product of $k$ smooth, closed surfaces (2-dimensional, $C^\infty$, compact, connected, manifold without boundary), $s$ of which are non-orientable. Prove that $M$ can be embedded in $\mathbb{R}^{2k+s+1}$.

Triangle $ABC$ has an obtuse angle at $\angle A$. Points $D$ and $E$ are placed on $\overline{BC}$ in the order $B$, $D$, $E$, $C$ such that $\angle BAD=\angle BCA$ and $\angle CAE=\angle CBA$. If $AB=10$, $AC=11$, and $DE=4$, determine $BC$.

Find the angle $\angle A$ of a triangle $ABC$, when we know it's altitudes $BD$ and $CE$ intersect in an interior point $H$ of the triangle and $BH=2HD$ and $CH=HE$.

Let $r$ be the result of doubling both the base and exponent of $a^b$, $b\neq 0$. If $r$ equals the product of $a^b$ by $x^b$, then $x$ equals: ${{ \textbf{(A)} a\qquad\textbf{(B)}\ 2a \qquad\textbf{(C)}\ 4a \qquad\textbf{(D)}\ 2}\qquad\textbf{(E)}\ 4} $

[u]Round 5[/u] [b]p13.[/b] Initially, the three numbers $20$, $201$, and $2016$ are written on a blackboard. Each minute, Zhuo selects two of the numbers on the board and adds $1$ to each. Find the minimum $n$ for which Zhuo can make all three numbers equal to $n$. [b]p14.[/b] Call a three-letter string rearrangeable if, when the first letter is moved to the end, the resulting string comes later alphabetically than the original string. For example, $AAA$ and $BAA$ are not rearrangeable, while $ABB$ is rearrangeable. How many three-letters strings with (not necessarily distinct) uppercase letters are rearrangeable? [b]p15.[/b] Triangle $ABC$ is an isosceles right triangle with $\angle C = 90^o$ and $AC = 1$. Points $D$, $E$ and $F$ are chosen on sides $BC$,$CA$ and $AB$, respectively, such that $AEF$, $BFD$, $CDE$, and $DEF$ are isosceles right triangles. Find the sum of all distinct possible lengths of segment $DE$. [u]Round 6[/u] [b]p16.[/b] Let $p, q$, and $r$ be prime numbers such that $pqr = 17(p + q + r)$. Find the value of the product $pqr$. [b]p17.[/b] A cylindrical cup containing some water is tilted $45$ degrees from the vertical. The point on the surface of the water closest to the bottom of the cup is $6$ units away. The point on the surface of the water farthest from the bottom of the cup is $10$ units away. Compute the volume of the water in the cup. [b]p18.[/b] Each dot in an equilateral triangular grid with $63$ rows and $2016 = \frac12 \cdot 63 \cdot 64$ dots is colored black or white. Every unit equilateral triangle with three dots has the property that exactly one of its vertices is colored black. Find all possible values of the number of black dots in the grid. [u]Round 7[/u] [b]p19.[/b] Tomasz starts with the number $2$. Each minute, he either adds $2$ to his number, subtracts $2$ from his number, multiplies his number by $2$, or divides his number by $2$. Find the minimum number of minutes he will need in order to make his number equal $2016$. [b]p20.[/b] The edges of a regular octahedron $ABCDEF$ are painted with $3$ distinct colors such that no two edges with the same color lie on the same face. In how many ways can the octahedron be painted? Colorings are considered different under rotation or reflection. [b]p21.[/b] Jacob is trapped inside an equilateral triangle $ABC$ and must visit each edge of triangle $ABC$ at least once. (Visiting an edge means reaching a point on the edge.) His distances to sides $AB$, $BC$, and $CA$ are currently $3$, $4$, and $5$, respectively. If he does not need to return to his starting point, compute the least possible distance that Jacob must travel. [u]Round 8[/u] [b]p22.[/b] Four integers $a, b, c$, and $d$ with a $\le b \le c \le d$ satisfy the property that the product of any two of them is equal to the sum of the other two. Given that the four numbers are not all equal, determine the $4$-tuple $(a, b, c, d)$. [b]p23.[/b] In equilateral triangle $ABC$, points $D$,$E$, and $F$ lie on sides $BC$,$CA$ and $AB$, respectively, such that $BD = 4$ and $CD = 5$. If $DEF$ is an isosceles right triangle with right angle at $D$, compute $EA + FA$. [b]p24.[/b] On each edge of a regular tetrahedron, four points that separate the edge into five equal segments are marked. There are sixteen planes that are parallel to a face of the tetrahedron and pass through exactly three of the marked points. When the tetrahedron is cut along each of these sixteen planes, how many new tetrahedrons are produced? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2934049p26256220]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all functions $f : \mathbb{Z} \to\mathbb{ Z}$ such that \[ n^2+4f(n)=f(f(n))^2 \] for all $n\in \mathbb{Z}$. [i]Proposed by Sahl Khan, UK[/i]

The sum of the first 2011 terms of a geometric series is 200. The sum of the first 4022 terms of the same series is 380. Find the sum of the first 6033 terms of the series.

Crisp All, a basketball player, is [i]dropping dimes[/i] and nickels on a number line. Crisp drops a dime on every positive multiple of $10$, and a nickel on every multiple of $5$ that is not a multiple of $10$. Crisp then starts at $0$. Every second, he has a $\frac{2}{3}$ chance of jumping from his current location $x$ to $x+3$, and a $\frac{1}{3}$ chance of jumping from his current location $x$ to $x+7$. When Crisp jumps on either a dime or a nickel, he stops jumping. What is the probability that Crisp [i]stops on a dime[/i]?

Let $ x_1, x_2, ..., x_5$ be a non-negative real numbers such that $ x_1 \plus{} x_2 \plus{} \cdots \plus{} x_5 \equal{} 100.$ Let $ M$ be a maximum of the numbers $ x_1 \plus{} x_2, x_2 \plus{} x_3, x_3 \plus{} x_4,$ and $ x_4 \plus{} x_5$. The least possible value of $ M$ lies in the interval A. [0,32) B. [32, 34) C. [34, 36) D. [36, 38) E. [38, 40]

Find the last three digits of the sum of all the real values of $m$ such that the ellipse $x^2+xy+y^2=m$ intersects the hyperbola $xy=n$ only at its two vertices, as $n$ ranges over all non-zero integers $-81\le n \le 81$. [i]Proposed by [b]AOPS12142015[/b][/i]

Is there an infinite sequence of positive real numbers $x_1,x_2,...,x_n$ satisfying for all $n\ge 1$ the relation $x_{n+2}= \sqrt{x_{n+1}}-\sqrt{x_n}$?

The National Foundation of Happiness (NFoH) wants to estimate the happiness of people of country. NFoH selected $n$ random persons, and on every morning asked from each of them whether she is happy or not. On any two distinct days, exactly half of the persons gave the same answer. Show that after $k$ days, there were at most $n-\frac{n}{k}$ persons whose “yes” answers equals their “no” answers.