Let $\mathcal{S}$ be a sphere with radius $2.$ There are $8$ congruent spheres whose centers are at the vertices of a cube, each has radius $x,$ each is externally tangent to $3$ of the other $7$ spheres with radius $x,$ and each is internally tangent to $\mathcal{S}.$ There is a sphere with radius $y$ that is the smallest sphere internally tangent to $\mathcal{S}$ and externally tangent to $4$ spheres with radius $x.$ There is a sphere with radius $z$ centered at the center of $\mathcal{S}$ that is externally tangent to all $8$ of the spheres with radius $x.$ Find $18x + 5y + 4z.$

Rectangle $ABCD$ has side lengths $AB=84$ and $AD=42$. Point $M$ is the midpoint of $\overline{AD}$, point $N$ is the trisection point of $\overline{AB}$ closer to $A$, and point $O$ is the intersection of $\overline{CM}$ and $\overline{DN}$. Point $P$ lies on the quadrilateral $BCON$, and $\overline{BP}$ bisects the area of $BCON$. Find the area of $\triangle{CDP}$.

In a lottery, a person must select six distinct numbers from $1, 2, 3,\dots, 36$ to put on a ticket. The lottery commitee will then draw six distinct numbers randomly from $1, 2, 3, \ldots, 36$. Any ticket with numbers not containing any of these $6$ numbers is a winning ticket. Show that there is a scheme of buying $9$ tickets guaranteeing at least one winning ticket, but $8$ tickets are not enough to guarantee a winning ticket in general.

Let $N$ be the number of non-empty subsets $T$ of $S = \{1, 2, 3, 4, . . . , 2020\}$ satisfying $\max (T) >1000$. Compute the largest integer $k$ such that $3^k$ divides $N$.

Let $\mathbb{Z^+}$ denote the set of positive integers. Find all functions $f:\mathbb{Z^+} \to \mathbb{Z^+}$ satisfying the condition $$ f(a) + f(b) \mid (a + b)^2$$ for all $a,b \in \mathbb{Z^+}$

Determine $3x_4+2x_5$ if $x_1$, $x_2$, $x_3$, $x_4$, and $x_5$ satisfy the system of equations below. \[ \begin{array}{l} 2x_1+x_2+x_3+x_4+x_5=6 \\ x_1+2x_2+x_3+x_4+x_5=12 \\ x_1+x_2+2x_3+x_4+x_5=24 \\ x_1+x_2+x_3+2x_4+x_5=48 \\ x_1+x_2+x_3+x_4+2x_5=96 \\ \end{array} \]

For a positive integer k, let $f_{1}(k)$ be the square of the sum of the digits of k. (For example $f_{1}(123)=(1+2+3)^{2}=36$.) Let $f_{n+1}(k)=f_{1}(f_{n}(k))$. Determine the value of the $f_{2007}(2^{2006})$. Justify your claim.

The orthogonal projection of a tetrahedron onto a plane containing one of its faces is a trapezoid of area $1$, which has only one pair of parallel sides. a) Is it possible that the orthogonal projection of this tetrahedron onto a plane containing another its face is a square of area $1$? b) The same question for a square of area $1/2019$. (Mikhail Evdokimov)

1. Find $N$, the smallest positive multiple of $45$ such that all of its digits are either $7$ or $0$. 2. Find $M$, the smallest positive multiple of $32$ such that all of its digits are either $6$ or $1$. 3. How many elements of the set $\{1,2,3,...,1441\}$ have a positive multiple such that all of its digits are either $5$ or $2$?

Let $0=x_0<x_1<\cdots<x_n=1$ .Find the largest real number$ C$ such that for any positive integer $ n $ , we have $$\sum_{k=1}^n x^2_k (x_k - x_{k-1})>C$$

Let $p>2$ be a prime and let \[\mathcal{A}=\{n \in \mathbb{N}: 2p \mid n \text{ and } p^2\nmid n \text{ and } n \mid 3^n-1\}.\] Prove that \[\limsup_{k \to \infty} \frac{\vert \mathcal{A} \cap [1,k]\vert}{k} \le \frac{2\log 3}{p\log p}.\]

The sequence $a_i$ is defined as $a_1 = 1$ and \[a_n = a_{\left\lfloor \dfrac{n}{2} \right\rfloor} + a_{\left\lfloor \dfrac{n}{3} \right\rfloor} + a_{\left\lfloor \dfrac{n}{4} \right\rfloor} + \cdots + a_{\left\lfloor \dfrac{n}{n} \right\rfloor} + 1\] for every positive integer $n > 1$. Prove that there are infinitely many values of $n$ such that $a_n \equiv n \mod 2012$.

