Let $ n \geq 3$ be an odd integer. We denote by $ [\minus{}n,n]$ the set of all integers greater or equal than $ \minus{}n$ and less or equal than $ n$. Player $ A$ chooses an arbitrary positive integer $ k$, then player $ B$ picks a subset of $ k$ (distinct) elements from $ [\minus{}n,n]$. Let this subset be $ S$. If all numbers in $ [\minus{}n,n]$ can be written as the sum of exactly $ n$ distinct elements of $ S$, then player $ A$ wins the game. If not, $ B$ wins. Find the least value of $ k$ such that player $ A$ can always win the game.

Let $H$ be the orthocentre of an acute triangle $ABC$. The line through $A$ perpendicular to $AC$ and the line through $B$ perpendicular to $BC$ intersect in $D$. The circle with centre $C$ through $H$ intersects the circumcircle of triangle $ABC$ in the points $E$ and $F$. Prove that $|DE| = |DF| = |AB|$.

Consider the set $S$ of the eight points $(x,y)$ in the Cartesian plane satisfying $x,y \in \{-1, 0, 1\}$ and $(x,y) \neq (0,0)$. How many ways are there to draw four segments whose endpoints lie in $S$ such that no two segments intersect, even at endpoints? [i]Proposed by Evan Chen[/i]

Find all functions $f$ from real numbers to real numbers such that $$2f((x+y)^2)=f(x+y)+(f(x))^2+(4y-1)f(x)-2y+4y^2$$ holds for all real numbers $x$ and $y$.

Prove that if $ n $ is a natural number greater than $ 2 $, then $$\sqrt[n + 1]{n+1} < \sqrt[n]{n}.$$

Let $ a$, $ b$, $ c$, $ d$ be positive real numbers such that $ abcd \equal{} 1$ and $ a \plus{} b \plus{} c \plus{} d > \dfrac{a}{b} \plus{} \dfrac{b}{c} \plus{} \dfrac{c}{d} \plus{} \dfrac{d}{a}$. Prove that \[ a \plus{} b \plus{} c \plus{} d < \dfrac{b}{a} \plus{} \dfrac{c}{b} \plus{} \dfrac{d}{c} \plus{} \dfrac{a}{d}\] [i]Proposed by Pavel Novotný, Slovakia[/i]

Inside the equilateral triangle $ABC$, points $P$ and $Q$ are chosen so that the quadrilateral $APQC$ is convex, $AP = PQ = QC$ and $\angle PBQ = 30^o$. Prove that $AQ = BP$.

The cirumcentre of the cyclic quadrilateral $ABCD$ is $O$. The second intersection point of the circles $ABO$ and $CDO$, other than $O$, is $P$, which lies in the interior of the triangle $DAO$. Choose a point $Q$ on the extension of $OP$ beyond $P$, and a point $R$ on the extension of $OP$ beyond $O$. Prove that $\angle QAP=\angle OBR$ if and only if $\angle PDQ=\angle RCO$.

An acute angled triangle $\mathcal{T}$ is inscribed in circle $\Omega$.Denote by $\Gamma$ the nine-point circle of $\mathcal{T}$.A circle $\omega$ passes through two of the vertices of $\mathcal{T}$, and centre of $\Omega$.Prove that the common external tangents of $\Gamma$ and $\omega$ meet on the external bisector of the angle at third vertex of $\mathcal{T}$.

Suppose $d$ is a digit. For how many values of $d$ is $2.00d5 > 2.005$? $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 4\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 10 $

On a square board with $m$ rows and $n$ columns, where $m\le n$, some squares are colored black in such a way that no two rows are alike. Find tha biggest integer $k$ such that, for every possible coloring to start with, one can always color $k$ columns entirely red in such a way that still no two rows are alike.

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 a triangle and let $P$ be a point in its interior. Denote by $D$, $E$, $F$ the feet of the perpendiculars from $P$ to the lines $BC$, $CA$, $AB$, respectively. Suppose that \[AP^2 + PD^2 = BP^2 + PE^2 = CP^2 + PF^2.\] Denote by $I_A$, $I_B$, $I_C$ the excenters of the triangle $ABC$. Prove that $P$ is the circumcenter of the triangle $I_AI_BI_C$. [i]Proposed by C.R. Pranesachar, India [/i]

