Anya, Borya, and Vasya listed words that could be formed from a given set of letters. They each listed a different number of words : Anya listed the most, Vasya the least . They were awarded points as follows. Each word listed by only one of them scored $2$ points for this child. Each word listed by two of them scored $1$ point for each of these two children. Words listed by all three of them scored $0$ points. Is it possible that Vasya got the highest score, and Anya the lowest? (A Shapovalov)

In a contest, there are $m$ candidates and $n$ judges, where $n\geq 3$ is an odd integer. Each candidate is evaluated by each judge as either pass or fail. Suppose that each pair of judges agrees on at most $k$ candidates. Prove that \[{\frac{k}{m}} \geq {\frac{n-1}{2n}}. \]

You are given a convex pentagon $ABCDE$ with $AB=BC$, $CD=DE$, $\angle{ABC}=150^\circ$, $\angle{BCD} = 165^\circ$, $\angle{CDE}=30^\circ$, $BD=6$. Find the area of this pentagon. Round your answer to the nearest integer if necessary. [asy] pathpen = rgb(0,0,0.6)+linewidth(0.7); pointpen = black+linewidth(3); pointfontpen = fontsize(10); pair A = (0,0), B = (0.8,-1.8), C = B+rotate(-150)*(A-B), D = IP(CR(B,6), C--C+rotate(-165)*6*(B-C)), E = D+rotate(-30)*(C-D); D(D("B",B,W)--D("C",C,SW)--D("D",D,plain.E)--D("E",E,NE)--D("A",A,NW)--B--D); [/asy]

Solve for $x$: $x = 2 + \frac{4(2^6)}{11-3}$

Determine all solutions of the linear system of equations \begin{align*} &x_1& &-x_2& &-x_3& &-\cdots& &-x_n& &= 2a, \\ -&x_1& &+3x_2& &-x_3& &-\cdots& &-x_n& &= 4a, \\ -&x_1& &-x_2& &+7x_3& &-\cdots& &-x_n& &= 8a, \\ &&&&&&&&&&&\vdots \\ -&x_1& &-x_2& &-x_3& &-\cdots& &+\left(2^n-1\right)x_n& &= 2^na, \end{align*} with unknowns $x_1,\ldots,x_n$ and a real parameter $a.$

For all positive integers $n$, prove that there are integers $x, y$ relatively prime to $5$ such that $x^2 + y^2 = 5^n$.

In an acute-angled and not isosceles triangle $ABC,$ we draw the median $AM$ and the height $AH.$ Points $Q$ and $P$ are marked on the lines $AB$ and $AC$, respectively, so that the $QM \perp AC$ and $PM \perp AB$. The circumcircle of $PMQ$ intersects the line $BC$ for second time at point $X.$ Prove that $BH = CX.$ M. Didin

Let n be a positive integer, and let $a_1$, $a_2$, ..., $a_n$, $b_1$, $b_2$, ..., $b_n$ be positive real numbers such that $a_1\geq a_2\geq ...\geq a_n$ and $b_1\geq a_1$, $b_1b_2\geq a_1a_2$, $b_1b_2b_3\geq a_1a_2a_3$, ..., $b_1b_2...b_n\geq a_1a_2...a_n$. Prove that $b_1+b_2+...+b_n\geq a_1+a_2+...+a_n$.

Anna and Brian play a game where they put the domino tiles (of size $2 \times 1$) in a boards composed of $n \times 1$ boxes. Tiles must be placed so that they cover exactly two boxes. Players take turnslaying each tile and the one laying last tile wins. They play once for each $n$, where $n = 2, 3,\dots,2007$. Show that Anna wins at least $1505$ of the games if she always starts first and they both always play optimally, ie if they do their best to win in every move.

Let $A$, $B$ and $C$ be points lying on a circle $\Gamma$ with centre $O$. Assume that $\angle ABC > 90$. Let $D$ be the point of intersection of the line $AB$ with the line perpendicular to $AC$ at $C$. Let $l$ be the line through $D$ which is perpendicular to $AO$. Let $E$ be the point of intersection of $l$ with the line $AC$, and let $F$ be the point of intersection of $\Gamma$ with $l$ that lies between $D$ and $E$. Prove that the circumcircles of triangles $BFE$ and $CFD$ are tangent at $F$.

Let $ABC$ be a triangle and $O$ its circumcentre. A line tangent to the circumcircle of the triangle $BOC$ intersects sides $AB$ at $D$ and $AC$ at $E$. Let $A'$ be the image of $A$ under $DE$. Prove that the circumcircle of the triangle $A'DE$ is tangent to the circumcircle of triangle $ABC$.

On a $5 \times 5$ board, pieces made up of $4$ squares are placed, as seen in the figure, each covering exactly $4$ squares of the board. The pieces can be rotated or turned over. They can also overlap, but they cannot protrude from the board. Suppose that each square on the board is covered by at most two pieces. Determine the maximum number of squares on the board that can be covered (by one or two pieces). [asy] size(3cm); draw((0,0)--(0,1)--(1,1)--(1,0)--(0,0)--(1,0)--(2,0)--(2,1)--(1,1)--(1,2)--(2,2)--(2,1)--(3,1)--(3,2)--(2,2)); [/asy]

Let $a, b, c, d$ be four positive reals such that $abc+abd+acd+bcd = 1$. Determine all possible values for $$(ab + cd)(ac + bd)(ad + bc).$$ [i]Proposed by usjl and YaWNeeT[/i]

Consider a $100 \times 100$ table, and identify the cell in row $a$ and column $b$, $1 \leq a, b \leq 100$, with the ordered pair $(a, b)$. Let $k$ be an integer such that $51 \leq k \leq 99$. A $k$-knight is a piece that moves one cell vertically or horizontally and $k$ cells to the other direction; that is, it moves from $(a, b)$ to $(c, d)$ such that $(|a-c|, |b - d|)$ is either $(1, k)$ or $(k, 1)$. The $k$-knight starts at cell $(1, 1)$, and performs several moves. A sequence of moves is a sequence of cells $(x_0, y_0)= (1, 1)$, $(x_1, y_1), (x_2, y_2)$, $\ldots, (x_n, y_n)$ such that, for all $i = 1, 2, \ldots, n$, $1 \leq x_i , y_i \leq 100$ and the $k$-knight can move from $(x_{i-1}, y_{i-1})$ to $(x_i, y_i)$. In this case, each cell $(x_i, y_i)$ is said to be reachable. For each $k$, find $L(k)$, the number of reachable cells.

On the diagonal $AC$ of the rhombus $ABCD$, a point $E$ is taken, which is different from points $A$ and $C$, and on the lines $AB$ and $BC$ are points $N$ and $M$, respectively, with $AE = NE$ and $CE = ME$. Let $K$ be the intersection point of lines $AM$ and $CN$. Prove that points $K, E$ and $D$ are collinear.

Let $D$ be a point on the side $BC$ of an equilateral triangle $ABC$ where $D$ is different than the vertices. Let $I$ be the excenter of the triangle $ABD$ opposite to the side $AB$ and $J$ be the excenter of the triangle $ACD$ opposite to the side $AC$. Let $E$ be the second intersection point of the circumcircles of triangles $AIB$ and $AJC$. Prove that $A$ is the incenter of the triangle $IEJ$.