Let $p\ge 2$ be a prime number and $a\ge 1$ be an integer different from $p$. Find all pairs $(a, p)$ such that $a + p | a^2 + p^2$.

Ana writes a three-digit code, and Beto has to guess it. To do so, he can ask about a sequence of three digits, and Ana will respond "warm" if the sequence Beto proposes has at least one correct digit in the correct position, and she will respond "cold" if none of the digits are correct. For example, if the correct code is $014$, then if Beto asks $099$ or $014$, he receives the answer "warm", and if he asks $140$ or $322$, he receives the answer "cold". Determine the minimum number of questions Beto needs to ask in order to know the correct code with certainty.

We have two triangles that lengths of its sides are $3,4,5$, one triangle that lengths of its sides are $4,5,\sqrt{41}$, one triangle that lengths of its sides are $\frac{5}{6}\sqrt2,4,5$. The number of tetrahedrons with such four surfaces is________.

Let $ ABCD$ be a trapezoid with $ AB\parallel{}CD$, $ AB\equal{}11$, $ BC\equal{}5$, $ CD\equal{}19$, and $ DA\equal{}7$. Bisectors of $ \angle A$ and $ \angle D$ meet at $ P$, and bisectors of $ \angle B$ and $ \angle C$ meet at $ Q$. What is the area of hexagon $ ABQCDP$? $ \textbf{(A)}\ 28\sqrt{3}\qquad \textbf{(B)}\ 30\sqrt{3}\qquad \textbf{(C)}\ 32\sqrt{3}\qquad \textbf{(D)}\ 35\sqrt{3}\qquad \textbf{(E)}\ 36\sqrt{3}$

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

Consider the triangle $ ABC $ with $ \angle BAC>60^{\circ } $ and $ \angle BCA>30^{\circ } . $ On the other semiplane than that determined by $ BC $ and $ A $ we have the points $ D $ and $ E $ so that $$ \angle ABE =\angle CBD =\angle BAE +30^{\circ } =\angle BCD +30^{\circ } =90^{\circ } . $$ Note by $ F,H $ the midpoints of $ AE, $ respectively, $ CD, $ and with $ G $ the intersection of $ AC $ and $ DE. $ Show: [b]a)[/b] $ EBD\sim ABC $ [b]b)[/b] $ FGH\equiv ABC $

Suppose that the positive divisors of a positive integer $n$ are $1=d_1<d_2<\ldots<d_k=n$, where $k \geq 5$. Given that $k \leq 1000$ and $n={d_2}^{d_3}{d_4}^{d_5}$, compute, with proof, all possible values of $k$.

Find all triples $(f,g,h)$ of injective functions from the set of real numbers to itself satisfying \begin{align*} f(x+f(y)) &= g(x) + h(y) \\ g(x+g(y)) &= h(x) + f(y) \\ h(x+h(y)) &= f(x) + g(y) \end{align*} for all real numbers $x$ and $y$. (We say a function $F$ is [i]injective[/i] if $F(a)\neq F(b)$ for any distinct real numbers $a$ and $b$.) [i]Proposed by Evan Chen[/i]

How many ways are there to color the $8$ regions of a three-set Venn Diagram with $3$ colors such that each color is used at least once? Two colorings are considered the same if one can be reached from the other by rotation and/or reflection.

Let $X$ be an $n$-element set and let $A_1,\ldots ,A_m$ be subsets of $X$ such that i) $|A_i|=3$ for each $i=1,\ldots ,m$. ii) $|A_i\cap A_j|\le 1$ for any two distinct indices $i,j$. Show that there exists a subset of $X$ with at least $\lfloor\sqrt{2n}\rfloor$ elements which does not contain any of the $A_i$’s.

A regular $n$-gon is inscribed in a circle radius $1$. Let $X$ be the set of all arcs $PQ$, where $P, Q$ are distinct vertices of the $n$-gon. $5$ elements $L_1, L_2, ... , L_5$ of $X$ are chosen at random (so two or more of the $L_i$ can be the same). Show that the expected length of $L_1 \cap L_2 \cap L_3 \cap L_4 \cap L_5$ is independent of $n$.

Let $n > 2$ be an integer. The numbers $1, 2, . . . , n$ are written at the vertices of an $n$-gon in that order. A move consists of choosing two adjacent vertices and adding $1$ to the numbers written there. Determine all n for which it is possible to achieve that all numbers are identical after a finite number of moves.

Given a chessboard $n \times n$, where $n\geq 4$ and $p=n+1$ is a prime number. A set of $n$ unit squares is called [i]tactical[/i] if after putting down queens on these squares, no two queens are attacking each other. Prove that there exists a partition of the chessboard into $n-2$ tactical sets, not containing squares on the main diagonals. Queens are allowed to move horizontally, vertically and diagonally.