Let $AB=AC$ in $\triangle ABC$, and let $D$ be a point on segment $AB$. The tangent at $D$ to the circumcircle $\omega$ of $BCD$ hits $AC$ at $E$. The other tangent from $E$ to $\omega$ touches it at $F$, and $G=BF \cap CD$, $H=AG \cap BC$. Prove that $BH=2HC$. [i]Proposed by David Stoner[/i]

The midpoint $M$ of $[AC]$ of a triangle $\triangle ABC$ is between $C$ and the feet $H$ of the altitude from $B$. If $m(\widehat{ABH}) = m(\widehat{MBC})$, $m(\widehat{ACB}) = 15^{\circ}$, and $|HM|=2\sqrt{3}$, then $|AC|=?$ $ \textbf{(A)}\ 6 \qquad \textbf{(B)}\ 5 \sqrt 2 \qquad \textbf{(C)}\ 8 \qquad \textbf{(D)}\ \frac{16}{\sqrt3} \qquad \textbf{(E)}\ 10$

Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function defined as the maximum of a finite number of functions $g:\mathbb{R}\rightarrow\mathbb{R}$ of the form $g(x)=C\cdot10^{-|x-d|}$ (with different values of parameters $d{}$ and $C>0$). For real numbers $a<b$ we have $f(a)=f(b)$. Prove that on the segment $[a;b]$ the sum of legnths of segments on which $f$ is increasing is equal to the sum of legnths of segments on which $f$ is decreasing.

There are $10^{2015}$ planets in an Intergalactic empire. Every two planets are connected by a two-way space line served by one of $2015$ travel companies. The Emperor would like to close $k$ of these companies such that it is still possible to reach any planet from any other planet. Find the maximum value of $k$ for which this is always possible. (D. Karpov)

Let $a_1, \ldots, a_n$ be $n$ positive numbers and $0 < q < 1.$ Determine $n$ positive numbers $b_1, \ldots, b_n$ so that: [i]a.)[/i] $ a_{k} < b_{k}$ for all $k = 1, \ldots, n,$ [i]b.)[/i] $q < \frac{b_{k+1}}{b_{k}} < \frac{1}{q}$ for all $k = 1, \ldots, n-1,$ [i]c.)[/i] $\sum \limits^n_{k=1} b_k < \frac{1+q}{1-q} \cdot \sum \limits^n_{k=1} a_k.$

Let $ABC$ be a triangle such that length of internal angle bisector from $B$ is equal to $s$. Also, length of external angle bisector from $B$ is equal to $s_1$. Find area of triangle $ABC$ if $\frac{AB}{BC} = k$

Determine whether there exist an infinite number of positive integers $x,y $ satisfying the condition: $x^2+y \mid x+y^2.$ Please prove it.

Let $ABC$ be a triangle with incircle $\gamma$. The circle through $A$ and $B$ tangent to $\gamma$ touches it at $C_2$ and the common tangent at $C_2$ intersects $AB$ at $C_1$. Define the points $A_1$, $B_1$, $A_2$, $B_2$ analogously. Prove that: a) the points $A_1$, $B_1$, $C_1$ are collinear; b) the lines $AA_2$, $BB_2$, $CC_2$ are concurrent.

Let $ a_1\equal{}2, a_2\equal{}5$ and $ a_{n\plus{}2}\equal{}(2\minus{}n^2)a_{n\plus{}1}\plus{} (2\plus{}n^2)a_n$ for $ n\geq 1$. Do there exist $ p,q,r$ so that $ a_pa_q \equal{}a_r$?

One of the sides of a triangle is divided into segments of $ 6$ and $ 8$ units by the point of tangency of the inscribed circle. If the radius of the circle is $ 4$, then the length of the shortest side of the triangle is: $ \textbf{(A)}\ 12\text{ units} \qquad\textbf{(B)}\ 13\text{ units} \qquad\textbf{(C)}\ 14\text{ units} \qquad\textbf{(D)}\ 15\text{ units} \qquad\textbf{(E)}\ 16\text{ units}$

Let $a_0$, $a_1$, $a_2$, ... be an infinite sequence of real numbers satisfying the equation $a_n=\left|a_{n+1}-a_{n+2}\right|$ for all $n\geq 0$, where $a_0$ and $a_1$ are two different positive reals. Can this sequence $a_0$, $a_1$, $a_2$, ... be bounded? [i]Proposed by Mihai Bălună, Romania[/i]

The number of points equidistant from a circle and two parallel tangents to the circle is: $\textbf{(A) }0\qquad \textbf{(B) }2\qquad \textbf{(C) }3\qquad \textbf{(D) }4\qquad \textbf{(E) }\text{infinite}$

