If $x , y, z \in \mathbb{R}$ such that $x+y +z =4$ and $x^2 + y^2 +z^2 = 6$, then show that each of $x, y, z$ lies in the closed interval $\left[ \dfrac{2}{3} , 2 \right]$. Can $x$ attain the extreme value $\dfrac{2}{3}$ or $2$?

Is it true that for any permulation $a_1,a_2.....,a_{2002}$ of $1,2....,2002$ there are positive integers $m,n$ of the same parity such that $0<m<n<2003$ and $a_m+a_n=2a_{\frac {m+n}{2}}$

$L, L'$ are two skew lines in space and $p$ is a plane not containing either line. $M$ is a variable line parallel to $p$ which meets $L$ at $X$ and $L'$ at $Y$. Find the position of $M$ which minimises the distance $XY$. $L''$ is another fixed line. Find the line $M$ which is also perpendicular to $L''$ .

Suppose that for some $m,n\in\mathbb{N}$ we have $\varphi (5^m-1)=5^n-1$, where $\varphi$ denotes the Euler function. Show that $(m,n)>1$.

There are $n$ aborigines on an island. Any two of them are either friends or enemies. One day, the chieftain orders that all citizens (including himself) make and wear a necklace with zero or more stones so that: (i) given a pair of friends, there exists a color such that each has a stone of that color; (ii) given a pair of enemies,there does not exist a color such that each a stone of that color. (a) Prove that the aborigines can carry out the chieftain’s order. (b) What is the minimum number of colors of stones required for the aborigines to carry out the chieftain’s order?

Anna and Ben decided to visit Archipelago with $2009$ islands. Some pairs of islands are connected by boats which run both ways. Anna and Ben are playing during the trip: Anna chooses the first island on which they arrive by plane. Then Ben chooses the next island which they could visit. Thereafter, the two take turns choosing an island which they have not yet visited. When they arrive at an island which is connected only to islands they had already visited, whoever's turn to choose next would be the loser. Prove that Anna could always win, regardless of the way Ben played and regardless of the way the islands were connected. [i](12 points for Juniors and 10 points for Seniors)[/i]

Find all pairs of positive integers $(a,b)$ such that $$a!+b!=a^b + b^a.$$

Let $m$ be an positive odd integer not divisible by $3$. Prove that $\left[4^m -(2+\sqrt 2)^m\right]$ is divisible by $112.$

Inside the convex quadrilateral $ABCD$ lies the point $'M$. Reflect it symmetrically with respect to the midpoints of the sides of the quadrilateral and connect the obtained points so that they form a convex quadrilateral. Prove that the area of ​​this quadrilateral does not depend on the choice of the point $M$.

A coin is tossed $10$ times. Compute the probability that two heads will turn up in succession somewhere in the sequence of throws.

In two bowls there are in total ${N}$ balls, numbered from ${1}$ to ${N}$. One ball is moved from one of the bowls into the other. The average of the numbers in the bowls is increased in both of the bowls by the same amount, ${x}$. Determine the largest possible value of ${x}$.

An ant is on the bottom edge of a right circular cone with base area $\pi$ and slant length $6$. What is the shortest distance that the ant has to travel to loop around the cone and come back to its starting position?

Prove that if X is a compact $T_2$ space, and X has density d(X), then $X^3$ contains a discrete subspace of cardinality $d(X)$. note: $d(X)$ is the smallest cardinality of a dense subspace of X.

Let all the edges of tetrahedron \(A_1A_2A_3A_4\) be tangent to sphere \(S\). Let \(\displaystyle a_i\) denote the length of the tangent from \(A_i\) to \(S\). Prove that \[\bigg(\sum_{i=1}^4 \frac 1{a_i}\bigg)^{\!\!2}> 2\bigg(\sum_{i=1}^4 \frac1{a_i^2}\bigg). \] [i]Submitted by Viktor Vígh, Szeged[/i]

The numbers 1, 2, ... , 36 are written in the cells of a $6 \times 6$ grid. Two cells are called neighbors if they have a common side or vertex. A frog is located at the cell with the number 1 written on it. Every minute, if a neighboring cell has a bigger number than the cell where the frog is located, the frog jumps to the neighboring cell that has the biggest number written on it. The frog continues like this until there are no neighboring cells with a bigger number than the cell where the frog is located. What is the biggest possible number of jumps the frog can make?

In each cell of a matrix $ n\times n$ a number from a set $ \{1,2,\ldots,n^2\}$ is written --- in the first row numbers $ 1,2,\ldots,n$, in the second $ n\plus{}1,n\plus{}2,\ldots,2n$ and so on. Exactly $ n$ of them have been chosen, no two from the same row or the same column. Let us denote by $ a_i$ a number chosen from row number $ i$. Show that: \[ \frac{1^2}{a_1}\plus{}\frac{2^2}{a_2}\plus{}\ldots \plus{}\frac{n^2}{a_n}\geq \frac{n\plus{}2}{2}\minus{}\frac{1}{n^2\plus{}1}\]