Let $m$ be a positive integer. Consider a $4m\times 4m$ array of square unit cells. Two different cells are [i]related[/i] to each other if they are in either the same row or in the same column. No cell is related to itself. Some cells are colored blue, such that every cell is related to at least two blue cells. Determine the minimum number of blue cells.

Alice and Bob play the following game. They write some fractions of the form $1/n$, where $n{}$ is positive integer, onto the blackboard. The first move is made by Alice. Alice writes only one fraction in each her turn and Bob writes one fraction in his first turn, two fractions in his second turn, three fractions in his third turn and so on. Bob wants to make the sum of all the fractions on the board to be an integer number after some turn. Can Alice prevent this? [i]Andrey Arzhantsev[/i]

Determine all integer values of n for which the number $\frac{14n+25}{2n+1}$ 'is a perfect square.

Let $ a$, $ b$, $ c$ denote the sides of a triangle. Show that the quantity \[ \frac{a}{b\plus{}c}\plus{}\frac{b}{c\plus{}a}\plus{}\frac{c}{a\plus{}b}\] must lie between the limits $ 3/2$ and 2. Can equality hold at either limits?

Let $a,b,c > 0$ and $ab+bc+ca = 1$. Prove that: \[ \sqrt {a^3 + a} + \sqrt {b^3 + b} + \sqrt {c^3 + c}\geq2\sqrt {a + b + c}. \]

Find the smallest positive integer $n$ such that $2n+1$ and $3n+1$ are both squares

Let $P$ be an interior point of a triangle $ABC$ and let $BP$ and $CP$ meet $AC$ and $AB$ in $E$ and $F$ respectively. IF $S_{BPF} = 4$,$S_{BPC} = 8$ and $S_{CPE} = 13$, find $S_{AFPE}.$

Given a $ \triangle ABC $ and three points $ D, E, F $ such that $ DB = DC, $ $ EC = EA, $ $ FA = FB, $ $ \measuredangle BDC = \measuredangle CEA = \measuredangle AFB. $ Let $ \Omega_D $ be the circle with center $ D $ passing through $ B, C $ and similarly for $ \Omega_E, \Omega_F. $ Prove that the radical center of $ \Omega_D, \Omega_E, \Omega_F $ lies on the Euler line of $ \triangle DEF. $ [i]Proposed by Telv Cohl[/i]

Let $ABC$ be an acute triangle, $\Gamma$ is its circumcircle and $O$ is its circumcenter. Let $F$ be the point on $AC$ such that the $\angle COF=\angle ACB$, such that $F$ and $B$ lie in opposite sides with respect to $CO$. The line $FO$ cuts $BC$ at $G$. The line parallel to $BC$ through $A$ intersects $\Gamma$ again at $M$. The lines $CO$ and $MG$ meet at $K$. Show that the circumcircles of the triangles $BGK$ and $AOK$ meet on $AB$.

The integers $1$, $2$, $3$, $4$, and $5$ are written on a blackboard. It is allowed to wipe out two integers $a$ and $b$ and replace them with $a + b$ and $ab$. Is it possible, by repeating this procedure, to reach a situation where three of the five integers on the blackboard are $2009$?

Determine all functions $f$ defined on the set of all positive integers and taking non-negative integer values, satisfying the three conditions: [list] [*] $(i)$ $f(n) \neq 0$ for at least one $n$; [*] $(ii)$ $f(x y)=f(x)+f(y)$ for every positive integers $x$ and $y$; [*] $(iii)$ there are infinitely many positive integers $n$ such that $f(k)=f(n-k)$ for all $k<n$. [/list]

Eight politicians stranded on a desert island on January 1st, 1991, decided to establish a parliament. They decided on the following rules of attendance: (a) There should always be at least one person present on each day. (b) On no two days should the same subset attend. (c) The members present on day $N$ should include for each $K<N$, $(K\ge 1)$ at least one member who was present on day $K$. For how many days can the parliament sit before one of the rules is broken?