The hexagonal pattern constructed below has two smaller hexagons per side and has a total of $30$ edges. A similar figure is constructed with $20$ smaller hexagons per side. Compute the number of edges in this larger figure. [Insert Diagram] [i]Proposed by Ezra Erives[/i]

In a $25 \times n$ grid, each square is colored with a color chosen among $8$ different colors. Let $n$ be as minimal as possible such that, independently from the coloration used, it is always possible to select $4$ coloumns and $4$ rows such that the $16$ squares of the interesections are all of the same color. Find the remainder when $n$ is divided by $1000$. [i]Proposed by [b]FedeX333X[/b][/i]

The least positive integer with exactly $2021$ distinct positive divisors can be written in the form $m \cdot 6^k$, where $m$ and $k$ are integers and $6$ is not a divisor of $m$. What is $m+k?$ $(\textbf{A})\: 47\qquad(\textbf{B}) \: 58\qquad(\textbf{C}) \: 59\qquad(\textbf{D}) \: 88\qquad(\textbf{E}) \: 90$

Point $P$ is the intersection of diagonals $AC,BD$ of the trapezoid $ABCD$ with $AB \parallel CD$. Reflections of the lines $AD$ and $BC$ into the internal angle bisectors of $\angle PDC$ and $\angle PCD$ intersects the circumcircles of $\bigtriangleup APD$ and $\bigtriangleup BPC$ at $D'$ and $C'$. Line $C'A$ intersects the circumcircle of $\bigtriangleup BPC$ again at $Y$ and $D'C$ intersects the circumcricle of $\bigtriangleup APD$ again at $X$. Prove that $P,X,Y$ are collinear. [i]Proposed by Iman Maghsoudi - Iran[/i]

A rectangular prism has three distinct faces of area $24$, $30$, and $32$. The diagonals of each distinct face of the prism form sides of a triangle. What is the triangle’s area?

Let $\Gamma$ be a circle centered at $O$ with chord $AB$. The tangents to $\Gamma$ at $A$ and $B$ meet at $C$. A secant from $C$ intersects chord $AB$ at $D$ and $\Gamma$ at $E$ such that $D$ lies on segment $CE$. Given that $\angle BOD + \angle EAD = 180^\circ$, $AE = 1$, and $BE = 2$, find $CE$.

The diagonals of a convex quadrilateral $ABCD$ intersect at $E$. The triangles $ABE, BCE, CDE$ and $DAE$ have centroids $K,L,M$ and $N$, and orthocentres $Q,R,S$ and $T$. Show that the quadrilaterals $QRST$ and $LMNK$ are similar.

Let $f$ be a differentiable real-valued function defined on the positive real numbers. The tangent lines to the graph of $f$ always meet the $y$-axis 1 unit lower than where they meet the function. If $f(1)=0$, what is $f(2)$?

Consider the sequence of rational numbers defined by $x_1=\frac{4}{3}$, and $x_{n+1}=\frac{x_n^2}{x_n^2-x_n+1}$. Show that the nu,erator of the lowest term expression of each sum $x_1+x_2+...+x_k$ is a perfect square.

Ten million fireflies are glowing in $\mathbb{R}^3$ at midnight. Some of the fireflies are friends, and friendship is always mutual. Every second, one firefly moves to a new position so that its distance from each one of its friends is the same as it was before moving. This is the only way that the fireflies ever change their positions. No two fireflies may ever occupy the same point. Initially, no two fireflies, friends or not, are more than a meter away. Following some finite number of seconds, all fireflies find themselves at least ten million meters away from their original positions. Given this information, find the greatest possible number of friendships between the fireflies. [i]Nikolai Beluhov[/i]

Prove that none of the digits $2$, $4$, $7$, $9$ can be the last digit of a number $$ 1 + 2 + 3 + \ldots + n,$$ where $n$ is a natural number.

A sequence of real numbers $a_0, a_1, . . .$ is said to be good if the following three conditions hold. (i) The value of $a_0$ is a positive integer. (ii) For each non-negative integer $i$ we have $a_{i+1} = 2a_i + 1 $ or $a_{i+1} =\frac{a_i}{a_i + 2} $ (iii) There exists a positive integer $k$ such that $a_k = 2014$. Find the smallest positive integer $n$ such that there exists a good sequence $a_0, a_1, . . .$ of real numbers with the property that $a_n = 2014$. [i]Proposed by Wang Wei Hua, Hong Kong[/i]

