A large gathering of people stand in a triangular array with $2020$ rows, such that the first row has $1$ person, the second row has $2$ people, and so on. Every day, the people in each row infect all of the people adjacent to them in their own row. Additionally, the people at the ends of each row infect the people at the ends of the rows in front of and behind them that are at the same side of the row as they are. Given that two people are chosen at random to be infected with COVID at the beginning of day 1, what is the earliest possible day that the last uninfected person will be infected with COVID? [i]Proposed by Richard Chen[/i]

How many triangles appear in the diagram below? [asy] import graph; size(4.4cm); real labelscalefactor = 0.5; pen dotstyle = black; draw((-2,5)--(-2,1)); draw((-2,5)--(2,5)); draw((2,5)--(2,1)); draw((-2,1)--(2,1)); draw((0,5)--(0,1)); draw((-2,3)--(2,3)); draw((-1,5)--(-1,1)); draw((1,5)--(1,1)); draw((-2,2)--(2,2)); draw((-2,4)--(2,4)); draw((1,5)--(-2,2)); draw((-2,2)--(-1,1)); draw((-1,1)--(2,4)); draw((2,4)--(1,5)); draw((-1,5)--(-2,4)); draw((-2,4)--(1,1)); draw((1,1)--(2,2)); draw((2,2)--(-1,5)); [/asy]

Real numbers $x$ and $y$ satisfy the following equations: \begin{align*} x &= \log_{10} (10^{y-1}+1)-1 \\ y &= \log_{10} (10^x+1)-1. \end{align*} Find $10^{x-y}.$

$ABC$ is an acute triangle with $AB> AC$. $\Gamma_B$ is a circle that passes through $A,B$ and is tangent to $AC$ on $A$. Define similar for $ \Gamma_C$. Let $D$ be the intersection $\Gamma_B$ and $\Gamma_C$ and $M$ be the midpoint of $BC$. $AM$ cuts $\Gamma_C$ at $E$. Let $O$ be the center of the circumscibed circle of the triangle $ABC$. Prove that the circumscibed circle of the triangle $ODE$ is tangent to $\Gamma_B$.

In a row are 23 boxes such that for $1\le k \le 23$, there is a box containing exactly $k$ balls. In one move, we can double the number of balls in any box by taking balls from another box which has more. Is it always possible to end up with exactly $k$ balls in the $k$-th box for $1\le k\le 23$?

Let $ABCD$ be a quadrilateral inscribed in a circle $\Omega.$ Let the tangent to $\Omega$ at $D$ meet rays $BA$ and $BC$ at $E$ and $F,$ respectively. A point $T$ is chosen inside $\triangle ABC$ so that $\overline{TE}\parallel\overline{CD}$ and $\overline{TF}\parallel\overline{AD}.$ Let $K\ne D$ be a point on segment $DF$ satisfying $TD=TK.$ Prove that lines $AC,DT,$ and $BK$ are concurrent.

Given an integer number $n \geq 3$, consider $n$ distinct points on a circle, labelled $1$ through $n$. Determine the maximum number of closed chords $[ij]$, $i \neq j$, having pairwise non-empty intersections. [i]János Pach[/i]

Mary's top book shelf holds five books with the following widths, in centimeters: $ 6$, $ \frac12$, $ 1$, $ 2.5$, and $ 10$. What is the average book width, in centimeters? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Find the largest positive integer $n$ with the following property: there are rectangles $A_1, ... , A_n$ and $B_1,... , B_n,$ on the plane , each with sides parallel to the axis of the coordinate system, such that the rectangles $A_i$ and $B_i$ are disjoint for all $i \in \{1,..., n\}$, but the rectangles $A_i$ and $B_j$ have a common point for all $i, j \in \{1,..., n\}$, $i \ne j$. [i]Note: By points belonging to a rectangle we mean all points lying either in its interior, or on any of its sides, including its vertices [/i]

Let $f(k)$ be the number of integers $n$ satisfying the following conditions: (i) $0\leq n < 10^k$ so $n$ has exactly $k$ digits (in decimal notation), with leading zeroes allowed; (ii) the digits of $n$ can be permuted in such a way that they yield an integer divisible by $11$. Prove that $f(2m) = 10f(2m-1)$ for every positive integer $m$. [i]Proposed by Dirk Laurie, South Africa[/i]

Show that the set $S$ of natural numbers $n$ for which $\frac{3}{n}$ cannot be written as the sum of two reciprocals of natural numbers ($S =\left\{n |\frac{3}{n} \neq \frac{1}{p} + \frac{1}{q} \text{ for any } p, q \in \mathbb N \right\}$) is not the union of finitely many arithmetic progressions.

(a) FInd the number of complex roots of $Z^6 = Z + \bar{Z}$ (b) Find the number of complex solutions of $Z^n = Z + \bar{Z}$ for $n \in \mathbb{Z}^+$

