In a convex cyclic hexagon $ABCDEF$, $BC=EF$ and $CD=AF$. Diagonals $AC$ and $BF$ intersect at point $Q,$ and diagonals $EC$ and $DF$ intersect at point $P.$ Points $R$ and $S$ are marked on the segments $DF$ and $BF$ respectively so that $FR=PD$ and $BQ=FS.$ [b]The segments[/b] $RQ$ and $PS$ intersect at point $T.$ Prove that the line $TC$ bisects the diagonal $DB$.

Let $a$ be a rational number and let $n$ be a positive integer. Prove that the polynomial $X^{2^n}(X+a)^{2^n}+1$ is irreducible in the ring $\mathbb{Q}[X]$ of polynomials with rational coefficients. [i]Proposed by Vincent Jugé, École Polytechnique, Paris.[/i]

Let $\vartriangle ABC$ be an isosceles triangle with $AC = BC$. Points $D, E, F$ are considered on $BC, CA, AB$, respectively, such that $AF> BF$ and that the quadrilateral $CEFD$ is a parallelogram. The perpendicular line to $BC$ drawn by $B$ intersects the perpendicular bisector of $AB$ at $G$. Prove that $DE \perp FG$.

We´re given an inscriptible quadrilateral $ DEFG $ having some vertices on the sides of a triangle $ ABC, $ and some vertices (at least one of them) coinciding with the vertices of the same triangle. Knowing that the lines $ DF $ and $ EG $ aren´t parallel, find the locus of their intersection. [i]Dan Brânzei[/i]

The current in a river is flowing steadily at $3$ miles per hour. A motor boat which travels at a constant rate in still water goes downstream $4$ miles and then returns to its starting point. The trip takes one hour, excluding the time spent in turning the boat around. The ratio of the downstream to the upstream rate is $\textbf{(A) }4:3\qquad\textbf{(B) }3:2\qquad\textbf{(C) }5:3\qquad\textbf{(D) }2:1\qquad \textbf{(E) }5:2$

Let $a, b, c$ be positive real numbers such that $a^2+b^2+c^2+(a+b+c)^2\leq4$. Prove that \[\frac{ab+1}{(a+b)^2}+\frac{bc+1}{(b+c)^2}+\frac{ca+1}{(c+a)^2}\geq 3.\]

We have a group of $n$ kids. For each pair of kids, at least one has sent a message to the other one. For each kid $A$, among the kids to whom $A$ has sent a message, exactly $25 \% $ have sent a message to $A$. How many possible two-digit values of $n$ are there? [i]Proposed by Bulgaria[/i]

Given a positive integer $n\geq 2$ and positive real numbers $a_1, a_2, \ldots, a_n$ with the sum equal to $1$. Let $b = a_1 + 2a_2 + \ldots + n a_n$. Prove that $$\sum_{1\leq i < j \leq n} (i-j)^2 a_i a_j \leq (n-b)(b-1).$$

Let $ P(x) \equal{} (x \minus{} 1)(x \minus{} 2)(x \minus{} 3)$. For how many polynomials $ Q(x)$ does there exist a polynomial $ R(x)$ of degree 3 such that $ P(Q(x)) \equal{} P(x) \cdot R(x)$? $ \textbf{(A)}\ 19\qquad \textbf{(B)}\ 22\qquad \textbf{(C)}\ 24\qquad \textbf{(D)}\ 27\qquad \textbf{(E)}\ 32$

Consider a $m\times n$ rectangular board consisting of $mn$ unit squares. Two of its unit squares are called [i]adjacent[/i] if they have a common edge, and a [i]path[/i] is a sequence of unit squares in which any two consecutive squares are adjacent. Two parths are called [i]non-intersecting[/i] if they don't share any common squares. Each unit square of the rectangular board can be colored black or white. We speak of a [i]coloring[/i] of the board if all its $mn$ unit squares are colored. Let $N$ be the number of colorings of the board such that there exists at least one black path from the left edge of the board to its right edge. Let $M$ be the number of colorings of the board for which there exist at least two non-intersecting black paths from the left edge of the board to its right edge. Prove that $N^{2}\geq M\cdot 2^{mn}$.

Let $n$ be a positive integer. All numbers $m$ which are coprime to $n$ all satisfy $m^6\equiv 1\pmod n$. Find the maximum possible value of $n$.

How many digits could possibly be the last digit of a perfect square?

Let $C_1$ be a circle with centre $O$, and let $AB$ be a chord of the circle that is not a diameter. $M$ is the midpoint of $AB$. Consider a point $T$ on the circle $C_2$ with diameter $OM$. The tangent to $C_2$ at the point $T$ intersects $C_1$ at two points. Let $P$ be one of these points. Show that $PA^2+PB^2=4PT^2$.

Given a cube, a cubic box, that exactly suits for the cube, and six colours. First man paints each side of the cube with its (side's) unique colour. Another man does the same with the box. Prove that the third man can put the cube in the box in such a way, that every cube side will touch the box side of different colour.

(a) Decide whether there exist two decimal digits $a$ and $b$, such that every integer with decimal representation $ab222 ... 231$ is divisible by $73$. (b) Decide whether there exist two decimal digits $c$ and $d$, such that every integer with decimal representation $cd222... 231$ is divisible by $79$.

Proof that $$ \sum_{m=1}^n5^{\omega (m)} \le \sum_{k=1}^n\lfloor \frac{n}{k} \rfloor \tau (k)^2 \le \sum_{m=1}^n5^{\Omega (m)} .$$