In an acute-angled triangle $ABC$ is $AB > BC$ , and the points $A_1$ and $C_1$ are the feet of the altitudes of from the vertices $A$ and $C$. Let $D$ be the second intersection of the circumcircles of triangles $ABC$ and $A_1BC_1$ (different of $B$). Let $Z$ be the intersection of the tangents to the circumcircle of the triangle ABC at the points $A$ and $C$ , and let the lines $ZA$ and $A_1C_1$ intersect at the point $X$, and the lines $ZC$ and $A_1C_1$ intersect at the point $Y$. Prove that the point $D$ lies on the circumcircle of the triangle $XYZ$.

Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$? [asy] size(250);defaultpen(linewidth(0.8)); pair X=(-6,0), O=origin, P=(6,0), B=tangent(X, O, 2, 1), A=tangent(X, O, 2, 2), C=tangent(X, P, 4, 1), D=tangent(X, P, 4, 2); pair top=X+15*dir(X--A), bottom=X+15*dir(X--B); draw(Circle(O, 2)^^Circle(P, 4)); draw(bottom--X--top); draw(A--O--B^^O--P^^D--P--C); pair point=X; label("$2$", midpoint(O--A), dir(point--midpoint(O--A))); label("$4$", midpoint(P--D), dir(point--midpoint(P--D))); label("$O$", O, SE); label("$P$", P, dir(point--P)); pair point=O; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); pair point=P; label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); fill((-3,7)--(-3,-7)--(-7,-7)--(-7,7)--cycle, white);[/asy] $ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$

Given a $24 \times 24$ square grid, initially all its unit squares are coloured white. A move consists of choosing a row, or a column, and changing the colours of all its unit squares, from white to black, and from black to white. Is it possible that after finitely many moves, the square grid contains exactly $574$ black unit squares?

An up-right path between two lattice points $P$ and $Q$ is a path from $P$ to $Q$ that takes steps of length $1$ unit either up or to the right. How many up-right paths from $(0, 0)$ to $(7, 7),$ when drawn in the plane with the line $y = x - 2.021$, enclose exactly one bounded region below that line?

Decide whether there exists a set $M$ of positive integers satisfying the following conditions: (i) For any natural number $m>1$ there exist $a, b \in M$ such that $a+b = m.$ (ii) If $a, b, c, d \in M$, $a, b, c, d > 10$ and $a + b = c + d$, then $a = c$ or $a = d.$

Let $p$ be some odd prime number and let $k=\frac{p+1}{2}$. The natural numbers $a_1,a_2…a_k$ are such that $a_i\neq a_j$ and $a_i<p$ for $\forall i,j=1,2…k$. Prove that for each natural number $r<p$ there exist not necessarily different $a_i$ and $a_j$, for which $a_i a_j\equiv r\, (mod\, p)$.

Prove that for any natural $n>1$ there are infinitely many natural numbers $m$ such that for any nonnegative integers $k_1$,$k_2$, $...$,$k_m$, $$m \ne k_1^n+ k_2^n+... k_n^n,$$

Let $F$ be a set of filters on X so that if $ \sigma, \tau \in F$ , $\forall S \in\sigma$ , $\forall T\in\tau$ , we have $S \cap T\neq\emptyset$ , then $\sigma \cap \tau \in F$. We say that $F$ is compatible with a topology on X when $x \in X$ is a contact point of $A\subset X$ , if and only if , there is $\sigma \in F$ such that $x \in S$ and $S \cap A \neq\emptyset$ for all $S \in\sigma$ . When is there an $F$ compatible with the topology on X in which finite subsets of X and X are closed ? contact point is also known as adherent point.

A trapezoid $ABCD$ with bases $BC = a$ and $AD = 2a$ is drawn on the plane. Using only with a ruler, construct a triangle whose area is equal to the area of the trapezoid. With the help of a ruler you can draw straight lines through two known points. (Rozhkova Maria)

Real numbers $a,b,c,d$ satisfy the equality $$\frac{1-ab}{a+b}=\frac{bc-1}{b+c}=\frac{1-cd}{c+d}=\sqrt{3}$$ Find all possible values of $ad$.

Find $ f(x): (0,\plus{}\infty) \to \mathbb R$ such that \[ f(x)\cdot f(y) \plus{} f(\frac{2008}{x})\cdot f(\frac{2008}{y})\equal{}2f(x\cdot y)\] and $ f(2008)\equal{}1$ for $ \forall x \in (0,\plus{}\infty)$.

