Let $ABC$ be a triangle with $\angle B=90$. The incircle of $ABC$ touches the side $BC$ at $D$. The incenters of triangles $ABD$ and $ADC$ are $X$ and $Z$ , respectively. The lines $XZ$ and $AD$ are intersecting at the point $K$. $XZ$ and circumcircle of $ABC$ are intersecting at $U$ and $V$. Let $M$ be the midpoint of line segment $[UV]$ . $AD$ intersects the circumcircle of $ABC$ at $Y$ other than $A$. Prove that $|CY|=2|MK|$ .

A polygon $A$ that doesn't intersect itself and has perimeter $p$ is called [b]Rotund[/b] if for each two points $x,y$ on the sides of this polygon which their distance on the plane is less than $1$ their distance on the polygon is at most $\frac{p}{4}$. (Distance on the polygon is the length of smaller path between two points on the polygon) Now we shall prove that we can fit a circle with radius $\frac{1}{4}$ in any rotund polygon. The mathematicians of two planets earth and Tarator have two different approaches to prove the statement. In both approaches by "inner chord" we mean a segment with both endpoints on the polygon, and "diagonal" is an inner chord with vertices of the polygon as the endpoints. [b]Earth approach: Maximal Chord[/b] We know the fact that for every polygon, there exists an inner chord $xy$ with a length of at most 1 such that for any inner chord $x'y'$ with length of at most 1 the distance on the polygon of $x,y$ is more than the distance on the polygon of $x',y'$. This chord is called the [b]maximal chord[/b]. On the rotund polygon $A_0$ there's two different situations for maximal chord: (a) Prove that if the length of the maximal chord is exactly $1$, then a semicircle with diameter maximal chord fits completely inside $A_0$, so we can fit a circle with radius $\frac{1}{4}$ in $A_0$. (b) Prove that if the length of the maximal chord is less than one we still can fit a circle with radius $\frac{1}{4}$ in $A_0$. [b]Tarator approach: Triangulation[/b] Statement 1: For any polygon that the length of all sides is less than one and no circle with radius $\frac{1}{4}$ fits completely inside it, there exists a triangulation of it using diagonals such that no diagonal with length more than $1$ appears in the triangulation. Statement 2: For any polygon that no circle with radius $\frac{1}{4}$ fits completely inside it, can be divided into triangles that their sides are inner chords with length of at most 1. The mathematicians of planet Tarator proved that if the second statement is true, for each rotund polygon there exists a circle with radius $\frac{1}{4}$ that fits completely inside it. (c) Prove that if the second statement is true, then for each rotund polygon there exists a circle with radius $\frac{1}{4}$ that fits completely inside it. They found out that if the first statement is true then the second statement is also true, so they put a bounty of a doogh on proving the first statement. A young earth mathematician named J.N., found a counterexample for statement 1, thus receiving the bounty. (d) Find a 1392-gon that is counterexample for statement 1. But the Tarators are not disappointed and they are still trying to prove the second statement. (e) (Extra points) Prove or disprove the second statement. Time allowed for this problem was 150 minutes.

Minivan chooses a prime number. Then every second, he adds either the digit $1$ or the digit $3$ to the right end of his number (after the unit digit), such that the new number is also a prime. Can he continue indefinitely? [i](Proposed by Wong Jer Ren)[/i]

$u$ is a real parameter such that $0<u<1$. For $0\le x \le u$, $f(x)=0$. For $u\le x \le n$, $f(x)=1-\left(\sqrt{ux}+\sqrt{(1-u)(1-x)}\right)^2$. The sequence $\{u_n\}$ is define recursively as follows: $u_1=f(1)$ and $u_n=f(u_{n-1})$ $\forall n\in \mathbb{N}, n\neq 1$. Show that there exists a positive integer $k$ for which $u_k=0$.

For any positive integer $n$, define a function $f$ by \[f(n)=2n+1-2^{\lfloor\log_2n\rfloor+1}.\] Let $f^m$ denote the function $f$ applied $m$ times.. Determine the number of integers $n$ between $1$ and $65535$ inclusive such that $f^n(n)=f^{2015}(2015).$ [i]Proposed by Yannick Yao[/i]

Among $33$ balls, there are $2$ radioactive ones. You can put several balls in the detector and it will show if the both radioactive balls are among the balls. What is the smallest number that we have to use the detector so that one can certainly find at least one of the radioactive balls?

On a rectangular piece of paper there are (a) several marked points all on one straight line, (b) three marked points (not necessarily on a straight line). We are allowed to fold the paper several times along a straight line not containing marked points and then puncture the folded paper with a needle. Show that this can be done so that after the paper has been unfolded all the marked points are punctured and there are no extra holes. (A Shapovalov)

Write down all real numbers $(x, y)$ satisfying two conditions: $x^{2018} + y^2 = 2$, and $x^2 + y^{2018} = 2$.

In the triangle $ ABC$ let $ D$ and $ E$ be the boundary points of the incircle with the sides $ BC$ and $ AC$. Show that if $ AD\equal{}BE$ holds, then the triangle is isoceles.

