Let $n$ be a positive integer. Denote by $S_n$ the set of points $(x, y)$ with integer coordinates such that \[ \left\lvert x\right\rvert + \left\lvert y + \frac{1}{2} \right\rvert < n. \] A path is a sequence of distinct points $(x_1 , y_1), (x_2, y_2), \ldots, (x_\ell, y_\ell)$ in $S_n$ such that, for $i = 2, \ldots, \ell$, the distance between $(x_i , y_i)$ and $(x_{i-1} , y_{i-1} )$ is $1$ (in other words, the points $(x_i, y_i)$ and $(x_{i-1} , y_{i-1} )$ are neighbors in the lattice of points with integer coordinates). Prove that the points in $S_n$ cannot be partitioned into fewer than $n$ paths (a partition of $S_n$ into $m$ paths is a set $\mathcal{P}$ of $m$ nonempty paths such that each point in $S_n$ appears in exactly one of the $m$ paths in $\mathcal{P}$).

Let $ABCDEF$ regular hexagon of side length $1$ and $O$ is its center. In addition to the sides of the hexagon, line segments from $O$ to the every vertex are drawn, making as total of $12$ unit segments. Find the number paths of length $2003$ along these segments that star at $O$ and terminate at $O$.

In triangle $ ABC$, $ AB\equal{}AC$, the inscribed circle $ I$ touches $ BC, CA, AB$ at points $ D,E$ and $ F$ respectively. $ P$ is a point on arc $ EF$ opposite $ D$. Line $ BP$ intersects circle $ I$ at another point $ Q$, lines $ EP$, $ EQ$ meet line $ BC$ at $ M, N$ respectively. Prove that (1) $ P, F, B, M$ concyclic (2)$ \frac{EM}{EN} \equal{} \frac{BD}{BP}$ (P.S. Can anyone help me with using GeoGebra, the incircle function of the plugin doesn't work with my computer.)

Given the $7$-element set $A = \{ a ,b,c,d,e,f,g \}$, find a collection $T$ of $3$-element subsets of $A$ such that each pair of elements from $A$ occurs exactly once on one of the subsets of $T$.

In each square of an $m \times n$ rectangular board there is a nought or a cross. Let $f(m,n)$ be the number of such arrangements that contain a row or a column consisting of noughts only. Let $g(m,n)$ be the number of arrangements that contain a row consisting of noughts only, or a column consisting of crosses only. Which of the numbers $f(m,n)$ and $g(m,n)$ is larger?

Let $ x$, $ y$, $ z$ be real numbers such that $ 0 < x,y,z < 1$ and $ xyz \equal{} (1 \minus{} x)(1 \minus{} y)(1 \minus{} z)$. Show that at least one of the numbers $ (1 \minus{} x)y,(1 \minus{} y)z,(1 \minus{} z)x$ is greater than or equal to $ \frac {1}{4}$

Let $BC$ be a fixed segment in the plane, and let $A$ be a variable point in the plane not on the line $BC$. Distinct points $X$ and $Y$ are chosen on the rays $CA^\to$ and $BA^\to$, respectively, such that $\angle CBX = \angle YCB = \angle BAC$. Assume that the tangents to the circumcircle of $ABC$ at $B$ and $C$ meet line $XY$ at $P$ and $Q$, respectively, such that the points $X$, $P$, $Y$ and $Q$ are pairwise distinct and lie on the same side of $BC$. Let $\Omega_1$ be the circle through $X$ and $P$ centred on $BC$. Similarly, let $\Omega_2$ be the circle through $Y$ and $Q$ centred on $BC$. Prove that $\Omega_1$ and $\Omega_2$ intersect at two fixed points as $A$ varies. [i]Daniel Pham Nguyen, Denmark[/i]

Let $ m,n$ be positive integers, and let $ F$ be a family of $ m$-element subsets of $ \{1,2,...,n\}$ satisfying $ A\cap B \not \equal{} \emptyset$ for all $ A,B\in F$. Determine the maximum possible number of elements in $ F$.

A convex, closed figure lies inside a given circle. The figure is seen from every point of the circumference at a right angle (that is, the two rays drawn from the point and supporting the convex figure are perpendicular). Prove that the center of the circle is a center of symmetry of the figure.

On a circular table are sitting $ 2n$ people, equally spaced in between. $ m$ cookies are given to these people, and they give cookies to their neighbors according to the following rule. (i) One may give cookies only to people adjacent to himself. (ii) In order to give a cookie to one's neighbor, one must eat a cookie. Select arbitrarily a person $ A$ sitting on the table. Find the minimum value $ m$ such that there is a strategy in which $ A$ can eventually receive a cookie, independent of the distribution of cookies at the beginning.

Inside a circle of center $ O$ and radius $ r$, take two points $ A$ and $ B$ symmetrical about $ O$. We consider a variable point $ P$ on the circle and draw the chord $ \overline{PP'}\perp \overline{AP}$. Let $ C$ is the symmetric of $ B$ about $ \overline{PP'}$ ($ \overline{PP}'$ is the axis of symmetry) . Find the locus of point $ Q \equal{} \overline{PP'}\cap\overline{AC}$ when we change $ P$ in the circle.

Let $P$ and $Q$ be points on a circle $k$. A chord $AC$ of $k$ passes through the midpoint $M$ of $PQ$. Consider a trapezoid $ABCD$ inscribed in $k$ with $AB \parallel PQ \parallel CD$. Prove that the intersection point $X$ of $AD$ and $BC$ depends only on $k$ and $P,Q.$

Erick stands in the square in the 2nd row and 2nd column of a 5 by 5 chessboard. There are \$1 bills in the top left and bottom right squares, and there are \$5 bills in the top right and bottom left squares, as shown below. \[\begin{tabular}{|p{1em}|p{1em}|p{1em}|p{1em}|p{1em}|} \hline \$1 & & & & \$5 \\ \hline & E & & &\\ \hline & & & &\\ \hline & & & &\\ \hline \$5 & & & & \$1 \\ \hline \end{tabular}\] Every second, Erick randomly chooses a square adjacent to the one he currently stands in (that is, a square sharing an edge with the one he currently stands in) and moves to that square. When Erick reaches a square with money on it, he takes it and quits. The expected value of Erick's winnings in dollars is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

A finite set of integers is called [i]bad[/i] if its elements add up to $2010$. A finite set of integers is a [i]Benelux-set[/i] if none of its subsets is bad. Determine the smallest positive integer $n$ such that the set $\{502, 503, 504, . . . , 2009\}$ can be partitioned into $n$ Benelux-sets. (A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.) [i](2nd Benelux Mathematical Olympiad 2010, Problem 1)[/i]

Let $m$ be a positive integer, and let $T$ denote the set of all subsets of $\{1, 2, \dots, m\}$. Call a subset $S$ of $T$ $\delta$-[I]good[/I] if for all $s_1, s_2\in S$, $s_1\neq s_2$, $|\Delta (s_1, s_2)|\ge \delta m$, where $\Delta$ denotes the symmetric difference (the symmetric difference of two sets is the set of elements that is in exactly one of the two sets). Find the largest possible integer $s$ such that there exists an integer $m$ and $ \frac{1024}{2047}$-good set of size $s$.

Given a convex figure in the Cartesian plane that is symmetric with respect of both axis, we construct a rectangle $A$ inside it with maximum area (over all posible rectangles). Then we enlarge it with center in the center of the rectangle and ratio lamda such that is covers the convex figure. Find the smallest lamda such that it works for all convex figures.

Walking down Jane Street, Ralph passed four houses in a row, each painted a different color. He passed the orange house before the red house, and he passed the blue house before the yellow house. The blue house was not next to the yellow house. How many orderings of the colored houses are possible? ${ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}}\ 5\qquad\textbf{(E)}\ 6$

