Integers $x_1,x_2,\cdots,x_{100}$ satisfy \[ \frac {1}{\sqrt{x_1}} + \frac {1}{\sqrt{x_2}} + \cdots + \frac {1}{\sqrt{x_{100}}} = 20. \]Find $ \displaystyle\prod_{i \ne j} \left( x_i - x_j \right) $.

The sequence of polynomials $\left( P_{n}(X)\right)_{n\in Z_{>0}}$ is defined as follows: $P_{1}(X)=2X$ $P_{2}(X)=2(X^2+1)$ $P_{n+2}(X)=2X\cdot P_{n+1}(X)-(X^2-1)P_{n}(X)$, for all positive integers $n$. Find all $n$ for which $X^2+1\mid P_{n}(X)$

Let $A$ be a vertex of a regular star-shaped pentagon, the angle at $A$ being less than $180^o$ and the broken line $AA_1BB_1CC_1DD_1EE_1$ being its contour. Lines $AB$ and $DE$ meet at $F$. Prove that polygon $ABB_1CC_1DED_1$ has the same area as the quadrilateral $AD_1EF$. Note: A regular star pentagon is a figure formed along the diagonals of a regular pentagon.

In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.

A tetrahedron $ABCD$ with acute-angled faces is inscribed in a sphere with center $O$. A line passing through $O$ perpendicular to plane $ABC$ crosses the sphere at point $D'$ that lies on the opposide side of plane $ABC$ than point $D$. Line $DD'$ crosses plane $ABC$ in point $P$ that lies inside the triangle $ABC$. Prove, that if $\angle APB=2\angle ACB$, then $\angle ADD'=\angle BDD'$.

$5000$ movie fans gathered at a convention. Each participant had watched at least one movie. The participants should be split into discussion groups of two kinds. In each group of the first kind, the members would discuss a movie they all watched. In each group of the second kind, each member would tell about the movie that no one else in this group had watched. Prove that the chairman can always split the participants into exactly 100 groups. (A group consisting of one person is allowed; in this case this person submits a report).

In $\triangle ABC$, $AB=17$, $AC=25$, and $BC=28$. Points $M$ and $N$ are the midpoints of $\overline{AB}$ and $\overline{AC}$ respectively, and $P$ is a point on $\overline{BC}$. Let $Q$ be the second intersection point of the circumcircles of $\triangle BMP$ and $\triangle CNP$. It is known that as $P$ moves along $\overline{BC}$, line $PQ$ passes through some fixed point $X$. Compute the sum of the squares of the distances from $X$ to each of $A$, $B$, and $C$.

A classroom has $30$ seats arranged into $5$ rows of $6$ seats. Thirty students of distinct heights come to class every day, each sitting in a random seat. The teacher stands in front of all the rows, and if any student seated in front of you (in the same column) is taller than you, then the teacher cannot notice that you are playing games on your phone. What is the expected number of students who can safely play games on their phone?

The teacher reported to Peter an odd integer $m \le 2013$ and gave the guy a homework. Petrick should star the cells in the $2013 \times 2013$ table so to make the condition true: if there is an asterisk in some cell in the table, then or in row or column containing this cell should be no more than $m$ stars (including this one). Thus in each cell of the table the guy can put at most one star. The teacher promised Peter that his assessment would be just the number of stars that the guy will be able to place. What is the greatest number will the stars be able to place in the table Petrick?

In a triangle $ABC$, the median $AD$ (with $D$ on $BC$) and the angle bisector $BE$ (with $E$ on $AC$) are perpedicular to each other. If $AD = 7$ and $BE = 9$, find the integer nearest to the area of triangle $ABC$.

Find the smallest positive integer $n$ for which the expansion of $(xy - 3x +7y - 21)^n,$ after like terms have been collected, has at least 1996 terms.

How many rectangles are there in the diagram below such that the sum of the numbers within the rectangle is a multiple of 7? [asy] int n; n=0; for (int i=0; i<=7;++i) { draw((i,0)--(i,7)); draw((0,i)--(7,i)); for (int a=0; a<=7;++a) { if ((a != 7)&&(i != 7)) { n=n+1; label((string) n,(a,i),(1.5,2)); } } } [/asy]

Let $x_1,x_2,\dots,x_n$ be positive numbers with product equal to 1. Prove that there exists a $k\in\{1,2,\dots,n\}$ such that \[\frac{x_k}{k+x_1+x_2+\cdots+x_k}\ge 1-\frac{1}{\sqrt[n]{2}}.\]

