In four-dimensional space, the $24$-cell of sidelength $\sqrt{2}$ is the convex hull of (smallest convex set containing) the $24$ points $(\pm 1, \pm 1, 0, 0)$ and its permutations. Find the four-dimensional volume of this region.

Prove that the sequence $ \{y_{n}\}_{n \ge 1}$ defined by \[ y_{0}=1, \; y_{n+1}= \frac{1}{2}\left( 3y_{n}+\sqrt{5y_{n}^{2}-4}\right) \] consists only of integers.

$ABCD$ is a rectangle. $I$ is the midpoint of $CD$. $BI$ meets $AC$ at $M$. Show that the line $DM$ passes through the midpoint of $BC$. $E$ is a point outside the rectangle such that $AE = BE$ and $\angle AEB = 90^o$. If $BE = BC = x$, show that $EM$ bisects $\angle AMB$. Find the area of $AEBM$ in terms of $x$.

Let $f:\mathbb{R}^+\to \mathbb{R}^+$ be a function such that for all $x,y \in \mathbb{R}+,\, f(x)f(y)=f(xy)+f\left(\frac{x}{y}\right)$, where $\mathbb{R}^+$ represents the positive real numbers. Given that $f(2)=3$, compute the last two digits of $f\left(2^{2^{2020}}\right)$.

Fiona had a solid rectangular block of cheese that measured $6$ centimeters from left to right, $5$ centimeters from front to back, and $4$ centimeters from top to bottom. Fiona took a sharp knife and sliced off a $1$ centimeter thick slice from the left side of the block and a $1$ centimeter slice from the right side of the block. After that, she sliced off a $1$ centimeter thick slice from the front side of the remaining block and a $1$ centimeter slice from the back side of the remaining block. Finally, Fiona sliced off a $1$ centimeter slice from the top of the remaining block and a $1$ centimeter slice from the bottom of the remaining block. Fiona now has $7$ blocks of cheese. Find the total surface area of those seven blocks of cheese measured in square centimeters.

Prove that $(1 - x)^n + (1 + x)^n < 2^n$ for an integer $n \ge 2$ and $|x| < 1$.

A set of (unit) squares of a $n\times n$ table is called [i]convenient[/i] if each row and each column of the table contains at least two squares belonging to the set. For each $n\geq 5$ determine the maximum $m$ for which there exists a [i]convenient [/i] set made of $m$ squares, which becomes in[i]convenient [/i] when any of its squares is removed.

Let $d_1,d_2,\ldots,d_k$ be all factors of a positive integer $n$ including $1$ and $n$. If $d_1+d_2+\ldots+d_k=72$ then $\frac1{d_1}+\frac1{d_2}+\ldots+\frac1{d_k}$ is $\textbf{(A)}~\frac{k^2}{72}$ $\textbf{(B)}~\frac{72}k$ $\textbf{(C)}~\frac{72}n$ $\textbf{(D)}~\text{None of the above}$

Let $P(x)$ be a nonconstant complex coefficient polynomial and let $Q(x,y)=P(x)-P(y).$ Suppose that polynomial $Q(x,y)$ has exactly $k$ linear factors unproportional two by tow (without counting repetitons). Let $R(x,y)$ be factor of $Q(x,y)$ of degree strictly smaller than $k$. Prove that $R(x,y)$ is a product of linear polynomials. [b]Note: [/b] The [i]degree[/i] of nontrivial polynomial $\sum_{m}\sum_{n}c_{m,n}x^{m}y^{n}$ is the maximum of $m+n$ along all nonzero coefficients $c_{m,n}.$ Two polynomials are [i]proportional[/i] if one of them is the other times a complex constant. [i]Proposed by Navid Safaie[/i]

Suppose $\Delta$ is a fixed line and $F$ and $F'$ are two points with equal distance from $\Delta$ that are on two sides of $\Delta$. The circle $C$ is with center $P$ and radius $mPF$ where $m$ is a positive number not equal to $1$. The circle $C'$ is the circle that $PFF'$ is inscribed in it. a) What is the condition on $P$ such that $C$ and $C'$ intersect? b) If we denote the intersections of $C$ and $C'$ to be $M$ and $M'$ then what is the locus of $M$ and $M'$; c) Show that $C$ is always tangent to this locus.

Suppose that $f$ is a function such that $3f(x)- 5xf \left(\frac{1}{x}\right)= x - 7$ for all non-zero real numbers $x.$ Find $f(2010).$

