Determine all solutions in real numbers $x,y,z,w$ of the system $$x+y+z=w, \frac{1}{x}+\frac{1}{y}+\frac{1}{z}=\frac{1}{w}.$$

Let $ a$, $ b$, $ c$, $ d$ be positive real numbers such that $ abcd \equal{} 1$ and $ a \plus{} b \plus{} c \plus{} d > \dfrac{a}{b} \plus{} \dfrac{b}{c} \plus{} \dfrac{c}{d} \plus{} \dfrac{d}{a}$. Prove that \[ a \plus{} b \plus{} c \plus{} d < \dfrac{b}{a} \plus{} \dfrac{c}{b} \plus{} \dfrac{d}{c} \plus{} \dfrac{a}{d}\] [i]Proposed by Pavel Novotný, Slovakia[/i]

Find all functions $ f : Z\rightarrow Z$ for which we have $ f (0) \equal{} 1$ and $ f ( f (n)) \equal{} f ( f (n\plus{}2)\plus{}2) \equal{} n$, for every natural number $ n$.

There are $n$ MOPpers $p_1,...,p_n$ designing a carpool system to attend their morning class. Each $p_i$'s car fits $\chi (p_i)$ people ($\chi : \{p_1,...,p_n\} \to \{1,2,...,n\}$). A $c$-fair carpool system is an assignment of one or more drivers on each of several days, such that each MOPper drives $c$ times, and all cars are full on each day. (More precisely, it is a sequence of sets $(S_1, ...,S_m)$ such that $|\{k: p_i\in S_k\}|=c$ and $\sum_{x\in S_j} \chi(x) = n$ for all $i,j$. ) Suppose it turns out that a $2$-fair carpool system is possible but not a $1$-fair carpool system. Must $n$ be even? [i]Proposed by Nathan Ramesh and Palmer Mebane

The board has a natural number greater than $1$. At each step, Igor writes the number $n +\frac{n}{p}$ instead of the number $n$ on the board , where $p$ is some prime divisor of $n$. Prove that if Igor continues to rewrite the number infinite times, then he will choose infinitely times the number $3$ as a prime divisor of $p$. [hide=original wording]На доске записано какое-то натуральное число, большее 1. На каждом шагу Игорь переписывает имеющееся на доске число n на число n +n/p, где p - это какой-нибудь простой делитель числа n. Доказать, что если Игорь будет продолжать переписывать число бесконечно долго, то он бесконечно много раз выберет в качестве простого делителя p число 3.[/hide]

Consider all $6$-digit numbers of the form $abccba$ where $b$ is odd. Determine the number of all such $6$-digit numbers that are divisible by $7$.

Let $\omega_1$ and $\omega_2$ be two circles with centers $O_1$ and $O_2$. The two circles intersect at $A$ and $B$. $\ell$ is the circles' common external tangent that is closer to $B$, and it meets $\omega_1$ at $T_1$ and $\omega_2$ at $T_2$. Let $C$ be the point on line $AB$ not equal to $A$ that is the same distance from $\ell$ as $A$ is. Given that $O_1O_2=15$, $AT_1=5$ and $AT_2=12$, find $AC^2+{T_1T_2}^2$. [i]Proposed by Zachary Perry[/i]

Let $ \mathbb{R} ^{+} $ denote the set of all positive real numbers. Find all functions $ \mathbb{R} ^{+} \to \mathbb{R} ^{+} $ such that \[ f(x+f(y)) = yf(xy+1)\] holds for all $ x, y \in \mathbb{R} ^{+} $.

Prove that there is no set of integers $m, n, p$ except $0, 0, 0$ for which \[m + n \sqrt2 + p \sqrt3 = 0.\]

The Rational Unit Jumping Frog starts at $(0, 0)$ on the Cartesian plane, and each minute jumps a distance of exactly $1$ unit to a point with rational coordinates. (a) Show that it is possible for the frog to reach the point $\left(\frac15,\frac{1}{17}\right)$ in a finite amount of time. (b) Show that the frog can never reach the point $\left(0,\frac14\right)$.

$1600$ bananas are distributed among $100$ monkeys (it is possible that some monkeys do not receive bananas). Prvove that at least four monkeys receive the same amount of bananas.

Let $\mathcal{H}$ be the region of points $(x, y)$, such that $(1, 0), (x, y), (-x, y)$, and $(-1,0)$ form an isosceles trapezoid whose legs are shorter than the base between $(x, y)$ and $(-x,y)$. Find the least possible positive slope that a line could have without intersecting $\mathcal{H}$.

