For positive numbers $x$, $y$, and $z$, we know that $x + y^2 + z^3 = 1$. Prove that $$\frac{x}{2 + xy} + \frac{y}{2 + yz} + \frac{z}{2 + zx} > \frac{1}{2} .$$

Prove that there are at most three primes between $10$ and $10^{10}$ all of whose decimal digits are $1$.

Let $n$ be a positive integer such that $2+2\sqrt{28n^2 +1}$ is an integer. Show that $2+2\sqrt{28n^2 +1}$ is the square of an integer.

Consider $A\in \mathcal{M}_{2020}(\mathbb{C})$ such that $$ (1)\begin{cases} A+A^{\times} =I_{2020},\\ A\cdot A^{\times} =I_{2020},\\ \end{cases} $$ where $A^{\times}$ is the adjugate matrix of $A$, i.e., the matrix whose elements are $a_{ij}=(-1)^{i+j}d_{ji}$, where $d_{ji}$ is the determinant obtained from $A$, eliminating the line $j$ and the column $i$. Find the maximum number of matrices verifying $(1)$ such that any two of them are not similar.

Let $\alpha, \beta$ and $\gamma$ denote the angles of the triangle $ABC$. The perpendicular bisector of $AB$ intersects $BC$ at the point $X$, the perpendicular bisector of $AC$ intersects it at $Y$. Prove that $\tan(\beta) \cdot \tan(\gamma) = 3$ implies $BC= XY$ (or in other words: Prove that a sufficient condition for $BC = XY$ is $\tan(\beta) \cdot \tan(\gamma) = 3$). Show that this condition is not necessary, and give a necessary and sufficient condition for $BC = XY$.

Compute the number of permutations of $\{1,2,3\}$ with the property that there is some number that can be removed such that the remaining numbers are in increasing order. For example, $(2,1,3)$ has this property because removing $1$ leaves $(2,3)$, which is in increasing order. [i]2020 CCA Math Bonanza Team Round #1[/i]

Let $c$ be a positive real number. Prove that $c$ can be expressed in infinitely many ways as a sum of infinitely many distinct terms selected from the sequence $\left( \frac{1}{10n} \right)_{n\in \mathbb{N}}$

Find the number of even integers n such that $0 \le n \le 100$ and $5 | n^2 \cdot 2^{{2n}^2}+ 1$.

A rectangle $ABCD$ is given whose sides have lengths $3$ and $2n$, where $n$ is a natural number. Denote by $U(n)$ the number of ways in which one can cut the rectangle into rectangles of side lengths $1$ and $2$. $(a)$ Prove that \[U(n + 1)+U(n -1) = 4U(n);\] $(b)$ Prove that \[U(n) =\frac{1}{2\sqrt{3}}[(\sqrt{3} + 1)(2 +\sqrt{3})^n + (\sqrt{3} - 1)(2 -\sqrt{3})^n].\]

Let $n\geq3$ be a given integer, and let $a_1,a_2,\cdots,a_{2n},b_1,b_2,\cdots,b_{2n}$ be $4n$ nonnegative reals, such that $$a_1+a_2+\cdots+a_{2n}=b_1+b_2+\cdots+b_{2n}>0,$$ and for any $i=1,2,\cdots,2n,$ $a_ia_{i+2}\geq b_i+b_{i+1},$ where $a_{2n+1}=a_1,$ $a_{2n+2}=a_2,$ $b_{2n+1}=b_1.$ Detemine the minimum of $a_1+a_2+\cdots+a_{2n}.$

The number $16^4+16^2+1$ is divisible by four distinct prime numbers. Compute the sum of these four primes. [i]2018 CCA Math Bonanza Lightning Round #3.1[/i]

The odd positive integers $1,3,5,7,\cdots,$ are arranged into in five columns continuing with the pattern shown on the right. Counting from the left, the column in which $ 1985$ appears in is the [asy] int i,j; for(i=0; i<4; i=i+1) { label(string(16*i+1), (2*1,-2*i)); label(string(16*i+3), (2*2,-2*i)); label(string(16*i+5), (2*3,-2*i)); label(string(16*i+7), (2*4,-2*i)); } for(i=0; i<3; i=i+1) { for(j=0; j<4; j=j+1) { label(string(16*i+15-2*j), (2*j,-2*i-1)); }} dot((0,-7)^^(0,-9)^^(2*4,-8)^^(2*4,-10)); for(i=-10; i<-6; i=i+1) { for(j=1; j<4; j=j+1) { dot((2*j,i)); }} [/asy] $ \textbf{(A)} \text{ first} \qquad \textbf{(B)} \text{ second} \qquad \textbf{(C)} \text{ third} \qquad \textbf{(D)} \text{ fourth} \qquad \textbf{(E)} \text{ fifth}$

The figure below is cut along the lines into polygons (which need not be convex). No polygon contains a $2 \times 2$ square. What is the smallest possible number of polygons? [missing figure]

Let $ABC$ be a triangle with circumradius $R$, and let $\ell_A, \ell_B, \ell_C$ be the altitudes through $A, B, C$ respectively. The altitudes meet at $H$. Let $P$ be an arbitrary point in the same plane as $ABC$. The feet of the perpendicular lines through $P$ onto $\ell_A, \ell_B, \ell_C$ are $D, E, F$ respectively. Prove that the areas of $DEF$ and $ABC$ satisfy the following equation: $$ \operatorname{area}(DEF) = \frac{{PH}^2}{4R^2} \cdot \operatorname{area}(ABC). $$

We attempt to cover the plane with an infinite sequence of rectangles, overlapping allowed. (a) Is the task always possible if the area of the $n$th rectangle is $n^2$ for each $n$? (b) Is the task always possible if each rectangle is a square, and for any number $N$, there exist squares with total area greater than $N$?

Let $a$ be a real number greater than $1$ such that $\frac{20a}{a^2+1} = \sqrt{2}$. Find $\frac{14a}{a^2 - 1}$.