2. Let $A$ be a set of $2020$ distinct real numbers. Call a number [i]scarily epic[/i] if it can be expressed as the product of two (not necessarily distinct) numbers from $A$. What is the minimum possible number of distinct [i]scarily epic[/i] numbers? [i]Proposed by Monkey_king1[/i]

Let $n\geq 2$. Find all matrices $A\in\mathcal{M}_n(\mathbb{C})$ such that $$\text{rank}(A^2)+\text{rank}(B^2)\geq 2\text{rank}(AB),$$ for all $B\in\mathcal{M}_n(\mathbb{C})$. [i]Cristi Săvescu[/i]

Let $n$ be a positive integer, and let $x_1, x_2, \dots, x_n$ be distinct positive integers with $x_1 = 1$. Construct an $n \times 3$ table where the entries of the $k$-th row are $x_k, 2x_k, 3x_k$ for $k = 1, 2, \dots, n$. Now follow a procedure where, in each step, two identical entries are removed from the table. This continues until there are no more identical entries in the table. [list=a] [*] Prove that at least three entries remain at the end of the procedure. [*] Prove that there are infinitely many possible choices for $n$ and $x_1, x_2, \dots, x_n$ such that only three entries remain. [/list]

It is election year in PUMACland, and for the presidential election there are $27$ people voting for either Vraj Patel or Vedant Shah. Each voter selects a candidate uniformly at random, and their ballots are labeled $1$ through $27.$ The election takes place as a series of rounds. In each round, the surviving ballots are sorted by label and separated into consecutive groups of three. From each group, the person with the most votes wins, and exactly one of the ballots bearing the winner’s name is allowed to proceed to the next round. This procedure continues until a single ballot remains, and the person whose name is on the ballot wins. Alice, Bob, and Carol submitted ballots numbered $1, 15,$ and $27,$ respectively. Suppose that Alice, Bob, and Carol had all flipped their votes. If the probability that the outcome of the election would have changed is $\tfrac{a}{b}$ for relatively prime positive integers $a, b,$ find $a + b.$

Given a convex polygon $ A_1A_2 \ldots A_n$ with area $ S$ and a point $ M$ in the same plane, determine the area of polygon $ M_1M_2 \ldots M_n,$ where $ M_i$ is the image of $ M$ under rotation $ R^{\alpha}_{A_i}$ around $ A_i$ by $ \alpha_i, i \equal{} 1, 2, \ldots, n.$

Find the least positive integer $n$ with the property: Among arbitrarily $n$ selected consecutive positive integers, all smaller than $2018$, there is at least one that is divisible by its sum of digits .

The sum of two positive numbers is $5$ times their difference. What is the ratio of the larger number to the smaller? $\textbf{(A) }\dfrac54\qquad\textbf{(B) }\dfrac32\qquad\textbf{(C) }\dfrac95\qquad\textbf{(D) }2\qquad\textbf{(E) }\dfrac52$

Let $A$ and $B$ be two points inside a given circle $k$. Prove that there exist (infinitely many) circles through $A$ and $B$ which lie entirely in $k$.

A gambler has $\$25$ and each turn, if the gambler has a positive amount of money, a fair coin is flipped. If it is heads, the gambler gains a dollar and if it is tails, the gambler loses a dollar. But, if the gambler has no money, he will automatically be given a dollar (which counts as a turn). What is the expected number of turns for the gambler to double his money?

\[\int_1^2 \frac{\sqrt{1-\frac 1x}}{x-1}\mathrm dx\] [i]Proposed by Connor Gordon[/i]

Let $a_1,a_2,...$ be a sequence of non-negative integers such that for any $m,n$ \[ \sum_{i=1}^{2m} a_{in} \leq m.\] Show that there exist $k,d$ such that \[ \sum_{i=1}^{2k} a_{id} = k-2014.\]

Select numbers $ a$ and $ b$ between $ 0$ and $ 1$ independently and at random, and let $ c$ be their sum. Let $ A, B$ and $ C$ be the results when $ a, b$ and $ c$, respectively, are rounded to the nearest integer. What is the probability that $ A \plus{} B \equal{} C$? $ \textbf{(A)}\ \frac14 \qquad \textbf{(B)}\ \frac13 \qquad \textbf{(C)}\ \frac12 \qquad \textbf{(D)}\ \frac23 \qquad \textbf{(E)}\ \frac34$