A [i]windmill[/i] is a closed line segment of unit length with a distinguished endpoint, the [i]pivot[/i]. Let $S$ be a finite set of $n$ points such that the distance between any two points of $S$ is greater than $c$. A configuration of $n$ windmills is [i]admissible[/i] if no two windmills intersect and each point of $S$ is used exactly once as a pivot. An admissible configuration of windmills is initially given to Geoff in the plane. In one operation Geoff can rotate any windmill around its pivot, either clockwise or counterclockwise and by any amount, as long as no two windmills intersect during the process. Show that Geoff can reach any other admissible configuration in finitely many operations, where (i) $c = \sqrt 3$, (ii) $c = \sqrt 2$. [i]Proposed by Michael Ren[/i]

It is given that there exist unique integers $m_1,\ldots, m_{100}$ such that \[0\leq m_1 < m_2 < \cdots < m_{100}\quad\text{and}\quad 2018 = \binom{m_1}1 + \binom{m_2}2 + \cdots + \binom{m_{100}}{100}.\] Find $m_1 + m_2 + \cdots + m_{100}$.

In the $xOy$ system consider the lines $d_1\ :\ 2x-y-2=0,\ d_2\ :\ x+y-4=0,\ d_3\ :\ y=2$ and $d_4\ :\ x-4y+3=0$. Find the vertices of the triangles whom medians are $d_1,d_2,d_3$ and $d_4$ is one of their altitudes. [i]Lucian Dragomir[/i]

Compute the greatest constant $K$ such that for all positive real numbers $a,b,c,d$ measuring the sides of a cyclic quadrilateral, we have \[ \left(\frac{1}{a+b+c-d}+\frac{1}{a+b-c+d}+\frac{1}{a-b+c+d}+\frac{1}{-a+b+c+d}\right)(a+b+c+d)\geq K. \] [i]2015 CCA Math Bonanza Lightning Round #3.4[/i]

Is it possible for an isosceles triangle with all its sides of positive integer lengths to have an angle of $36^o$? [i] (Adapted from Archimedes 2011, Traian Preda)[/i]

At a volleyball tournament, each team plays exactly once against each other team. Each game has a winning team, which gets $1$ point. The losing team gets $0$ points. Draws do not occur. In the nal ranking, only one team turns out to have the least number of points (so there is no shared last place). Moreover, each team, except for the team having the least number of points, lost exactly one game against a team that got less points in the final ranking. a) Prove that the number of teams cannot be equal to $6$. b) Show, by providing an example, that the number of teams could be equal to $7$.

Forty teams play a tournament in which every team plays every other team exactly once. No ties occur, and each team has a $50 \%$ chance of winning any game it plays. The probability that no two teams win the same number of games is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $\log_2 n.$

For any positive integer $n$, define the subset $S_n$ of natural numbers as follow $$ S_n = \left\{x^2+ny^2 : x,y \in \mathbb{Z} \right\}.$$ Find all positive integers $n$ such that there exists an element of $S_n$ which [u]doesn't belong[/u] to any of the sets $S_1, S_2,\dots,S_{n-1}$. [i]Proposed by Yahya Motevassel[/i]

Determine all natural numbers $n$ of the form $n=[a,b]+[b,c]+[c,a]$ where $a,b,c$ are positive integers and $[u,v]$ is the least common multiple of the integers $u$ and $v$.

Fencing Ferdinand wants to fence three rectangular areas. there are fences in three types, with $4$ amount of fences of each type. You will notice that there is always at least as much area it manages to enclose a total of three by enclosing three square areas (i.e., each area fencing elements of the same size to enclose it) as if it were three different, rectangular would encircle an area (i.e., use two different elements for each of the three areas). Why is this is so? When does it not matter how he fences the rectangles, in terms of the sum of the areas?

Let $r, s$, and $t$ be the three roots of the equation $8x^3 + 1001x + 2008 = 0$. Find $(r + s)^3 + (s + t)^3 + (t + r)^3$ .

The area of rectangle $ABCD$ is $72$. If point $A$ and the midpoints of $\overline{BC}$ and $\overline{CD}$ are joined to form a triangle, the area of that triangle is [asy] pair A,B,C,D; A = (0,8); B = (9,8); C = (9,0); D = (0,0); draw(A--B--C--D--A--(9,4)--(4.5,0)--cycle); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,SE); label("$D$",D,SW); [/asy] $\text{(A)}\ 21 \qquad \text{(B)}\ 27 \qquad \text{(C)}\ 30 \qquad \text{(D)}\ 36 \qquad \text{(E)}\ 40$

Points $P$ and $Q$ inside a triangle $ABC$ with sides $a,b,c$ and the corresponding angle $\alpha,\beta,\gamma$ satisfy $\angle BPC=\angle CPA=\angle APB=120^\circ$ and $\angle BQC=60^\circ+\alpha$, $\angle CQA=60^\circ+\beta$, $\angle AQB=60^\circ+\gamma$. Prove the equality $$(AP+BP+CP)^3\cdot AQ\cdot BQ\cdot CQ=(abc)^2.$$