Altitudes $AA_1$ and $CC_1$ of an acute-angled triangle $ABC$ intersect at point $H$. A straight line passing through point $H$ parallel to line $A_1C_1$ intersects the circumscribed circles of triangles $AHC_1$ and $CHA_1$ at points $X$ and $Y$, respectively. Prove that points $X$ and $Y$ are equidistant from the midpoint of segment $BH$.

Let $ABCD$ be a trapezium, $AD\parallel BC$, and let $E,F$ be points on the sides$AB$ and $CD$, respectively. The circumcircle of $AEF$ meets $AD$ again at $A_1$, and the circumcircle of $CEF$ meets $BC$ again at $C_1$. Prove that $A_1C_1,BD,EF$ are concurrent.

Let $k$ be any fixed positive integer. Let's look at integer pairs $(a, b)$, for which the quadratic equations $x^2 - 2ax + b = 0$ and $y^2 + 2ay + b = 0$ are real solutions (not necessarily different), which can be denoted by $x_1, x_2$ and $y_1, y_2$, respectively, in such an order that the equation $x_1 y_1 - x_2 y_2 = 4k$. a) Find the largest possible value of the second component $b$ of such a pair of numbers ($a, b)$. b) Find the sum of the other components of all such pairs of numbers.

Let $a, b, c, d$ be the roots of the quartic polynomial $f(x) = x^4 + 2x + 4$. Find the value of $$\frac{a^2}{a^3 + 2} + \frac{b^2}{b^3 + 2} + \frac{c^2}{c^3 + 2} + \frac{d^2}{d^3 + 2}.$$

On the "battleship" field (a square of $10\times 10$ cells), $10$ "ships" are placed in the following sequence: first one "ship" of size $1\times 4$, then two - of size $1\times 3$, three - of size $1\times 2$, and, finally, four - $1\times 1$. The rules do not allow "ships" to touch each other even with their tops. Can it happen that when part of the "ships" have already been displayed, there is nowhere to place the next one?

Let $f$ be a function from nonnegative integers to nonnegative integers such that $f(0)=0$ and $$f(m)=f\left(\left\lfloor \frac{m}{2}\right\rfloor\right)+\left\lceil\frac{m}{2}\right\rceil^2$$ for all positive integers $m.$ Compute $$\frac{f(1)}{1\cdot2}+\frac{f(2)}{2\cdot3}+\frac{f(3)}{3\cdot4}+\cdots+\frac{f(31)}{31\cdot32}.$$(Here, $\lfloor z \rfloor$ is the greatest integer less than or equal to $z,$ and $\lceil z \rceil$ is the least positive integer greater than or equal to $z.$)

[i]Introductory part [/i] We call an $n$-tuple $x = (x_1, x_2, ... , x_n)$, with $x_k \in R$ (or respectively with all $x_k \in Z$) a real vector (or respectively an integer vector). The set of all real vectors (respectively all integer vectors) is usually denoted by $R^n$ (respectively $Z^n$). A vector $x$ is null if and only if $x_k = 0$, for all $k \in \{1, 2,... , n\}$. Also let $U_n$ be the set of all real vectors $x = (x_1, x_2, ... , x_n)$, such that $x^2_1 + x^2_2 + ...+ x^2_n = 1$. For two vectors $x = (x_1, ... , x_n), y = (y_1, ..., y_n)$ we define the scalar product as the real number $x\cdot y = x_1y_1 + x_2y_2 +...+ x_ny_n$. We define the norm of the vector $x$ as $||x|| =\sqrt{x^2_1 + x^2_2 + ...+ x^2_n}$ [i]The problem[/i] Let $A(k, r) = \{x \in U_n |$ for all $z \in Z^n$ we have either $|x \cdot z| \ge \frac{k}{||z||^r}$ or $z$ is null $\}$. Prove that if $r > n - 1$ the we can find a positive number $k$ such that $A(k, r)$ is not empty, and if $r < n - 1$ we cannot find such a positive number $k$.

A set $S$ of positive integers is called magic if for any two distinct members of $S, i$ and $j$, $\frac{i+ j}{GCD(i, j)}$is also a member of $S$. The $GCD$, or greatest common divisor, of two positive integers is the largest integer that divides evenly into both of them; for example, $GCD(36,80) = 4$. Find and describe all finite magic sets.

Let be given a triangle $ ABC$ with $ BC \equal{} a$, $ CA \equal{} b$, $ AB \equal{} c$. Six distinct points $ A_1$, $ A_2$, $ B_1$, $ B_2$, $ C_1$, $ C_2$ not coinciding with $ A$, $ B$, $ C$ are chosen so that $ A_1$, $ A_2$ lie on line $ BC$; $ B_1$, $ B_2$ lie on $ CA$ and $ C_1$, $ C_2$ lie on $ AB$. Let $ \alpha$, $ \beta$, $ \gamma$ three real numbers satisfy $ \overrightarrow{A_1A_2} \equal{} \frac {\alpha}{a}\overrightarrow{BC}$, $ \overrightarrow{B_1B_2} \equal{} \frac {\beta}{b}\overrightarrow{CA}$, $ \overrightarrow{C_1C_2} \equal{} \frac {\gamma}{c}\overrightarrow{AB}$. Let $ d_A$, $ d_B$, $ d_C$ be respectively the radical axes of the circumcircles of the pairs of triangles $ AB_1C_1$ and $ AB_2C_2$; $ BC_1A_1$ and $ BC_2A_2$; $ CA_1B_1$ and $ CA_2B_2$. Prove that $ d_A$, $ d_B$ and $ d_C$ are concurrent if and only if $ \alpha a \plus{} \beta b \plus{} \gamma c \neq 0$.

