One-round chess tournament involves $ 10 $ players from two countries. For a victory, one point is given, for a draw - half a point, for defeat - zero. All players scored a different number of points. Prove that one of the chess players scored in meetings with his countrymen less points, than meeting with players from another country.

Let $x, y, z$ be three positive numbers such that $(x + y-z) \left( \frac{1}{x}+ \frac{1}{y}- \frac{1}{z} \right)=4$. Find the minimal value of the expression $$E(x, y, z) = (x^4 + y^4 + z^4) \left( \frac{1}{x^4}+ \frac{1}{y^4}+ \frac{1}{z^4} \right) .$$

Let $a, b, c$ be positive integers whose greatest common divisor is $1$. Determine whether there always exists a positive integer $n$ such that, for every positive integer $k$, the number $2^n$ is not a divisor of $a^k+b^k+c^k$.

Let $ p\ge 2 $ be a fixed natural number, and let the sequence of functions $ \left( f_n\right)_{n\ge 2}:[0,1]\longrightarrow\mathbb{R} $ defined as $ f_n (x)=f_{n-1}\left( f_1 (x)\right) , $ where $ f_1 (x)=\sqrt[p]{1-x^p} . $ Find $ a\in (0,1) $ such that: [b]a)[/b] exists $ b\ge a $ so that $ f_1:[a,b]\longrightarrow [a,b] $ is bijective. [b]b)[/b] $ \forall x\in [0,1]\quad\exists y\in [0,1]\quad m\in\mathbb{N}\implies \left| f_m(x)-f_m(y)\right| >a|x-y| $

Let \(n\) be a positive integer and consider an \(n\times n\) square grid. For \(1\le k\le n\), a [i]python[/i] of length \(k\) is a snake that occupies \(k\) consecutive cells in a single row, and no other cells. Similarly, an [i]anaconda[/i] of length \(k\) is a snake that occupies \(k\) consecutive cells in a single column, and no other cells. The grid contains at least one python or anaconda, and it satisfies the following properties: [list] [*]No cell is occupied by multiple snakes. [*]If a cell in the grid is immediately to the left or immediately to the right of a python, then that cell must be occupied by an anaconda. [*]If a cell in the grid is immediately to above or immediately below an anaconda, then that cell must be occupied by a python. [/list] Prove that the sum of the squares of the lengths of the snakes is at least \(n^2\). [i]Proposed by Linus Tang[/i]

$a)$ Prove that there exists $5$ nonnegative real numbers with sum equal to $1$, such that no matter how we arrange them on circle, two neighboring numbers exist with product not less than $\frac{1}{9}$ $a)$ Prove that for every $5$ nonnegative real numbers with sum equal to $1$, we can arrange them on circle, such that product of every two neighboring numbers is not greater than $\frac{1}{9}$

Prove that there is a set $ A $ consisting of $2002$ different natural numbers satisfying the condition: for each $ a \in A $, the product of all numbers from $ A $, except $ a $, when divided by $ a $ gives the remainder $1$.

Suppose that $ a$, $ b$, and $ c$ are positive real numbers such that $ a^{\log_3 7} \equal{} 27$, $ b^{\log_7 11} \equal{} 49$, and $ c^{\log_{11} 25} \equal{} \sqrt {11}$. Find \[ a^{(\log_3 7)^2} \plus{} b^{(\log_7 11)^2} \plus{} c^{(\log_{11} 25)^2}. \]

Are there different mutually prime natural numbers $a$, $b$ and $c$, greater than $1$, such that $2a + 1$ is divisible by $b$, $2b + 1$ is divisible by $c$ and $2c + 1$ is divisible by $a$?

Let triangle $ABC$ have side lengths $AB=16, BC=20, AC=26.$ Let $ACDE, ABFG,$ and $BCHI$ be squares that are entirely outside of triangle $ABC$. Let $J$ be the midpoint of $EH$, $K$ be the midpoint of $DG$, and $L$ be the midpoint of $AC$. Find the area of triangle $JKL$.

The following process is applied to each positive integer: the sum of its digits is subtracted from the number, and the result is divided by $9$. For example, the result of the process applied to $938$ is $102$, since $\frac{938-(9 + 3 + 8)}{9} = 102.$ Applying the process twice to $938$ the result is $11$, applied three times the result is $1$, and applying it four times the result is $0$. When the process is applied one or more times to an integer $n$, the result is eventually $0$. The number obtained before obtaining $0$ is called the [i]house[/i] of $n$. How many integers less than $26000$ share the same [i]house[/i] as $2012$?

$(MON 1)$ Find the number of five-digit numbers with the following properties: there are two pairs of digits such that digits from each pair are equal and are next to each other, digits from different pairs are different, and the remaining digit (which does not belong to any of the pairs) is different from the other digits.

For the real pairs $(x,y)$ satisfying the equation $x^2 + y^2 + 2x - 6y = 6$, which of the following cannot be equal to $(x-1)^2 + (y-2)^2$? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 16 \qquad\textbf{(D)}\ 23 \qquad\textbf{(E)}\ 30 $

$x_{1},...,x_{n}$ are positive reals such that their sum and their squares' sum are equal to $t$. Prove that $\sum_{i\neq{j}}\frac{x_{i}}{x_{j}}\ge\frac{(n-1)^{2}\cdot{t}}{t-1}$

In tetrahedron $SABC$, $\angle ASB=\frac{\pi}{2}, \angle ASC=\alpha(0<\alpha<\frac{\pi}{2}), \angle BSC=\beta(0<\beta<\frac{\pi}{2})$. Let $\theta=A-SC-B$, prove that $\theta=-\arccos(\cot\alpha\cdot\cot\beta)$.

A person starting with $64$ cents and making $6$ bets, wins three times and loses three times, the wins and losses occurring in random order. The chance for a win is equal to the chance for a loss. If each wager is for half the money remaining at the time of the bet, then the final result is: $\textbf{(A)}\ \text{a loss of } 27 \qquad \textbf{(B)}\ \text{a gain of }27 \qquad \textbf{(C)}\ \text{a loss of }37 \qquad$ $ \textbf{(D)}\ \text{neither a gain nor a loss} \qquad \textbf{(E)}\ \text{a gain or a loss depending upon the order in which the wins and losses occur}$ Note: Due to the lack of $\LaTeX$ packages, the numbers in the answer choices are in cents ¢

For a group of 5 girls, denoted as $G_1,G_2,G_3,G_4,G_5$ and $12$ boys. There are $17$ chairs arranged in a row. The students have been grouped to sit in the seats such that the following conditions are simultaneously met: (a) Each chair has a proper seat. (b) The order, from left to right, of the girls seating is $G_1; G_2; G_3; G_4; G_5.$ (c) Between $G_1$ and $G_2$ there are at least three boys. (d) Between $G_4$ and $G_5$ there are at least one boy and most four boys. How many such arrangements are possible?