Let $n > 1$ be an integer. In a circular arrangement of $n$ lamps $L_0, \ldots, L_{n-1},$ each of of which can either ON or OFF, we start with the situation where all lamps are ON, and then carry out a sequence of steps, $Step_0, Step_1, \ldots .$ If $L_{j-1}$ ($j$ is taken mod $n$) is ON then $Step_j$ changes the state of $L_j$ (it goes from ON to OFF or from OFF to ON) but does not change the state of any of the other lamps. If $L_{j-1}$ is OFF then $Step_j$ does not change anything at all. Show that: (i) There is a positive integer $M(n)$ such that after $M(n)$ steps all lamps are ON again, (ii) If $n$ has the form $2^k$ then all the lamps are ON after $n^2-1$ steps, (iii) If $n$ has the form $2^k + 1$ then all lamps are ON after $n^2 - n + 1$ steps.

Let $ABC$ be an acute triangle with $AB>AC$. Let $D,E,F$ denote the feet of its altitudes on $BC,AC$ and $AB$, respectively. Let $S$ denote the intersection of lines $EF$ and $BC$. Prove that the circumcircles $k_1$ and $k_2$ of the two triangles $AEF$ and $DES$ touch in $E$. [i](Karl Czakler)[/i]

An odd integer $ n \ge 3$ is said to be nice if and only if there is at least one permutation $ a_{1}, \cdots, a_{n}$ of $ 1, \cdots, n$ such that the $ n$ sums $ a_{1} \minus{} a_{2} \plus{} a_{3} \minus{} \cdots \minus{} a_{n \minus{} 1} \plus{} a_{n}$, $ a_{2} \minus{} a_{3} \plus{} a_{3} \minus{} \cdots \minus{} a_{n} \plus{} a_{1}$, $ a_{3} \minus{} a_{4} \plus{} a_{5} \minus{} \cdots \minus{} a_{1} \plus{} a_{2}$, $ \cdots$, $ a_{n} \minus{} a_{1} \plus{} a_{2} \minus{} \cdots \minus{} a_{n \minus{} 2} \plus{} a_{n \minus{} 1}$ are all positive. Determine the set of all `nice' integers.

Alice has four boxes, $327$ blue balls, and $2022$ red balls. The blue balls are labeled $1$ to $327$. Alice first puts each of the balls into a box, possibly leaving some boxes empty. Then, a random label between $1$ and $327$ (inclusive) is selected, Alice finds the box the ball with the label is in, and selects a random ball from that box. What is the maximum probability that she selects a red ball?

The Wonder Island Intelligence Service has $16$ spies in Tartu. Each of them watches on some of his colleagues. It is known that if spy $A$ watches on spy $B$, then $B$ does not watch on $A$. Moreover, any $10$ spies can numbered in such a way that the first spy watches on the second, the second watches on the third and so on until the tenth watches on the first. Prove that any $11$ spies can also be numbered is a similar manner.

It has come to a policeman's ears that 5 gangsters (all of different height) are meeting, one of them is the clan leader, he's the tallest of the 5. He knows the members will leave the building one by one, with a 10-minute break between them, and too bad for him Belgium has not enough policemen to follow all gangsters, so he's on his own to spot the clanleader, and he can only follow one member. So he decides to let go the first 2 people, and then follow the first one that is taller than those two. What's the chance he actually catches the clan leader like this?

The sequence $ (a_n)_{n\ge 1}$ is defined by $ a_1 \equal{} 3$, $ a_2 \equal{} 11$ and $ a_n \equal{} 4a_{n\minus{}1}\minus{}a_{n\minus{}2}$, for $ n \ge 3$. Prove that each term of this sequence is of the form $ a^2 \plus{} 2b^2$ for some natural numbers $ a$ and $ b$.

The prime factorization of $12 = 2 \cdot 2 \cdot 3$ has three prime factors. Find the number of prime factors in the factorization of $12! = 12 \cdot 11 \cdot 10 \cdot 9 \cdot 8 \cdot 7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1.$

The polynomial $P(x)=3x^3-2x^2+ax-b$ has roots $\sin^2\theta$, $\cos^2\theta$, and $\sin\theta\cos\theta$ for some angle $\theta$. Find $P(1)$.

Let set $S$ be the smallest set of positive integers satisfying the following properties: [list] [*] $2$ is in set $S$. [*] If $n^2$ is in set $S$, then $n$ is also in set $S$. [*] If $n$ is in set $S$, then $(n+5)^2$ is also in set $S$. [/list] Determine which positive integers are not in set $S$.

Given a polynomial of degree $2$, $p(x) = ax^2 +bx+c$ define the function $$S(p) = (a -b)^2 + (b - c)^2 + (c - a)^2.$$ Determine the real number$ r$such that, for any polynomial $p(x)$ of degree $2$ with real roots, holds $S(p) \ge ra^2$

Let $ABC$ be an equilateral triangle. On the small arc $AB{}$ of its circumcircle $\Omega$, consider the point $N{}$ such that the small arc $NB$ measures $30^\circ{}$. The perpendiculars from $N{}$ onto $AC$ and $AB$ intersect $\Omega$ again at $P{}$ and $Q{}$ respectively. Let $H_1,H_2$ and $H_3$ be the orthocenters of the triangles $NAB, QBC$ and $CAP$ respectively. [list=a] [*]Prove that the triangle $NPQ$ is equilateral. [*]Prove that the triangle $H_1H_2H_3$ is equilateral. [/list]

For what positive integers $n \geq 3$ does there exist a polygon with $n$ vertices (not necessarily convex) with property that each of its sides is parallel to another one of its sides?

A function $f$ satisfies $f(x)+x f(1-x) = x^2$ for all real $x$. Determine $f$ .

Let $T$ be a non-isosceles triangle and $n \ge 4$ an integer . Prove that you can divide $T$ in $n$ triangles and draw in each of them an inner bisector so that those $n$ bisectors are parallel.

An $m \times n$ chessboard with $m,n \ge 2$ is given. Some dominoes are placed on the chessboard so that the following conditions are satisfied: (i) Each domino occupies two adjacent squares of the chessboard, (ii) It is not possible to put another domino onto the chessboard without overlapping, (iii) It is not possible to slide a domino horizontally or vertically without overlapping. Prove that the number of squares that are not covered by a domino is less than $\frac15 mn$.