Let $ F$ be a surface of nonzero curvature that can be represented around one of its points $ P$ by a power series and is symmetric around the normal planes parallel to the principal directions at $ P$. Show that the derivative with respect to the arc length of the curvature of an arbitrary normal section at $ P$ vanishes at $ P$. Is it possible to replace the above symmetry condition by a weaker one? [i]A. Moor[/i]

Let $a, b, c, x, y$ and $z$ be complex numbers such that $a=\frac{b+c}{x-2}, b=\frac{c+a}{y-2}, c=\frac{a+b}{z-2}$. If $xy+yz+zx=1000$ and $x+y+z=2016$, find the value of $xyz$.

[size=130]In $\triangle ABC$, $\angle A=60^\circ$. $\odot I$ is the incircle of $\triangle ABC$. $\odot I$ is tangent to sides $AB$, $AC$ at $D$, $E$, respectively. Line $DE$ intersects line $BI$ and $CI$ at $F$, $G$ respectively. Prove that [/size]$FG=\frac{BC}{2}$.

In a $ 19\times 19$ board, a piece called [i]dragon[/i] moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board. The [i]draconian distance[/i] between two squares is defined as the least number of moves a dragon needs to move from one square to the other. Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.

Let $ABCD$ be a cyclic quadrilateral inscribed in circle $\omega$ whose diagonals meet at $F$. Lines $AB$ and $CD$ meet at $E$. Segment $EF$ intersects $\omega$ at $X$. Lines $BX$ and $CD$ meet at $M$, and lines $CX$ and $AB$ meet at $N$. Prove that $MN$ and $BC$ concur with the tangent to $\omega$ at $X$. [i]Proposed by Allen Liu[/i]

Show that the number of $3-$element subsets $\{ a , b, c \}$ of $\{ 1 , 2, 3, \ldots, 63 \}$ with $a+b +c < 95$ is less than the number of those with $a + b +c \geq 95.$

A deck of $ n$ playing cards, which contains three aces, is shuffled at random (it is assumed that all possible card distributions are equally likely). The cards are then turned up one by one from the top until the second ace appears. Prove that the expected (average) number of cards to be turned up is $ (n\plus{}1)/2$.

Find all $f$ functions from real numbers to itself such that for all real numbers $x,y$ the equation \[f(f(y)+x^2+1)+2x=y+(f(x+1))^2\] holds.