Kevin the Koala eats $1$ leaf on the first day of its life, $3$ leaves on the second, $5$ on the third, and in general eats $2n-1$ leaves on the $n$th day. What is the smallest positive integer $n>1$ such that the total number of leaves Kevin has eaten his entire $n$-day life is a perfect sixth power? [i]2015 CCA Math Bonanza Individual Round #4[/i]

Triangle $\triangle ABC$ has circumcenter $O$ and incircle $\gamma$. Suppose that $\angle BAC =60^\circ$ and $O$ lies on $\gamma$. If \[ \tan B \tan C = a + \sqrt{b} \] for positive integers $a$ and $b$, compute $100a+b$. [i]Proposed by Kaan Dokmeci[/i]

Find all functions $f:R \to R$, such that $f(x)+f(y)=f(x+y)$, and there exists non-constant polynomials $P(x)$, $Q(x)$ such that $P(x)f(Q(x))=f(P(x)Q(x))$

Let $f(x)$ be a polynomial with real coefficients of degree 2. Suppose that for some pairwise distinct real numbers , $a,b,c$ we have:\\ \[f(a)=bc , f(b)=ac, f(c)=ab\] Dertermine $f(a+b+c)$ in terms of $a,b,c$.

Consider a regular $n$-gon with $n$ odd. Given two adjacent vertices $A_{1}$ and $A_{2},$ define the sequence $(A_{k})$ of vertices of the $n$-gon as follows: For $k\ge 3,\, A_{k}$ is the vertex lying on the perpendicular bisector of $A_{k-2}A_{k-1}.$ Find all $n$ for which each vertex of the $n$-gon occurs in this sequence.

Let $a, b, c$ be positive real numbers such that $a\le b \le c \le 2a$. Find the maximum possible value of $$\frac{b}{a} +\frac{c}{b} +\frac{a}{c}.$$

Five distinct numbers are drawn successively and at random from the set $\{1, \cdots , n\}$. Show that the probability of a draw in which the first three numbers as well as all five numbers can be arranged to form an arithmetic progression is greater than $\frac{6}{(n-2)^3}$

Prove that it is possible to find $2^{n+1}$ of $2^n$ digit numbers containing only "$1$" and "$2$" as digits, such that every two of them distinguish at least in $2^{n-1}$ digits.

Let $p$ be a real constant. The parabola $y^2=-4px$ rolls without slipping around the parabola $y^2=4px$. Find the equation of the locus of the vertex of the rolling parabola.

Do there exist positive integers $a$ and $b$ such that $a^n+n^b$ and $b^n+n^a$ are relatively prime for all natural $n$?

Richard starts with the string $HHMMMMTT$. A move consists of replacing an instance of $HM$ with $MH$, replacing an instance of $MT$ with $TM$, or replacing an instance of $TH$ with $HT$. Compute the number of possible strings he can end up with after performing zero or more moves.

Let $x_1, x_2, x_3, x_4$ be the distances from an arbitrary point inside the tetrahedron to the planes of its faces, and let $h_1, h_2, h_3, h_4$ be the corresponding heights of the tetrahedron. Prove that $$\sqrt{h_1+h_2+h_3+h_4} \ge \sqrt{x_1}+\sqrt{x_2}+\sqrt{x_3}+\sqrt{x_4}$$ (Dmitry Nomirovsky)

Let $ X$ be a set of $ k$ vertexes on a plane such that no three of them are collinear. Let $ P$ be the family of all $ {k \choose 2}$ segments that connect each pair of points. Determine $ \tau(P)$.

Let $ ABC$ be an equilateral triangle with side length equal to $ N \in \mathbb{N}.$ Consider the set $ S$ of all points $ M$ inside the triangle $ ABC$ satisfying \[ \overrightarrow{AM} \equal{} \frac{1}{N} \cdot \left(n \cdot \overrightarrow{AB} \plus{} m \cdot \overrightarrow{AC} \right)\] with $ m, n$ integers, $ 0 \leq n \leq N,$ $ 0 \leq m \leq N$ and $ n \plus{} m \leq N.$ Every point of S is colored in one of the three colors blue, white, red such that [b](i) [/b]no point of $ S \cap [AB]$ is coloured blue [b](ii)[/b] no point of $ S \cap [AC]$ is coloured white [b](iii)[/b] no point of $ S \cap [BC]$ is coloured red Prove that there exists an equilateral triangle the following properties: [b](1)[/b] the three vertices of the triangle are points of $ S$ and coloured blue, white and red, respectively. [b](2)[/b] the length of the sides of the triangle is equal to 1. [i]Variant:[/i] Same problem but with a regular tetrahedron and four different colors used.

Let $a,b,c$ are non-negative numbers such that $$2(a^2+b^2+c^2)+3(ab+bc+ca)=5(a+b+c)$$ then prove that $4(a^2+b^2+c^2)+2(ab+bc+ca)+7abc\le 25$

16 students took part in a competition. All problems were multiple choice style. Each problem had four choices. It was said that any two students had at most one answer in common, find the maximum number of problems.