Given is a triangle $ABC$ with circumcircle $\gamma$. Points $E, F$ lie on $AB, AC$ such that $BE=CF$. Let $(AEF)$ meet $\gamma$ at $D$. The perpendicular from $D$ to $EF$ meets $\gamma$ at $G$ and $AD$ meets $EF$ at $P$. If $PG$ meets $\gamma$ at $J$, prove that $\frac {JE} {JF}=\frac{AE} {AF}$.

Find all pairwise relatively prime positive integers $l, m, n$ such that \[(l+m+n)\left( \frac{1}{l}+\frac{1}{m}+\frac{1}{n}\right)\] is an integer.

Let $a,b,c$ positive reals such that $a+b+c=3$. Show that following expression's minimum value is $2$. $$\frac{\sqrt a +\sqrt b +\sqrt c}{ab+bc+ca} + \frac{1}{1+2\sqrt {ab}} + \frac {1}{1+ 2\sqrt {bc}} + \frac{1}{1+ 2\sqrt {ca}}$$

Let $n\ge 2$ be an even integer and $a,b$ real numbers such that $b^n=3a+1$. Show that the polynomial $P(X)=(X^2+X+1)^n-X^n-a$ is divisible by $Q(X)=X^3+X^2+X+b$ if and only if $b=1$.

To be continuous at $ x \equal{} \minus{} 1$, the value of $ \frac {x^3 \plus{} 1}{x^2 \minus{} 1}$ is taken to be: $ \textbf{(A)}\ \minus{} 2 \qquad\textbf{(B)}\ 0 \qquad\textbf{(C)}\ \frac {3}{2} \qquad\textbf{(D)}\ \infty \qquad\textbf{(E)}\ \minus{} \frac {3}{2}$

Consider a $2 \times n$ grid where each cell is either black or white, which we attempt to tile with $2 \times 1$ black or white tiles such that tiles have to match the colors of the cells they cover. We first randomly select a random positive integer $N$ where $N$ takes the value $n$ with probability $\frac{1}{2^n}$. We then take a $2 \times N$ grid and randomly color each cell black or white independently with equal probability. Compute the probability the resulting grid has a valid tiling.

In a scalene triangle $ ABC$ the altitudes $ AA_{1}$ and $ CC_{1}$ intersect at $ H, O$ is the circumcenter, and $ B_{0}$ the midpoint of side $ AC$. The line $ BO$ intersects side $ AC$ at $ P$, while the lines $ BH$ and $ A_{1}C_{1}$ meet at $ Q$. Prove that the lines $ HB_{0}$ and $ PQ$ are parallel.

Let $N \geq 3$ be an integer, and let $a_0, \dots, a_{N-1}$ be pairwise distinct reals so that $a_i \geq a_{2i}$ for all $i$ (indices are taken $\bmod~ N$). Find all possible $N$ for which this is possible. [i]Proposed by Sutanay Bhattacharya[/i]

Let $A$ and $B$ be integers with an odd sum. Show that every integer can be written in the form $x^2 -y^2 +Ax+By$, where $x,y$ are integers.

Four distinct circles are drawn in a plane. What is the maximum number of points where at least two of the circles intersect? $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 16$

A total of $2010$ coins are distributed in $5$ boxes. At the beginning the quantities of coins in the boxes are consecutive natural numbers. Martha should choose and take one of the boxes, but before that she can do the following transformation finitely many times: from a box with at least 4 coins she can transfer one coin to each of the other boxes. What is the maximum number of coins that Martha can take away?

Let $f(n) = \sum_{gcd(k,n)=1,1\le k\le n}k^3$ . If the prime factorization of $f(2020)$ can be written as $p^{e_1}_1 p^{e_2}_2 ... p^{e_k}_k$, find $\sum^k_{i=1} p_ie_i$.

Compute $$\lim_{x\rightarrow1}\frac{x^3-1}{x-1}.$$