Maisy and Jeff are playing a game with a deck of cards with $4$ $0$’s, $4$ $1$’s, $4$ $2$’s, all the way up to $4$ $9$’s. You cannot tell apart cards of the same number. After shuffling the deck, Maisy and Jeff each take $4$ cards, make the largest $4$-digit integer they can, and then compare. The person with the larger $4$-digit integer wins. Jeff goes first and draws the cards $2,0,2,1$ from the deck. Find the number of hands Maisy can draw to beat that, if the order in which she draws the cards matters. [i]Proposed by Richard Chen[/i]

Prove that the arithmetic progression $3,7,11,15,...$. contains infinitely many prime numbers.

Let $\mathcal{R}$ be the region in the plane bounded by the graphs of $y=x$ and $y=x^2$. Compute the volume of the region formed by revolving $\mathcal{R}$ around the line $y=x$.

We are given six points in space with distinct distances, no three of them collinear. Consider all triangles with vertices among these points. Show that among these triangles there is one such that its longest side is the shortest side in one of the other triangles.

Let $C$ and $D$ be points on the semicircle with center $O$ and diameter $AB$ such that $ABCD$ is a convex quadrilateral. Let $Q$ be the intersection of the diagonals $[AC]$ and $[BD]$, and $P$ be the intersection of the lines tangent to the semicircle at $C$ and $D$. If $m(\widehat{AQB})=2m(\widehat{COD})$ and $|AB|=2$, then what is $|PO|$? $ \textbf{(A)}\ \sqrt 2 \qquad\textbf{(B)}\ \sqrt 3 \qquad\textbf{(C)}\ \frac{1+\sqrt 3} 2 \qquad\textbf{(D)}\ \frac{1+\sqrt 3}{2\sqrt 2} \qquad\textbf{(E)}\ \frac{2\sqrt 3} 3 $

A museum wants to protect its most valuable piece by maintaining constant surveillance. To do this, he wants to place guards to watch the place, in shifts of $7$ consecutive hours. Each guard starts his shift at the same time every day. A guard is essential if there is any time during the day when you are alone to watch the item. Indicates all possibilities for the number of guards guarding the piece, so that everyone is indispensable.

Let $a, b, c $ be positive real numbers such that $abc = \frac {2} {3}. $ Prove that: $$\frac {ab}{a + b} + \frac {bc} {b + c} + \frac {ca} {c + a} \geqslant \frac {a+b+c} {a^3+b ^ 3 + c ^ 3}.$$

Let $ABCD$ be a parallelogram and a circle $k$ passes through $A, C$ and meets rays $AB, AD$ at $E, F$. If $BD, EF$ and the tangent at $C$ concur, show that $AC$ is diameter of $k$.

Find the smallest possible value of the expression $$\frac{(a+b) (b + c)}{a + 2b+c}$$ where $a, b, c$ are arbitrary numbers from the interval $[1,2]$.

Each segment whose endpoints are the vertices of a given regular $100$-gon is colored red, if the number of vertices between its endpoints is even, and blue otherwise. (For example, all sides of the $100$-gon are red.) A number is placed in every vertex so that the sum of their squares is equal to $1$. On each segment the product of the numbers at its endpoints is written. The sum of the numbers on the blue segments is subtracted from the sum of the numbers on the red segments. What is the greatest possible result? (Ilya Bogdanov)

Smallville is populated by unmarried men and women, some of them are acquainted. Two city’s matchmakers are aware of all acquaintances. Once, one of matchmakers claimed: “I could arrange that every brunette man would marry a woman he was acquainted with”. The other matchmaker claimed “I could arrange that every blonde woman would marry a man she was acquainted with”. An amateur mathematician overheard their conversation and said “Then both arrangements could be done at the same time! ” Is he right?

$60$ children participate in a summer camp. Among any $10$ of the children there are three or more who live in the same block. Prove that there must be $15$ or more children from the same block. (Folklore)

There were three times as many red candies as blue candies on a table. After Darrel took the same number of red candies and blue candies, there were four times as many red candies as blue candies left on the table. Then after Cloe took $12$ red candies and $12$ blue candies, there were five times as many red candies as blue candies left on the table. Find the total number of candies that Darrel took.

Find all positive integers $n$ such that $2021^n$ can be expressed in the form $x^4-4y^4$ for some integers $x,y$.

Let $ABCD$ be a tetrahedron with $AB=41$, $AC=7$, $AD=18$, $BC=36$, $BD=27$, and $CD=13$, as shown in the figure. Let $d$ be the distance between the midpoints of edges $AB$ and $CD$. Find $d^{2}$. [asy] pair C=origin, D=(4,11), A=(8,-5), B=(16,0); draw(A--B--C--D--B^^D--A--C); draw(midpoint(A--B)--midpoint(C--D), dashed); label("27", B--D, NE); label("41", A--B, SE); label("7", A--C, SW); label("$d$", midpoint(A--B)--midpoint(C--D), NE); label("18", (7,8), SW); label("13", (3,9), SW); pair point=(7,0); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D));[/asy]