Frieda the frog begins a sequence of hops on a $3 \times 3$ grid of squares, moving one square on each hop and choosing at random the direction of each hop up, down, left, or right. She does not hop diagonally. When the direction of a hop would take Frieda off the grid, she "wraps around'' and jumps to the opposite edge. For example if Frieda begins in the center square and makes two hops "up'', the first hop would place her in the top row middle square, and the second hop would cause Frieda to jump to the opposite edge, landing in the bottom row middle square. Suppose Frieda starts from the center square, makes at most four hops at random, and stops hopping if she lands on a corner square. What is the probability that she reaches a corner square on one of the four hops? $\textbf{(A) }\frac{9}{16}\qquad\textbf{(B) }\frac{5}{8}\qquad\textbf{(C) }\frac{3}{4}\qquad\textbf{(D) }\frac{25}{32}\qquad\textbf{(E) }\frac{13}{16}$

Let $a$ and $b$ be real numbers such that $\max_{0\le x\le 1} |x^3 - ax - b|$ is as small as possible. Find $a + b$ in simplest radical form. (Hint: If $f(x) = x^3 - cx - d$, then the maximum (or minimum) of $f(x)$ either occurs when $x = 0$ and/or $x = 1$ and/or when x satisfies $3x^2 - c = 0$).

In the space $n \geq 3$ points are given. Every pair of points determines some distance. Suppose all distances are different. Connect every point with the nearest point. Prove that it is impossible to obtain (closed) polygonal line in such a way.

There are a thousand non-intersecting arcs on a circle, and on each of them contains two natural numbers. Sum of numbers of each arc is divided by the product of the numbers of the arc following it clockwise arrow. What is the largest possible value of the largest number written?

Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that \[ f(x) f(y) = |x - y| \cdot f \left( \frac{xy + 1}{x - y} \right) \] Holds for all $x \not= y \in \mathbb{R}$

Three acute triangles are inscribed in the same circle with their vertices being nine distinct points. Show that one can choose a vertex from each triangle so that the three chosen points determine a triangle each of whose angles is at most $90^\circ$.

Let $ABCD$ be a quadrilateral such that $\angle ABC = \angle ADC = 90º$ and $\angle BCD$ > $90º$. Let $P$ be a point inside of the $ABCD$ such that $BCDP$ is parallelogram, the line $AP$ intersects $BC$ in $M$. If $BM = 2, MC = 5, CD = 3$. Find the length of $AM$.

Let $n > 1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k )_{k\ge 1}$, defined by \[a_k=\left\lfloor\frac{n^k}{k}\right\rfloor,\] are odd. (For a real number $x$, $\lfloor x\rfloor$ denotes the largest integer not exceeding $x$.) [i]Proposed by Hong Kong[/i]

There are 3 heaps with $100,101,102$ stones. Ilya and Kostya play next game. Every step they take one stone from some heap, but not from same, that was on previous step. They make his steps in turn, Ilya make first step. Player loses if can not make step. Who has winning strategy?

A circle having common centre with the circumcircle of triangle $ABC$ meets the sides of the triangle at six points forming convex hexagon $A_{1}A_{2}B_{1}B_{2}C_{1}C_{2}$ ($A_{1}$ and $A_{2}$ lie on $BC$, $B_{1}$ and $B_{2}$ lie on $AC$, $C_{1}$ and $C_{2}$ lie on $AB$). If $A_{1}B_{1}$ is parallel to the bisector of angle $B$, prove that $A_{2}C_{2}$ is parallel to the bisector of angle $C$. [i]Proposed by S. Berlov[/i]

Show that there exists a convex polyhedron with all its vertices on the surface of a sphere and with all its faces congruent isosceles triangles whose ratio of sides are $\sqrt{3} :\sqrt{3} :2$.

Prove that for any real $ x $ and $ y $ the inequality $x^2 \sqrt {1+2y^2} + y^2 \sqrt {1+2x^2} \geq xy (x+y+\sqrt{2})$ .

Let $ a_1, a_2,\ldots, a_n$ be non-negative real numbers. Prove that $\frac{1}{1+ a_1}+\frac{ a_1}{(1+ a_1)(1+ a_2)}+\frac{ a_1 a_2}{(1+ a_1)(1+ a_2)(1+ a_3)}+$ $\cdots+\frac{ a_1 a_2\cdots a_{n-1}}{(1+ a_1)(1+ a_2)\cdots (1+ a_n)} \le 1.$

Let $f: \mathbb{R}^{2} \to \mathbb{R}^{+}$such that for every rectangle $A B C D$ one has $$ f(A)+f(C)=f(B)+f(D). $$ Let $K L M N$ be a quadrangle in the plane such that $f(K)+f(M)=f(L)+f(N)$, for each such function. Prove that $K L M N$ is a rectangle. [i]Proposed by Navid.[/i]