In a round-robin table tennis tournament between $2010$ athletes, where each match ends with a winner and a loser, let $a_1,... , a_{2010}$ denote the number of wins of each athlete, and let $b_1, .., b_{2010}$ denote the number of losses of each athlete. Show that $a^2_1+a^2_2+...+a^2_{2010} =b^2_1 + b^2_2 + ... + b^2_{2010}$.

Find all integers $n \ge 3$ with the following property: it is possible to assign pairwise different positive integers to the vertices of an $n$-gonal prism in such a way that vertices with labels $a$ and $b$ are connected by an edge if and only if $a | b$ or $b | a$. Poland

Assume integer $m \geq 2.$ There are $3m$ people in a meeting, any two of them either shake hands with each other once or not.We call the meeting "$n$-interesting", only if there exists $n(n\leq 3m-1)$ people of them, the time everyone of whom shakes hands with other $3m-1$ people is exactly $1,2,\cdots,n,$ respectively. If in any "$n$-interesting" meeting, there exists $3$ people of them who shake hands with each other, find the minimum value of $n.$

We consider the nonzero matrices $A_0, A_1, \ldots, A_n \in \mathcal{M}_2(\mathbb{R}),$ $n \ge 2,$ with the properties: $A_0 \neq aI_2$ for any $a \in \mathbb{R}$ and $A_0A_k=A_kA_0$ for $k= \overline{1,n}.$ Prove that a) $\det \left(\sum\limits_{k=1}^n A_k^2 \right) \ge 0$; b) If $\det \left(\sum\limits_{k=1}^n A_k^2 \right) = 0$ and $A_2 \ne aA_1$ for any $a \in \mathbb{R},$ then $\sum\limits_{k=1}^n A_k^2=O_2.$

You have a $9 \times 9$ board with white squares. A tile can be moved from one square to another neighbor (tiles that share one side). If we paint some squares of black, we say that such coloration is [i]good [/i] if there is a white square where we can place a chip that moving through white squares can return to the initial square having passed through at least $3$ boxes, without passing the same square twice. Find the highest possible value of $k$ such that any form of painting $k$ squares of black are a [i]good [/i] coloring.

Let $ABC$ be an isosceles triangle with $\angle{ABC} = \angle{ACB} = 80^\circ$. Let $D$ be a point on $AB$ such that $\angle{DCB} = 60^\circ$ and $E$ be a point on $AC$ such that $\angle{ABE} = 30^\circ$. Find $\angle{CDE}$ in degrees.

Tom's age is $ T$ years, which is also the sum of the ages of his three children. His age $ N$ years ago was twice the sum of their ages then. What is $ \frac {T}{N}$? $ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

In the figure shown, the small circles have radius $1$. Calculate the area of the gray part of the figure. [img]https://1.bp.blogspot.com/-oy-WirJ6u9o/XzcFc3roVDI/AAAAAAAAMX8/qxNy5I_0RWUOxl-ZE52fnrwo0v0T7If9QCLcBGAsYHQ/s0/1998%2BMohr%2Bp1.png[/img]

A car attempts to accelerate up a hill at an angle $\theta$ to the horizontal. The coefficient of static friction between the tires and the hill is $\mu > \tan \theta$. What is the maximum acceleration the car can achieve (in the direction upwards along the hill)? Neglect the rotational inertia of the wheels. (A) $g \tan \theta$ (B) $g(\mu \cos \theta - \sin \theta)$ (C) $g(\mu - \sin \theta)$ (D) $g \mu \cos \theta$ (E) $g(\mu \sin \theta - \cos \theta)$

Given a natural number $k$ and a real number $a (a>0)$, find the maximal value of $a^{k_1}+a^{k_2}+\cdots +a^{k_r}$, where $k_1+k_2+\cdots +k_r=k$ ($k_i\in \mathbb{N} ,1\le r \le k$).

Let $(a_n)_{n=1}^{\infty}$ be an integer sequence such that $a_{n+48} \equiv a_n \pmod {35}$ for every $n \geq 1$. Let $i$ and $j$ be the least numbers satisfying the conditions $a_{n+i} \equiv a_n \pmod {5}$ and $a_{n+j} \equiv a_n \pmod {7}$ for every $n\geq 1$. Which one below cannot be an $(i,j)$ pair? $ \textbf{(A)}\ (16,4) \qquad\textbf{(B)}\ (3,16) \qquad\textbf{(C)}\ (8,6) \qquad\textbf{(D)}\ (1,48) \qquad\textbf{(E)}\ (16,18) $

Let $a,b,c$ positive reals such that $a+b+c=3$. Show that following expression's minimum value is $2$. $$\frac{\sqrt a +\sqrt b +\sqrt c}{ab+bc+ca} + \frac{1}{1+2\sqrt {ab}} + \frac {1}{1+ 2\sqrt {bc}} + \frac{1}{1+ 2\sqrt {ca}}$$

Show that $x^4 + y^4 + z^2\ge xyz \sqrt8$ for all positive reals $x, y, z$.

(a) On each square of a squared sheet of paper of size $20 \times 20$ there is a soldier. Vanya chooses a number $d$ and Petya moves the soldiers to new squares in such a way that each soldier is moved through a distance of at least $d$ (the distance being measured between the centres of the initial and the new squares) and each square is occupied by exactly one soldier. For which $d$ is this possible? (Give the maximum possible $d$, prove that it is possible to move the soldiers through distances not less than $d$ and prove that there is no greater $d$ for which this procedure may be carried out.) (b) Answer the same question as (a), but with a sheet of size $21 \times 21$. (SS Krotov, Moscow)

The base $AD$ of a trapezoid $ABCD$ is twice greater than the base $BC$, and the angle $C$ equals one and a half of the angle $A$. The diagonal $AC$ divides angle $C$ into two angles. Which of them is greater?

In the Cartesian plane, let $G_1$ and $G_2$ be the graphs of the quadratic functions $f_1(x) = p_1x^2 + q_1x + r_1$ and $f_2(x) = p_2x^2 + q_2x + r_2$, where $p_1 > 0 > p_2$. The graphs $G_1$ and $G_2$ cross at distinct points $A$ and $B$. The four tangents to $G_1$ and $G_2$ at $A$ and $B$ form a convex quadrilateral which has an inscribed circle. Prove that the graphs $G_1$ and $G_2$ have the same axis of symmetry.