Let $ a, b, c, d$ be positive integers such that $ ab \equal{} cd$ and $ a\plus{}b \equal{} c \minus{} d.$ Prove that there exists a right-angled triangle the measure of whose sides (in some unit) are integers and whose area measure is $ ab$ square units.

Find all integers \(a,b,c\) such that \(a^{2}=bc+4\) and \(b^{2}=ca+4\).

Once in a restaurant [b][i]Dr. Strange[/i][/b] found out that there were 12 types of food items from 1 to 12 on the menu. He decided to visit the restaurant 12 days in a row and try a different food everyday. 1st day, he tries one of the items from the first two. On the 2nd day, he eats either item 3 or the item he didn’t tried on the 1st day. Similarly, on the 3rd day, he eats either item 4 or the item he didn’t tried on the 2nd day. If someday he's not able to choose items that way, he eats the item that remained uneaten from the menu. In how many ways can he eat the items for 12 days?

At $n$ distinct points of a circular race course there are $n$ cars ready to start. Each car moves at a constant speed and covers the circle in an hour. On hearing the initial signal, each of them selects a direction and starts moving immediately. If two cars meet, both of them change directions and go on without loss of speed. Show that at a certain moment each car will be at its starting point.

$ABCDA_{1}B_{1}C_{1}D_{1}$ is a cube with side length $4a$. Points $E$ and $F$ are taken on $(AA_{1})$ and $(BB_{1})$ such that $AE=B_{1}F=a$. $G$ and $H$ are midpoints of $(A_{1}B_{1})$ and $(C_{1}D_{1})$, respectively. Find the minimum value of the $CP+PQ$, where $P\in[GH]$ and $Q\in[EF]$.

There are $2$ runners on the perimeter of a regular hexagon, initially located at adjacent vertices. Every second, each of the runners independently moves either one vertex to the left, with probability $\frac{1}{2}$, or one vertex to the right, also with probability $\frac{1}{2}$. Find the probability that after a $2013$ second run (in which runners switch vertices $2013$ times each), the runners end up at adjacent vertices once again.

In a parallelogram $ABCD$ , $BD$ is the largest diagonal. By matching $B$ with $D$ by a bend, a regular pentagon is formed. Calculate the measures of the angles formed by the diagonal $BD$ with each of the sides of the parallelogram.

Suppose $x, y, a$ are real numbers such that $x+y = x^3 +y^3 = x^5 +y^5 = a$. Find all possible values of $a.$

Let $ABCD$ be a quadrilateral inscribed in circle $\omega$. Define $E = AA \cap CD$, $F = AA \cap BC$, $G = BE \cap \omega$, $H = BE \cap AD$, $I = DF \cap \omega$, and $J = DF \cap AB$. Prove that $GI$, $HJ$, and the $B$-symmedian are concurrent. [i]Proposed by Robin Park[/i]

A quadrilateral $ABCD$ is circumscribed about a circle $\omega$. The intersection point of $\omega$ and the diagonal $AC$, closest to $A$, is $E$. The point $F$ is diametrally opposite to the point $E$ on the circle $\omega$. The tangent to $\omega$ at the point $F$ intersects lines $AB$ and $BC$ in points $A_1$ and $C_1$, and lines $AD$ and $CD$ in points $A_2$ and $C_2$, respectively. Prove that $A_1C_1=A_2C_2$.

Let $ p$ be an odd prime number and $ a_1,a_2,...,a_p$ and $ b_1,b_2,...,b_p$ two arbitrary permutations of the numbers $ 1,2,...,p$ . Show that the least positive residues modulo $ p$ of the numbers $ a_1b_1, a_2b_2,...,a_pb_p$ never form a permutation of the numbers $ 1,2,...,p$.

Define a family of functions $S_k(n)$ for positive integers $n$ and $k$ by the following two rules: $$S_0(n) = 1,$$ $$S_k(n) = \sum_{d | n} dS_{k-1}(d).$$ Compute the remainder when $S_{30}(30)$ is divided by $1001$.

Let $f:\mathbb{R}^+_0 \rightarrow \mathbb{R}^+_0$ be a strictly decreasing function. (a) Be $a_n$ a sequence of strictly positive reals so that $\forall k \in \mathbb{N}_0:k\cdot f(a_k)\geq (k+1)\cdot f(a_{k+1})$ Prove that $a_n$ is ascending, that $\displaystyle\lim_{k\rightarrow +\infty} f(a_k)$ = 0and that $\displaystyle\lim_{k\rightarrow +\infty} a_k =+\infty$ (b) Prove that there exist such a sequence ($a_n$) in $\mathbb{R}^+_0$ if you know $\displaystyle\lim_{x\rightarrow +\infty} f(x)=0$.

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]