Let $\xi_{(k_1, k_2)}, k_1, k_2 \in\mathbb N$ be random variables uniformly bounded. Let $c_l, l\in\mathbb N$ be a positive real strictly increasing infinite sequence such that $c_{l+1}/ c_l$ is bounded. Let $d_l=\log \left(c_{l+1}/c_l\right), l\in\mathbb N$ and suppose that $D_n=\sum_{l=1}^n d_l\uparrow \infty$ when $n\to\infty$ Suppose there exist $C>0$ and $\varepsilon>0$ such that $$\left| \mathbb E \left\{ \xi_{(k_1,k_2)}\xi_{(l_1,l_2)}\right\}\right| \leq C\prod_{i=1}^2 \left\{ \log_+\log_+\left( \frac{c_{\max\{ k_i, l_i\}}}{c_{\min\{ k_i, l_i\}}}\right)\right\}^{-(1+\varepsilon)}$$ for each $(k_1, k_2), (l_1,l_2)\in\mathbb N^2$ ($\log_+$ is the positive part of the natural logarithm). Show that $$\lim_{\substack{n_1\to\infty \\ n_2\to\infty}} \frac{1}{D_{n_1}D_{n_2}}\sum_{k_1=1}^{n_1} \sum_{k_2=1}^{n_2} d_{k_1}d_{k_2}\xi_{(k_1,k_2)}=0$$ almost surely. (translated by j___d)

[list] [*] A test was conducted in class. It is known that at least $\frac{2}{3}$ of the problems were hard. Each such problems were not solved by at least $\frac{2}{3}$ of the students. It is also known that at least $\frac{2}{3}$ of the students passed the test. Each such student solved at least $\frac{2}{3}$ of the suggested problems. Is this possible? [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{3}{4}$. [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{7}{10}$.[/list]

Consider five spheres with radius $10$ cm . Four of these spheres are arranged on a horizontal table so that its centers form a $20$ cm square and the fifth sphere is placed on them so that it touches the other four. What is the distance between center of this fifth sphere and the table?

The vertices and the circumcenter of an isosceles triangle lie on four different sides of a square. Find the angles of this triangle. (I. Bogdanov, B. Frenkin)

There are $2003$ coins distributed in several bags. The bags are then distributed in several pockets. It is known that the total number of bags is greater than the number of coins in each of the pockets. Is it true that the total number of pockets is greater than the number of coins in some of the bags?

Let $M = \{(a,b,c,d)|a,b,c,d \in \{1,2,3,4\} \text{ and } abcd > 1\}$. For each $n\in \{1,2,\dots, 254\}$, the sequence $(a_1, b_1, c_1, d_1)$, $(a_2, b_2, c_2, d_2)$, $\dots$, $(a_{255}, b_{255},c_{255},d_{255})$ contains each element of $M$ exactly once and the equality \[|a_{n+1} - a_n|+|b_{n+1} - b_n|+|c_{n+1} - c_n|+|d_{n+1} - d_n| = 1\] holds. If $c_1 = d_1 = 1$, find all possible values of the pair $(a_1,b_1)$.

The cost of producing each item is inversely proportional to the square root of the number of items produced. The cost of producing ten items is $ \$2100$. If items sell for $ \$30$ each, how many items need to be sold so that the producers break even?

The captain distributed $4000$ gold coins among $40$ pirates. A group of $5$ pirates is called poor if those $5$ pirates received, together, $500$ coins or less. The captain made the distribution so that there were the minimum possible number of poor groups of $5$ pirates. Determine how many poor $5$ pirate groups there are. Clarification: Two groups of $5$ pirates are considered different if there is at least one pirate in one of them who is not in the other.

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

Given four numbers $x, y, z, t$, let $(a, b, c, d)$ be a permutation of $(x, y, z, t)$ and set $x_1 =|a- b|$, $y_1 = |b-c|$, $z_1 = |c-d|$, and $t_1 = |d -a|$. From $x_1, y_1, z_1, t_1$, form in the same fashion the numbers $x_2, y_2, z_2, t_2$, and so on. It is known that $x_n = x, y_n = y, z_n = z, t_n = t$ for some $n$. Find all possible values of $(x, y, z, t)$.

Is it possible to put distinct positive integers less than $1991$ in the cells of a $9\times 9$ table so that the products of all the numbers in every column and every row are equal to each other? (N.B. Vasiliev, Moscow)

Let $a, b, c, d$ be distinct non-zero real numbers satisfying the following two conditions: $ac = bd$ and $\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}= 4$. Determine the largest possible value of the expression $\frac{a}{c}+\frac{c}{a}+\frac{b}{d}+\frac{d}{b}$.