$n$ teams participated in a basketball tournament. Each team has played with each team exactly one game. There was no tie. If in the end of the tournament the $i$-th team has $x_{i}$ wins and $y_{i}$ loses $(1\leq i \leq n)$ prove that: $\sum_{i=1}^{n} {x_{i}}^2=\sum_{i=1}^{n} {y_{i}}^2$

Consider a set of $n$ points in plane. Prove that the number of isosceles triangles having their vertices among these $n$ points is $\mathcal O (n^{\frac{7}{3}})$. Find a configuration of $n$ points in plane such that the number of equilateral triangles with vertices among these $n$ points is $\Omega (n^2)$.

Find all polinomials $ P(x)$ with real coefficients, such that $ P(\sqrt {3}(a \minus{} b)) \plus{} P(\sqrt {3}(b \minus{} c)) \plus{} P(\sqrt {3}(c \minus{} a)) \equal{} P(2a \minus{} b \minus{} c) \plus{} P( \minus{} a \plus{} 2b \minus{} c) \plus{} P( \minus{} a \minus{} b \plus{} 2c)$ for any $ a$,$ b$ and $ c$ real numbers

Let $a_k$ be positive numbers such that $a_1 \geq 1$ and $a_{k+1} -a_k \geq 1 \ (k = 1, 2, . . . )$. Prove that for every $n \in \mathbb N,$ \[\sum_{k=1}^{1987}\frac{1}{a_{k+1} \sqrt[1987]{a_k}} <1987\]

Is there a triangle with $12 \, cm^2$ area and $12$ cm perimeter?

Consider a circle centered at $O$ with radius $r$ and a line $\ell$ not passing through $O$. A grasshopper is jumping to and fro between the points of the circle and the line, the length of each jump being $r$. Prove that there are at most $8$ points for the grasshopper to reach.

An equilateral triangle with side length 2023 has area $A$ and a regular hexagon with side length 289 has area $B$. If $\frac{A}{B}$ can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime, find $m+n$. [i]Proposed by Andy Xu[/i]

The Alpine Club organizes four mountain trips for its $n$ members. Let $E_1, E_2, E_3, E_4$ be the teams participating in these trips. In how many ways can these teams be formed so as to satisfy $E_1 \cap E_2 \ne\varnothing$, $E_2 \cap E_3 \ne\varnothing$ , $E_3 \cap E_4 \ne\varnothing$ ?

Find all polynomials $P$ with integer coefficients such that $P (0)\ne 0$ and $$P^n(m)\cdot P^m(n)$$ is a square of an integer for all nonnegative integers $n, m$. [i]Remark:[/i] For a nonnegative integer $k$ and an integer $n$, $P^k(n)$ is defined as follows: $P^k(n) = n$ if $k = 0$ and $P^k(n)=P(P(^{k-1}(n))$ if $k >0$. Proposed by Adrian Beker.

(1) 2009 Kansai University entrance exam Calculate $ \int \frac{e^{\minus{}2x}}{1\plus{}e^{\minus{}x}}\ dx$. (2) 2009 Rikkyo University entrance exam/Science Evaluate $ \int_0^ 1 \frac{2x^3}{1\plus{}x^2}\ dx$.

Let $ d$ be a line and points $ M,N$ on the $ d$. Circles $ \alpha,\beta,\gamma,\delta$ with centers $ A,B,C,D$ are tangent to $ d$, circles $ \alpha,\beta$ are externally tangent at $ M$, and circles $ \gamma,\delta$ are externally tangent at $ N$. Points $ A,C$ are situated in the same half-plane, determined by $ d$. Prove that if exists an circle, which is tangent to the circles $ \alpha,\beta,\gamma,\delta$ and contains them in its interior, then lines $ AC,BD,MN$ are concurrent or parallel.

The cells of the $9 \times 9$ table are colored black and white. It turned out, that there were $k$ rows, in each of which there are more black cells than white ones white, and there were $k$ columns, each of which contained more than black. At what highest $ k$ is this possible?

In acute-angled triangle $ABC$, let $H$ be the foot of perpendicular from $A$ to $BC$ and also suppose that $J$ and $I$ are excenters oposite to the side $AH$ in triangles $ABH$ and $ACH$. If $P$ is the point that incircle touches $BC$, prove that $I,J,P,H$ are concyclic.

Let $a,b,c$ be three different positive integers. Show that the sequence \[a+b+c,ab+bc+ca,3abc\] could be neither an arithmetic nor geometric progression. [i]Fajar Yuliawan, Bandung[/i]

Solve in set of integers the following equation $x^5+y^5+z^5+t^5=93$.

Two mathematicians, Kelly and Jason, play a cooperative game. The computer selects some secret positive integer $ n < 60$ (both Kelly and Jason know that $ n < 60$, but that they don't know what the value of $ n$ is). The computer tells Kelly the unit digit of $ n$, and it tells Jason the number of divisors of $ n$. Then, Kelly and Jason have the following dialogue: Kelly: I don't know what $ n$ is, and I'm sure that you don't know either. However, I know that $ n$ is divisible by at least two different primes. Jason: Oh, then I know what the value of $ n$ is. Kelly: Now I also know what $ n$ is. Assuming that both Kelly and Jason speak truthfully and to the best of their knowledge, what are all the possible values of $ n$?

Let $ABC$ be a triangle, ($BC < AB$). The line $l$ passing trough the vertices $C$ and orthogonal to the angle bisector $BE$ of $\angle B$, meets $BE$ and the median $BD$ of the side $AC$ at points $F$ and $G$, respectively. Prove that segment $DF$ bisects the segment $EG$.