Convex pentagon $ABCDE$ has side lengths $AB=5$, $BC=CD=DE=6$, and $EA=7$. Moreover, the pentagon has an inscribed circle (a circle tangent to each side of the pentagon). Find the area of $ABCDE$.

Determine all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that for all $x,y \in \mathbb{R}$ we have: $$xf(x+y)+yf(y-x) = f(x^2+y^2)\,.$$ [i]Authored by Nikola Velov[/i]

Prove that $\sqrt[n]{\sum_{i=1}^{n}{\frac{i}{n+1}}}\ge 1$ for $2 \le n \in \mathbb{N}$.

An eccentric mathematician has a ladder with $ n$ rungs that he always ascends and descends in the following way: When he ascends, each step he takes covers $ a$ rungs of the ladder, and when he descends, each step he takes covers $ b$ rungs of the ladder, where $ a$ and $ b$ are fixed positive integers. By a sequence of ascending and descending steps he can climb from ground level to the top rung of the ladder and come back down to ground level again. Find, with proof, the minimum value of $ n,$ expressed in terms of $ a$ and $ b.$

What is the smallest number of nodes that can be marked in a rectangular $n \times k$ grid so that each cell contains at least two marked nodes?

Archit and Ayush are walking around on the set of points $(x,y)$ for all integers $-1\leq x,y\leq1$. Archit starts at $(1,1)$ and Ayush starts at $(1,0)$. Each second, they move to another point in the set chosen uniformly at random among the points with distance $1$ away from them. If the probability that Archit goes to the point $(0,0)$ strictly before Ayush does can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m,n$, compute $m+n$. [i]2020 CCA Math Bonanza Lightning Round #3.2[/i]

Suppose that $n$ is a natural number and $n$ is not divisible by $3$. Prove that $(n^{2n}+n^n+n+1)^{2n}+(n^{2n}+n^n+n+1)^n+1$ has at least $2d(n)$ distinct prime factors where $d(n)$ is the number of positive divisors of $n$. [i]proposed by Mahyar Sefidgaran[/i]

Find all polynomials $P$ with integer coefficients such that all the roots of $P^n(x)$ are integers. (here $P^n(x)$ means $P(P(...(P(x))...))$ where $P$ is repeated $n$ times)

Determine all positive integers $n$ such that $n$ equals the square of the sum of the digits of $n$.

An arithmetic function is a real-valued function whose domain is the set of positive integers. Define the convolution product of two arithmetic functions $ f$ and $ g$ to be the arithmetic function $ f * g$, where \[ (f * g)(n) \equal{} \sum_{ij\equal{}n} f(i) \cdot g(j),\] and $ f^{*k} \equal{} f * f * \ldots * f$ ($ k$ times) We say that two arithmetic functions $ f$ and $ g$ are dependent if there exists a nontrivial polynomial of two variables $ P(x, y) \equal{} \sum_{i,j} a_{ij} x^i y^j$ with real coefficients such that \[ P(f,g) \equal{} \sum_{i,j} a_{ij} f^{*i} * g^{*j} \equal{} 0,\] and say that they are independent if they are not dependent. Let $ p$ and $ q$ be two distinct primes and set \[ f_1(n) \equal{} \begin{cases} 1 & \text{ if } n \equal{} p, \\ 0 & \text{ otherwise}. \end{cases}\] \[ f_2(n) \equal{} \begin{cases} 1 & \text{ if } n \equal{} q, \\ 0 & \text{ otherwise}. \end{cases}\] Prove that $ f_1$ and $ f_2$ are independent.

Let scalene triangle $ABC$ have orthocentre $H$ and circumcircle $\Gamma$. $AH$ meets $\Gamma$ at $D$ distinct from $A$. $BH$ and $CH$ meet $CA$ and $AB$ at $E$ and $F$ respectively, and $EF$ meets $BC$ at $P$. The tangents to $\Gamma$ at $B$ and $C$ meet at $T$. Show that $AP$ and $DT$ are concurrent on the circumcircle of $AFE$.

Let $n \geq 3$ be an integer. Let $f$ be a function from the set of all integers to itself with the following property: If the integers $a_1,a_2,\ldots,a_n$ form an arithmetic progression, then the numbers $$f(a_1),f(a_2),\ldots,f(a_n)$$ form an arithmetic progression (possibly constant) in some order. Find all values for $n$ such that the only functions $f$ with this property are the functions of the form $f(x)=cx+d$, where $c$ and $d$ are integers.

Prove that for every positive integer $n$, there exist integers $a$ and $b$ such that $4a^2 + 9b^2 - 1$ is divisible by $n$.