A circle is tangent to sides $AD,\text{ }DC,\text{ }CB$ of a convex quadrilateral $ABCD$ at $\text{K},\text{ L},\text{ M}$ respectively. A line $l$, passing through $L$ and parallel to $AD$, meets $KM$ at $N$ and $KC$ at $P$. Prove that $PL=PN$.

Bill is buying cans of soup. Cans come in $2$ shapes. Can $A$ is a rectangular prism shaped can with dimensions $20\times16\times10$, and can $B$ is a cylinder shaped can with radius $10$ and height $10$. Let $\alpha$ be the volume of the larger can, and $\beta$ be the volume of the smaller can. What is $\alpha-\beta$?

Suppose that each of the vertices of $ABC$ is a lattice point in the $xy$-plane and that there is exactly one lattice point $P$ in the interior of the triangle. The line $AP$ is extended to meet $BC$ at $E$. Determine the largest possible value for the ratio of lengths of segments $$\frac{|AP|}{|PE|}.$$

Consider a triangle $ABC$ such that $\angle A = 90^o, \angle C =60^o$ and $|AC|= 6$. Three circles with centers $A, B$ and $C$ are pairwise tangent in points on the three sides of the triangle. Determine the area of the region enclosed by the three circles (the grey area in the figure). [asy] unitsize(0.2 cm); pair A, B, C; real[] r; A = (6,0); B = (6,6*sqrt(3)); C = (0,0); r[1] = 3*sqrt(3) - 3; r[2] = 3*sqrt(3) + 3; r[3] = 9 - 3*sqrt(3); fill(arc(A,r[1],180,90)--arc(B,r[2],270,240)--arc(C,r[3],60,0)--cycle, gray(0.7)); draw(A--B--C--cycle); draw(Circle(A,r[1])); draw(Circle(B,r[2])); draw(Circle(C,r[3])); dot("$A$", A, SE); dot("$B$", B, NE); dot("$C$", C, SW); [/asy]

Let $A C$ and $C E$ be perpendicular line segments, each of length $18 .$ Suppose $B$ and $D$ are the midpoints of $A C$ and $C E$ respectively. If $F$ be the point of intersection of $E B$ and $A D,$ then the area of $\triangle B D F$ is? [list=1] [*] $27\sqrt{2}$ [*] $18\sqrt{2}$ [*] 13.5 [*] 18 [/list]

Triangle $\vartriangle ABC$ has sidelengths $AB = 10$, $AC = 14$, and, $BC = 16$. Circle $\omega_1$ is tangent to rays $\overrightarrow{AB}$, $\overrightarrow{AC}$ and passes through $B$. Circle $\omega_2$ is tangent to rays $\overrightarrow{AB}$, $\overrightarrow{AC}$ and passes through $C$. Let $\omega_1$, $\omega_2$ intersect at points $X, Y$ . The square of the perimeter of triangle $\vartriangle AXY$ is equal to $\frac{a+b\sqrt{c}}{d}$ , where $a, b, c$, and, $d$ are positive integers such that $a$ and $d$ are relatively prime, and $c$ is not divisible by the square of any prime. Find $a + b + c + d$.

We consider the following game for one person. The aim of the player is to reach a fixed capital $C>2$. The player begins with capital $0<x_0<C$. In each turn let $x$ be the player’s current capital. Define $s(x)$ as follows: $$s(x):=\begin{cases}x&\text{if }x<1\\C-x&\text{if }C-x<1\\1&\text{otherwise.}\end{cases}$$Then a fair coin is tossed and the player’s capital either increases or decreases by $s(x)$, each with probability $\frac12$. Find the probability that in a finite number of turns the player wins by reaching the capital $C$.

Suppose $P(x)$ is a non-constant polynomial with real coefficients, and even degree. Bob writes the polynomial $P(x)$ on a board. At every step, if the polynomial on the board is $f(x)$, he can replace it with 1. $f(x)+c$ for a real number $c$, or 2. the polynomial $P(f(x))$. Can he always find a finite sequence of steps so the final polynomial on the board has exactly $2020$ real roots? What about $2021$? [i]~Sutanay Bhattacharya[/i]

Let $a$ be a positive integer and let $\{a_n\}$ be defined by $a_0 = 0$ and \[a_{n+1 }= (a_n + 1)a + (a + 1)a_n + 2 \sqrt{a(a + 1)a_n(a_n + 1)} \qquad (n = 1, 2 ,\dots ).\] Show that for each positive integer $n$, $a_n$ is a positive integer.