An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions: [list=] [*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.) [*]No two beams have intersecting interiors. [*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam. [/list] What is the smallest positive number of beams that can be placed to satisfy these conditions? [i]Proposed by Alex Zhai[/i]

Consider an infinite strip of unit squares. The squares are numbered "1", "2", "3", ... A pawn starts on one of the squares and it can move according to the following rules: (1) from the square numbered "$n$" to the square numbered "$2n$", and vice versa; (2) from the square numbered "$n$" to the square numbered "$3n + 1$", and vice versa. Show that the pawn can reach the square numbered "$1$" in a finite number of moves.

$2024$ people attended a party. Eunson, the host of the party, wanted to make the participant shake hands in pairs. As a professional daydreamer, Eunsun wondered which would be greater: the number of ways each person could shake hands with $4$ others or the number of ways each person could shake hands with $3$ others. Solve Eunsun's peculiar question.

Given $ a, b, c > 0$. Prove that: $ (1\plus{}a\plus{}b\plus{}c)(1\plus{}ab\plus{}bc\plus{}ca) \ge 4\sqrt{2}\sqrt{(a\plus{}bc)(b\plus{}ca)(c\plus{}ab)}$ :)

Consider a sequence $T_0, T_1, \dots$ of polynomials defined recursively by $T_0(x) = 2$, $T_1(x)=x$, and $T_{n+2}(x) = xT_{n+1}(x) - T_n(x)$ for each nonnegative integer $n$. Let $L_n$ be the sequence of Lucas Numbers, defined by $L_0 = 2$, $L_1 = 1$, and $L_{n+2} = L_n+L_{n+1}$ for every nonnegative integer $n$. Find the remainder when $ T_0\left( L_0 \right) + T_1 \left( L_2 \right) + T_2 \left( L_4 \right) + \dots + T_{359} \left( L_{718} \right)$ is divided by $359$. [i]Proposed by Yang Liu[/i]

Let $n \geq 2$. Let $a_1 , a_2 , a_3 , \ldots a_n$ be $n$ real numbers all less than $1$ and such that $|a_k - a_{k+1} | < 1$ for $1 \leq k \leq n-1$. Show that \[ \dfrac{a_1}{a_2} + \dfrac{a_2}{a_3} + \dfrac{a_3}{a_4} + \ldots + \dfrac{a_{n-1}}{a_n} + \dfrac{a_n}{a_1} < 2 n - 1 . \]

In a regular polygon with 100 vertices, 10 vertices are painted blue, and 10 other vertices are painted red. 1. Prove that there exist two distinct blue vertices \( A_1 \) and \( A_2 \), and two distinct red vertices \( R_1 \) and \( R_2 \), such that the distance between \( A_1 \) and \( R_1 \) is equal to the distance between \( A_2 \) and \( R_2 \). 2. Prove that there exist two distinct blue vertices \( A_1 \) and \( A_2 \), and two distinct red vertices \( R_1 \) and \( R_2 \), such that the distance between \( A_1 \) and \( A_2 \) is equal to the distance between \( R_1 \) and \( R_2 \).

Compute the number of ways to arrange $3$ copies of each of the $26$ lowercase letters of the English alphabet such that for any two distinct letters $x_1$ and $x_2,$ the number of $x_2$’s between the first and second occurrences of $x_1$ equals the number of $x_2$’s between the second and third occurrences of $x_1.$

Kei draws a $6\times 6$ grid. He colors $13$ of the unit squares silver and the remaining squares gold. Kei then folds the grid in half vertically, forming pairs of overlapping unit squares. Let $m$ and $M$ the least and greatest possible number of gold-on-gold pairs, respectively. What is $m + M?$ $\textbf{(A) } 12 \qquad\textbf{(B) }14 \qquad\textbf{(C) }16\qquad\textbf{(D) }18 \qquad\textbf{(E) }20$\\

A function $ f$ is defined by $ f(z) \equal{} i\bar z$, where $ i \equal{}\sqrt{\minus{}\!1}$ and $ \bar z$ is the complex conjugate of $ z$. How many values of $ z$ satisfy both $ |z| \equal{} 5$ and $ f (z) \equal{} z$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 8$

A $8\times 8$ board is given. Seven out of $64$ unit squares are painted black. Suppose that there exists a positive $k$ such that no matter which squares are black, there exists a rectangle (with sides parallel to the sides of the board) with area $k$ containing no black squares. Find the maximum value of $k$.