For each positive integer $k$, define $r(k)$ as the number of runs of $k$ in base-$2$, where a run is a collection of consecutive $0$s or consecutive $1$s without a larger one containing it. For example, $(11100100)_2$ has $4$ runs, namely $111-00-1-00$. Also, $r(0) = 0$. Given a positive integer $n$, find all functions $f : \mathbb{Z} \rightarrow\mathbb{Z}$ such that \[\sum_{k=0}^{2^n-1} 2^{r(k)}f(k+(-1)^{k} x)=(-1)^{x+n}\text{ for all integer $x$.}\] [i]Proposed by YaWNeeT[/i]

Prove that a plane that passes: a) through the centers of two opposite edges of the tetrahedron and b) through the center of one of the other edges of the tetrahedron divides the tetrahedron into two parts of equal volumes. Will the thesis remain true if we reject assumption (b) ?

In many computer languages, the division operation ignores remainders. Let’s denote this operation by $//$, so for instance $13//3 = 4$. If, for some $b$, $a//b = c$, then we say that $c$ is a [i]near factor[/i] of $a$. Thus, the near factors of $13$ are $1$, $2$, $3$, $4$, and $6$. Let $a$ be a positive integer. Prove that every positive integer less than or equal to $\sqrt{a}$ is a near factor of $a$.

Point $P$ and equilateral triangle $ABC$ satisfy $|AP|=2$, $|BP|=3$. Maximize $|CP|$.

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ satisfying $f(x+y)\le f(x)+f(y)\le x+y$ for all $x,y\in\mathbb{R}$.

Let $ABCD$ be a convex quadrilateral with $\angle ABC = \angle ADC < 90^{\circ}$. The internal angle bisectors of $\angle ABC$ and $\angle ADC$ meet $AC$ at $E$ and $F$ respectively, and meet each other at point $P$. Let $M$ be the midpoint of $AC$ and let $\omega$ be the circumcircle of triangle $BPD$. Segments $BM$ and $DM$ intersect $\omega$ again at $X$ and $Y$ respectively. Denote by $Q$ the intersection point of lines $XE$ and $YF$. Prove that $PQ \perp AC$.

Two circles $C_1$ and $C_2$ intersect each other at points $A$ and $B$. Their external common tangent (closer to $B$) touches $C_1$ at $P$ and $C_2$ at $Q$. Let $C$ be the reflection of $B$ in line $PQ$. Prove that $\angle CAP=\angle BAQ$.

The inscribed circle of the triangle $ABC$ touches the sides $BC, CA, AB$ at points $A_1, B_1, C_1$ respectively. The points $P_b, Q_b, R_b$ are the points of the segments $BC_1, C_1A_1, A_1B$, respectively, such that $BP_bQ_bR_b$ is parallelogram. In the same way, the points $P_c, Q_c, R_c$ are the points of the sections $CB_1, B_1A_1, A_1C$, respectively such that $CP_cQ_cR_c$ is a parallelogram. The intersection of the lines $P_bR_b$ and $P_cR_c$ is $T$. Show that $TQ_b = TQ_c$.

There are written $n$ distinct positive integers. An operation is defined as follows: we chose two numers $a$ and $b$ written on the table; we erase them; we write at their places $a+1$ and $b-1$. Find the smallest value of the difference the biggest and the smallest written numbers after some operations.

Sabine rolls a fair $14$-sided die numbered $1$ to $14$ and gets a value of $x$. She then draws $x$ cards uniformly at random (without replacement) from a deck of $14$ cards, each of which labeled a different integer from $1$ to $14$. She finally sums up the value of her die roll and the value on each card she drew to get a score of $S$. Let $A$ be the set of all obtainable scores. Compute the probability that $S$ is greater than or equal to the median of $A$.

There are $120$ seats in a row. What is the fewest number of seats that must be occupied so the next person to be seated must sit next to someone? $ \text{(A)}\ 30\qquad\text{(B)}\ 40\qquad\text{(C)}\ 41\qquad\text{(D)}\ 60\qquad\text{(E)}\ 119 $

The positive integer $N$ is said[i] amiable [/i]if the set $\{1,2,\ldots,N\}$ can be partitioned into pairs of elements, each pair having the sum of its elements a perfect square. Prove there exist infinitely many amiable numbers which are themselves perfect squares. ([i]Dan Schwarz[/i])

John takes seven positive integers $a_1,a_2,...,a_7$ and writes the numbers $a_i a_j$, $a_i+a_j$ and $|a_i -a_j |$ for all $i \ne j$ on the blackboard. Find the greatest possible number of distinct odd integers on the blackboard.

Let $A$ be an $n\times n$ real matrix with minimal polynomial $x^n + x - 1$. Prove that the trace of $(nA^{n-1} + I)^{-1}A^{n-2}$ is zero.