Let $n$ be a natural number greater than 6. $X$ is a set such that $|X| = n$. $A_1, A_2, \ldots, A_m$ are distinct 5-element subsets of $X$. If $m > \frac{n(n - 1)(n - 2)(n - 3)(4n - 15)}{600}$, prove that there exists $A_{i_1}, A_{i_2}, \ldots, A_{i_6}$ $(1 \leq i_1 < i_2 < \cdots, i_6 \leq m)$, such that $\bigcup_{k = 1}^6 A_{i_k} = 6$.

Consider a quarter-circle with center $O,$ arc $\widehat{AB},$ and radius $2.$ Draw a semicircle with diameter $\overline{OA}$ lying inside the quarter-circle. Points $P$ and $Q$ lie on the semicircle and segment $\overline{OB},$ respectively, such that line $PQ$ is tangent to the semicircle. As $P$ and $Q$ vary, compute the maximum possible area of triangle $BQP.$

Find all functions $f: \mathbb{R}\to\mathbb{R}$ that satisfy $y^2f(x)(f(x)-2x)\le (1-xy)(1+xy) $ for any $x,y \in\mathbb{R}$.

Let $a$, $b$, $c$ be real numbers greater than or equal to $1$. Prove that \[ \min \left(\frac{10a^2-5a+1}{b^2-5b+10},\frac{10b^2-5b+1}{c^2-5c+10},\frac{10c^2-5c+1}{a^2-5a+10}\right )\leq abc. \]

A particle moves from the point \(P\) to the point \(Q\) in the Cartesian plane. When it passes through any point \((x,y)\), the particle has an instantaneous speed of \(\sqrt{x + y}\). Compute the minimum time required for the particle to move: (i) from \(P_1=(-1,0)\) to \(Q_1=(1,0)\), and (ii) from \(P_2=(0,1)\) to \(Q_2=(1,1)\). [i]proposed by the ICMC Problem Committee[/i]

Triangle $ ABC$ is isosceles with $ AC \equal{} BC$ and $ \angle{C} \equal{} 120^o$. Points $ D$ and $ E$ are chosen on segment $ AB$ so that $ |AD| \equal{} |DE| \equal{} |EB|$. Find the sizes of the angles of triangle $ CDE$.

Let $B = (-1, 0)$ and $C = (1, 0)$ be fixed points on the coordinate plane. A nonempty, bounded subset $S$ of the plane is said to be [i]nice[/i] if $\text{(i)}$ there is a point $T$ in $S$ such that for every point $Q$ in $S$, the segment $TQ$ lies entirely in $S$; and $\text{(ii)}$ for any triangle $P_1P_2P_3$, there exists a unique point $A$ in $S$ and a permutation $\sigma$ of the indices $\{1, 2, 3\}$ for which triangles $ABC$ and $P_{\sigma(1)}P_{\sigma(2)}P_{\sigma(3)}$ are similar. Prove that there exist two distinct nice subsets $S$ and $S'$ of the set $\{(x, y) : x \geq 0, y \geq 0\}$ such that if $A \in S$ and $A' \in S'$ are the unique choices of points in $\text{(ii)}$, then the product $BA \cdot BA'$ is a constant independent of the triangle $P_1P_2P_3$.

Let $p > 2$ be a fixed prime number. Find all functions $f: \mathbb Z \to \mathbb Z_p$, where the $\mathbb Z_p$ denotes the set $\{0, 1, \ldots , p-1\}$, such that $p$ divides $f(f(n))- f(n+1) + 1$ and $f(n+p) = f(n)$ for all integers $n$. [i]Proposed by Grant Yu[/i]

Let $ABC$ be an acute scalene triangle with orthocenter $H$. Let $M$ be the midpoint of $BC$. $N$ is the point on line $AM$ such that $(BMN)$ is tangent to $AB$. Finally, let $H'$ be the reflection of $H$ in $B$. Prove that $\angle ANH'=90^{\circ}$. [i]Proposed by Malay Mahajan and Siddharth Choppara[/i]

There are $100$ lightbulbs $B_1,\ldots, B_{100}$ spaced evenly around a circle in this order. Additionally, there are $100$ switches $S_1,\ldots, S_{100}$ such that for all $1\leq i\leq 100$, switch $S_i$ toggles the states of lights $B_{i-1}$ and $B_{i+1}$ (where here $B_{101} = B_1$). Suppose David chooses whether to flick each switch with probability $\tfrac12$. What is the expected number of lightbulbs which are on at the end of this process given that not all lightbulbs are off?