Let $A_1A_2A_3\dots A_{20}$ be a $20$-sided polygon $P$ in the plane, where all of the side lengths of $P$ are equal, the interior angle at $A_i$ measures $108$ degrees for all odd $i$, and the interior angle $A_i$ measures $216$ degrees for all even $i$. Prove that the lines $A_2A_8$, $A_4A_{10}$, $A_5A_{13}$, $A_6A_{16}$, and $A_7A_{19}$ all intersect at the same point. [asy] import graph; size(10cm); pair temp= (-1,0); pair A01 = (0,0); pair A02 = rotate(306,A01)*temp; pair A03 = rotate(144,A02)*A01; pair A04 = rotate(252,A03)*A02; pair A05 = rotate(144,A04)*A03; pair A06 = rotate(252,A05)*A04; pair A07 = rotate(144,A06)*A05; pair A08 = rotate(252,A07)*A06; pair A09 = rotate(144,A08)*A07; pair A10 = rotate(252,A09)*A08; pair A11 = rotate(144,A10)*A09; pair A12 = rotate(252,A11)*A10; pair A13 = rotate(144,A12)*A11; pair A14 = rotate(252,A13)*A12; pair A15 = rotate(144,A14)*A13; pair A16 = rotate(252,A15)*A14; pair A17 = rotate(144,A16)*A15; pair A18 = rotate(252,A17)*A16; pair A19 = rotate(144,A18)*A17; pair A20 = rotate(252,A19)*A18; dot(A01); dot(A02); dot(A03); dot(A04); dot(A05); dot(A06); dot(A07); dot(A08); dot(A09); dot(A10); dot(A11); dot(A12); dot(A13); dot(A14); dot(A15); dot(A16); dot(A17); dot(A18); dot(A19); dot(A20); draw(A01--A02--A03--A04--A05--A06--A07--A08--A09--A10--A11--A12--A13--A14--A15--A16--A17--A18--A19--A20--cycle); label("$A_{1}$",A01,E); label("$A_{2}$",A02,W); label("$A_{3}$",A03,NE); label("$A_{4}$",A04,SW); label("$A_{5}$",A05,N); label("$A_{6}$",A06,S); label("$A_{7}$",A07,N); label("$A_{8}$",A08,SE); label("$A_{9}$",A09,NW); label("$A_{10}$",A10,E); label("$A_{11}$",A11,W); label("$A_{12}$",A12,E); label("$A_{13}$",A13,SW); label("$A_{14}$",A14,NE); label("$A_{15}$",A15,S); label("$A_{16}$",A16,N); label("$A_{17}$",A17,S); label("$A_{18}$",A18,NW); label("$A_{19}$",A19,SE); label("$A_{20}$",A20,W);[/asy]

Let $A = (2, 0)$, $B = (0, 2)$, $C = (-2, 0)$, and $D = (0, -2)$. Compute the greatest possible value of the product $PA \cdot PB \cdot PC \cdot PD$, where $P$ is a point on the circle $x^2 + y^2 = 9$.

At CMU, the A and the B buses arrive once every 20 and 18 minutes, respectively. Kevin prefers the A bus but does not want to wait for too long. He commits to the following waiting scheme: he will take the first A bus that arrives, but after waiting for five minutes he will take the next bus that comes, no matter what it is. Determine the probability that he ends up on an A bus.

Palindrome is a sequence of digits which doesn't change if we reverse the order of its digits. Prove that a sequence $(x_n)^{\infty}_{n=0}$ defined as $x_n=2013+317n$ contains infinitely many numbers with their decimal expansions being palindromes.

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

[b](a)[/b] For every positive integer $n$ prove that \[1+\frac{1}{2^2}+\frac{1}{3^2}+\cdots+\frac{1}{n^2} <2\] [b](b)[/b] Let $X=\{1, 2, 3 ,\ldots, n\} \ ( n \geq 1)$ and let $A_k$ be non-empty subsets of $X \ (k=1,2,3, \ldots , 2^n -1).$ If $a_k$ be the product of all elements of the set $A_k,$ prove that \[\sum_{i=1}^{m} \sum_{j=1}^m \frac{1}{a_i \cdot j^2} <2n+1\]

Let $q > 1$ be a power of $2$. Let $f: \mathbb{F}_{q^2} \to \mathbb{F}_{q^2}$ be an affine map over $\mathbb{F}_2$. Prove that the equation \[ f(x) = x^{q+1} \] has at most $2q - 1$ solutions.

It is known that in the triangle $ABC$, $ 2 \angle BAC + 3 \angle ABC= 180^o$. Prove that $4(BC + CA)< 5AB$.

Let $ C_1$ be a circle and $ P$ be a fixed point outside the circle $ C_1$. Quadrilateral $ ABCD$ lies on the circle $ C_1$ such that rays $ AB$ and $ CD$ intersect at $ P$. Let $ E$ be the intersection of $ AC$ and $ BD$. (a) Prove that the circumcircle of triangle $ ADE$ and the circumcircle of triangle $ BEC$ pass through a fixed point. (b) Find the the locus of point $ E$.

Suppose that $a_0=1$ and that $a_{n+1}=a_n+e^{-a_n}$ for $n=0,1,2,\dots.$ Does $a_n-\log n$ have a finite limit as $n\to\infty?$ (Here $\log n=\log_en=\ln n.$)

In $\triangle ABC$ with a right angle at $C,$ point $D$ lies in the interior of $\overline{AB}$ and point $E$ lies in the interior of $\overline{BC}$ so that $AC=CD,$ $DE=EB,$ and the ratio $AC:DE=4:3.$ What is the ratio $AD:DB?$ $\textbf{(A) } 2:3 \qquad\textbf{(B) } 2:\sqrt{5} \qquad\textbf{(C) } 1:1 \qquad\textbf{(D) } 3:\sqrt{5} \qquad\textbf{(E) } 3:2$

How few numbers is it possible to cross out from the sequence $$1, 2,3,..., 2023$$ so that among those left no number is the product of any two (distinct) other numbers?

Proof that there exist constant $\lambda$, so that for any positive integer $m(\ge 2)$, and any lattice triangle $T$ in the Cartesian coordinate plane, if $T$ contains exactly one $m$-lattice point in its interior(not containing boundary), then $T$ has area $\le \lambda m^3$. PS. lattice triangles are triangles whose vertex are lattice points; $m$-lattice points are lattice points whose both coordinates are divisible by $m$.

In a given trapezium $ ABCD $ with $ AB$ parallel to $ CD $ and $ AB > CD $, the line $ BD $ bisects the angle $ \angle ADC $. The line through $ C $ parallel to $ AD $ meets the segments $ BD $ and $ AB $ in $ E $ and $ F $, respectively. Let $ O $ be the circumcenter of the triangle $ BEF $. Suppose that $ \angle ACO = 60^{\circ} $. Prove the equality \[ CF = AF + FO .\]