Determine the polynomials P of two variables so that: [b]a.)[/b] for any real numbers $t,x,y$ we have $P(tx,ty) = t^n P(x,y)$ where $n$ is a positive integer, the same for all $t,x,y;$ [b]b.)[/b] for any real numbers $a,b,c$ we have $P(a + b,c) + P(b + c,a) + P(c + a,b) = 0;$ [b]c.)[/b] $P(1,0) =1.$

Let $X$ and $Y$ be two finite subsets of the half-open interval $[0, 1)$ such that $0 \in X \cap Y$ and $x + y = 1$ for no $x \in X$ and no $y \in Y$. Prove that the set $\{x + y - \lfloor x + y \rfloor : x \in X \textrm{ and } y \in Y\}$ has at least $|X| + |Y| - 1$ elements. [i]***[/i]

Let $S$ be a circle, and $\alpha =\{A_1,\ldots ,A_n\}$ a family of open arcs in $S$. Let $N(\alpha )=n$ denote the number of elements in $\alpha$. We say that $\alpha$ is a covering of $S$ if $\bigcup_{k=1}^n A_k\supset S$. Let $\alpha=\{A_1,\ldots ,A_n\}$ and $\beta =\{B_1,\ldots ,B_m\}$ be two coverings of $S$. Show that we can choose from the family of all sets $A_i\cap B_j,\ i=1,2,\ldots ,n,\ j=1, 2,\ldots ,m,$ a covering $\gamma$ of $S$ such that $N(\gamma )\le N(\alpha)+N(\beta)$.

A square has sides of length $2$. Set $S$ is the set of all line segments that have length $2$ and whose endpoints are on adjacent sides of the square. The midpoints of the line segments in set $S$ enclose a region whose area to the nearest hundredth is $k$. Find $100k$.

Let $\text{lcm} (a,b)$ denote the least common multiple of $a$ and $b$. Find the sum of all positive integers $x$ such that $x\le 100$ and $\text{lcm}(16,x) = 16x$. [i]Ray Li.[/i]

Players $A$ and $B$ play the following game: $A$ tosses a coin $n$ times, and $B$ does $n+1$ times. The player who obtains more ”heads” wins; or in the case of equal balances, $A$ is assigned victory. Find the values of $n$ for which this game is fair (i.e. both players have equal chances for victory).

Let $ I $ be the center of the incircle of a triangle $ ABC. $ Shw that, if for any point $ M $ on the segment $ AB $ (extremities excluded) there exist two points $ N,P $ on $ BC, $ respectively, $ AC $ (both excluding the extremities) such that the center of mass of $ MNP $ coincides with $ I, $ then $ ABC $ is equilateral.

Find the first integer $n > 1$ such that the average of $1^2 , 2^2 ,\cdots, n^2$ is itself a perfect square.

Let square $ABCD$ and circle $\Omega$ be on the same plane, and $AA'$, $BB'$, $CC'$, $DD'$ be tangents to $\Omega$. Let $WXY Z$ be a convex quadrilateral with side lengths $WX = AA'$, $XY = BB'$, $Y Z = CC'$, and $ZW = DD'$. If $WXY Z$ has an inscribed circle, prove that the diagonals $WY$ and $XZ$ are perpendicular to each other.

In the triangle $ABC$, $\angle C$ is obtuse and $D$ is a fixed point on the side $BC$, different from $B$ and $C$. For any point $M$ on the side $BC$, different from $D$, the ray $AM$ intersects the circumcircle $S$ of $ABC$ at $N$. The circle through $M, D$ and $N$ meets $S$ again at $P$, different from $N$. Find the location of the point $M$ which minimises $MP$.

The three positive integers $a, b, c$ satisfy the equalities $gcd(ab, c^2) = 20$, $gcd(ac, b^2) = 18$, and $gcd(bc, a^2) = 75$. Compute the minimum possible value of $a + b + c$.

Find the integer closest to \[\frac{1}{\sqrt[4]{5^4+1}-\sqrt[4]{5^4-1}}\]

Let $ABC$ be an acute triangle with circumcircle $\Omega$ and orthocenter $H$. Points $D$ and $E$ lie on segments $AB$ and $AC$ respectively, such that $AD = AE$. The lines through $B$ and $C$ parallel to $\overline{DE}$ intersect $\Omega$ again at $P$ and $Q$, respectively. Denote by $\omega$ the circumcircle of $\triangle ADE$. [list=a] [*] Show that lines $PE$ and $QD$ meet on $\omega$. [*] Prove that if $\omega$ passes through $H$, then lines $PD$ and $QE$ meet on $\omega$ as well. [/list] [i]Merlijn Staps[/i]