Given a circle and its center $O$, a point $A$ inside the circle and a distance $h$, construct a triangle $BAC$ with $\angle BAC = 90^\circ$, $B$ and $C$ on the circle and the altitude from $A$ length $h$.

Let $\mathbb{N} = \{1,2, \ldots\}.$ Does there exists a function $f: \mathbb{N} \mapsto \mathbb{N}$ such that $\forall n \in \mathbb{N},$ $f^{1989}(n) = 2 \cdot n$ ?

In a square of sidelength $7$, $51$ points are given. Show that there's a disk of radius $1$ covering at least $3$ of these points.

Denote by $ H_n$ the linear space of $ n\times n$ self-adjoint complex matrices, and by $ P_n$ the cone of positive-semidefinite matrices in this space. Let us consider the usual inner product on $ H_n$ \[ \langle A,B\rangle \equal{} {\rm tr} AB\qquad (A,B\in H_n)\] and its derived metric. Show that every $ \phi: P_n\to P_n$ isometry (that is a not necessarily surjective, distance preserving map with respect to the above metric) can be expressed as \[ \phi(A) \equal{} UAU^* \plus{} X\qquad (A\in H_n)\] or \[ \phi(A) \equal{} UA^TU^* \plus{} X\qquad (A\in H_n)\] where $ U$ is an $ n\times n$ unitary matrix, $ X$ is a positive-semidefinite matrix, and $ ^T$ and $ ^*$ denote taking the transpose and the adjoint, respectively.

Doug can paint a room in $ 5$ hours. Dave can paint the same room in $ 7$ hours. Doug and Dave paint the room together and take a one-hour break for lunch. Let $ t$ be the total time, in hours, required for them to complete the job working together, including lunch. Which of the following equations is satisfied by $ t$? $ \textbf{(A)}\ \left(\frac{1}{5}\plus{}\frac{1}{7}\right)(t\plus{}1)\equal{}1 \qquad \textbf{(B)}\ \left(\frac{1}{5}\plus{}\frac{1}{7}\right)t\plus{}1\equal{}1 \qquad \textbf{(C)}\ \left(\frac{1}{5}\plus{}\frac{1}{7}\right)t\equal{}1 \\ \textbf{(D)}\ \left(\frac{1}{5}\plus{}\frac{1}{7}\right)(t\minus{}1)\equal{}1 \qquad \textbf{(E)}\ (5\plus{}7)t\equal{}1$

Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that $$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$ for all positive integers $n$. Show that $a_{2022}\leq 1$.

Removing a unit square from a $2\times 2$ square we get a piece called [i]L-tromino.[/i] From the fourth line of a $7 \times 7$ cheesboard some unit squares have been removed. The resulting chessboard is cut in L-trominos. Determine the number and location of the removed squares.

Points $A$ and $B$ move with a constant speed along lines $a$ and $b$. Two corresponding positions of these points $A_1,B_1$, and $A_2,B_2$ are known. Find the position of $A$ and $B$ for which the length of $AB$ is minimal.

Five points lie on the surface of a ball of unit radius. Find the maximum of the smallest distance between any two of them.

Positive odd integers $a, b$ are such that $a^bb^a$ is a perfect square. Show that $ab$ is a perfect square.

$\pi(n)$ is the number of primes that are not bigger than $n$. For $n=2,3,4,6,8,33,\dots$ we have $\pi(n)|n$. Does exist infinitely many integers $n$ that $\pi(n)|n$?

Let $n,k$ be positive integers such that $n$ is not divisible by $3$ and $k\ge n$. Prove that there is an integer $m$ divisible by $n$ whose sum of digits in base $10$ equals $k$.

Let $n$ be a positive integer and $a_1,a_2,\ldots a_{2n+1}$ be positive reals. For $k=1,2,\ldots ,2n+1$, denote $b_k = \max_{0\le m\le n}\left(\frac{1}{2m+1} \sum_{i=k-m}^{k+m} a_i \right)$, where indices are taken modulo $2n+1$. Prove that the number of indices $k$ satisfying $b_k\ge 1$ does not exceed $2\sum_{i=1}^{2n+1} a_i$.