Let $ABCD$ be a square, and let $P$ be a point on the minor arc $CD$ of its circumcircle. The lines $PA, PB$ meet the diagonals $BD, AC$ at points $K, L$ respectively. The points $M, N$ are the projections of $K, L$ respectively to $CD$, and $Q$ is the common point of lines $KN$ and $ML$. Prove that $PQ$ bisects the segment $AB$.

If $\mathbf{A}$ and $\mathbf{B}$ are square matrices of the same size such that $\mathbf{ABAB}=\mathbf{0}$, does it follow that $\mathbf{BABA}=\mathbf{0}$.

For a prime $ p$ an a positive integer $ n$, denote by $ \nu_p(n)$ the exponent of $ p$ in the prime factorization of $ n!$. Given a positive integer $ d$ and a finite set $ \{p_1,p_2,\ldots, p_k\}$ of primes, show that there are infinitely many positive integers $ n$ such that $ \nu_{p_i}(n) \equiv 0 \pmod d$, for all $ 1\leq i \leq k$.

Consider the set $E = \{5, 6, 7, 8, 9\}$. For any partition ${A, B}$ of $E$, with both $A$ and $B$ non-empty, consider the number obtained by adding the product of elements of $A$ to the product of elements of $B$. Let $N$ be the largest prime number amonh these numbers. Find the sum of the digits of $N$.

Let $a_1\in\mathbb{Z}$, $a_2=a_1^2-a_1-1$, $\dots$ ,$a_{n+1}=a_n^2-a_n-1$. Prove that $a_{n+1}$ and $2n+1$ are coprime.

The point $A_1$ on the perimeter of a convex quadrilateral $ABCD$ is such that the line $AA_1$ divides the quadrilateral into two parts of equal area. The points $B_1$, $C_1$, $D_1$ are defined similarly. Prove that the area of the quadrilateral $A_1B_1C_1D_1$ is greater than a quarter of the area of $ABCD$. [i]L. Emelyanov [/i]

A bicentric quadrilateral is one that is both inscribable in and circumscribable about a circle, i.e. both the incircle and circumcircle exists. Show that for such a quadrilateral, the centers of the two associated circles are collinear with the point of intersection of the diagonals.

12 points are located on a clock with the sme distance , numbers $1,2,3 , ... 12$ are marked on each point in clockwise order . Use 4 kinds of colors (red,yellow,blue,green) to colour the the points , each kind of color has 3 points . N ow , use these 12 points as the vertex of convex quadrilateral to construct $n$ convex quadrilaterals . They satisfies the following conditions: (1). the colours of vertex of every convex quadrilateral are different from each other . (2). for every 3 quadrilaterals among them , there exists a colour such that : the numbers on the 3 points painted into this colour are different from each other . Find the maximum $n$ .

Denote by $g_n$ the number of connected graphs of degree $n$ whose vertices are labeled with numbers $1,2,...,n$. Prove that $g_n \ge (\frac{1}{2}).2^{\frac{n(n-1)}{2}}$. [b][u]Note[/u][/b]:If you prove that for $c < \frac{1}{2}$, $g_n \ge c.2^{\frac{n(n-1)}{2}}$, you will earn some point! [i]proposed by Seyed Reza Hosseini and Mohammad Amin Ghiasi[/i]

Let $ABC$ be a triangle with $\angle A = 90^o$ and let $D$ be an orthogonal projection of $A$ onto $BC$. The midpoints of $AD$ and $AC$ are called $E$ and $F$, respectively. Let $M$ be the circumcentre of $\vartriangle BEF$. Prove that $AC\parallel BM$.

In convex polyhedron $ABCDE$ line segment $DE$ intersects the plane of triangle $ABC$ inside the triangle. Rotate the point $D$ outward into the plane of triangle $ABC$ around the lines $AB$, $BC$, $CA$; let the resulting points be $D_1$, $D_2$, and $D_3$. Similarly, rotate the point $E$ outward into the plane of triangle $ABC$ around the lines $AB$, $BC$, $CA$; let the resulting points be $E_1$, $E_2$, and $E_3$. Show that if the polyhedron has an inscribed sphere, then the circumcircles of $D_1D_2D_3$ and $E_1E_2E_3$ are concentric. [i]Proposed by: Géza Kós, Budapest[/i]

Find all integers $n$ such that $n^4 + 8n + 11$ is a product of two or more consecutive integers.

The points $(1,1),(2,3),(4,5)$ and $(999,111)$ are marked in the coordinate system. We continue to mark points in the following way : [list] [*]If points $(a,b)$ are marked then $(b,a)$ and $(a-b,a+b)$ can be marked [*]If points $(a,b)$ and $(c,d)$ are marked then so can be $(ad+bc, 4ac-4bd)$. [/list] Can we, after some finite number of these steps, mark a point belonging to the line $y=2x$.

Let $ABC$ be an acute triangle. Its incircle touches the sides $BC$, $CA$ and $AB$ at the points $D$, $E$ and $F$, respectively. Let $P$, $Q$ and $R$ be the circumcenters of triangles $AEF$, $BDF$ and $CDE$, respectively. Prove that triangles $ABC$ and $PQR$ are similar.

In a plane there is a triangle $ABC$. Line $AC$ is tangent to circle $c_A$ at point $C$ and circle $c_A$ passes through point $B$. Line $BC$ is tangent to circle $c_B$ at point $C$ and circle $c_B$ passes through point $A$. The second intersection point $S$ of circles $c_A$ and $c_B$ coincides with the incenter of triangle $ABC$. Prove that the triangle $ABC$ is equilateral.

Let $a$ and $b$ be positive integers such that all but $2009$ positive integers are expressible in the form $ma + nb$, where $m$ and $n$ are nonnegative integers. If $1776 $is one of the numbers that is not expressible, find $a + b$.