Suppose convex hexagon $ \text{HEXAGN}$ has $ 120^\circ$-rotational symmetry about a point $ P$—that is, if you rotate it $ 120^\circ$ about $ P$, it doesn't change. If $ PX\equal{}1$, find the area of triangle $ \triangle{GHX}$.

For all natural $n$, an $n$-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second row, and so on, up to $n$ squares in the $n^{th}$ row, such that all the left-most squares in each row are aligned vertically. Let $f(n)$ denote the minimum number of square tiles requires to tile the $n$-staircase, where the side lengths of the square tiles can be any natural number. e.g. $f(2)=3$ and $f(4)=7$. (a) Find all $n$ such that $f(n)=n$. (b) Find all $n$ such that $f(n) = n+1$.

Given that points $ D,E$ lie on the sidelines $ AB,BC$ of triangle $ ABC$, respectively, point $ P$ is in interior of triangle $ ABC$ such that $ PE \equal{} PC$ and $ \bigtriangleup DEP\sim \bigtriangleup PCA.$ Prove that $ BP$ is tangent of the circumcircle of triangle $ PAD.$

Find all positive integers $a$ and $b$ such that $(a + b^2)(b + a^2) = 2^m$ for some integer $m.$ [i](6 points)[/i]

Three distinct vertices are chosen at random from the vertices of a given regular polygon of $ (2n\plus{}1)$ sides. If all such choices are equally likely, what is the probability that the center of the given polygon lies in the interior of the triangle determined by the three chosen random points?

Find the number of ordered pairs $(x,y)$ of positive integers that satisfy $x\le 2y\le 60$ and $y\le 2x\le 60.$

Rectangle $ABCD$ is given with $AB=63$ and $BC=448.$ Points $E$ and $F$ lie on $AD$ and $BC$ respectively, such that $AE=CF=84.$ The inscribed circle of triangle $BEF$ is tangent to $EF$ at point $P,$ and the inscribed circle of triangle $DEF$ is tangent to $EF$ at point $Q.$ Find $PQ.$

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$.

Let $P$ be a convex polygon in the plane. A real number is assigned to each point in the plane so that the sum of the numbers assigned to the vertices of any polygon similar to $P$ is equal to $0$. Prove that all the assigned numbers are equal to $0$.

Let $a,b$ be two positive integers, such that $ab\neq 1$. Find all the integer values that $f(a,b)$ can take, where \[ f(a,b) = \frac { a^2+ab+b^2} { ab- 1} . \]

Consider acute $\triangle ABC$ with altitudes $AA_1, BB_1$ and $CC_1$ ($A_1 \in BC,B_1 \in AC,C_1 \in AB$). A point $C' $ on the extension of $B_1A_1$ beyond $A_1$ is such that $A_1C' = B_1C_1$. Analogously, a point $B'$ on the extension of A$_1C_1$ beyond $C_1$ is such that $C_1B' = A_1B_1$ and a point $A' $ on the extension of $C_1B_1$ beyond $B_1$ is such that $B_1A' = C_1A_1$. Denote by $A'', B'', C''$ the symmetric points of $A' , B' , C'$ with respect to $BC, CA$ and $AB$ respectively. Prove that if $R, R'$ and R'' are circumradiii of $\triangle ABC, \triangle A'B'C'$ and $\triangle A''B''C''$, then $R, R'$ and $R'' $ are sidelengths of a triangle with area equals one half of the area of $\triangle ABC$.

The figure below shows line $\ell$ with a regular, infinite, recurring pattern of squares and line segments. [asy] size(300); defaultpen(linewidth(0.8)); real r = 0.35; path P = (0,0)--(0,1)--(1,1)--(1,0), Q = (1,1)--(1+r,1+r); path Pp = (0,0)--(0,-1)--(1,-1)--(1,0), Qp = (-1,-1)--(-1-r,-1-r); for(int i=0;i <= 4;i=i+1) { draw(shift((4*i,0)) * P); draw(shift((4*i,0)) * Q); } for(int i=1;i <= 4;i=i+1) { draw(shift((4*i-2,0)) * Pp); draw(shift((4*i-1,0)) * Qp); } draw((-1,0)--(18.5,0),Arrows(TeXHead)); [/asy] How many of the following four kinds of rigid motion transformations of the plane in which this figure is drawn, other than the identity transformation, will transform this figure into itself? [list] [*] some rotation around a point of line $\ell$ [*] some translation in the direction parallel to line $\ell$ [*] the reflection across line $\ell$ [*] some reflection across a line perpendicular to line $\ell$ [/list] $\textbf{(A) } 0 \qquad\textbf{(B) } 1 \qquad\textbf{(C) } 2 \qquad\textbf{(D) } 3 \qquad\textbf{(E) } 4$

Let $ABC$ be a triangle, and let $D$ be a point on side $AB$. Circle $\omega_1$ passes through $A$ and $D$ and is tangent to line $AC$ at $A$. Circle $\omega_2$ passes through $B$ and $D$ and is tangent to line $BC$ at $B$. Circles $\omega_1$ and $\omega_2$ meet at $D$ and $E$. Point $F$ is the reflection of $C$ across the perpendicular bisector of $AB$. Prove that points $D$, $E$, and $F$ are collinear.

Three real numbers are given. Fractional part of the product of every two of them is $ 1\over 2$. Prove that these numbers are irrational. [i]Proposed by A. Golovanov[/i]

The incircle of a non-isosceles triangle $ABC$ with the center $I$ touches the sides $BC$ at $D$. let $X$ is a point on arc $BC$ from circumcircle of triangle $ABC$ such that if $E,F$ are feet of perpendicular from $X$ on $BI,CI$ and $M$ is midpoint of $EF$ we have $MB=MC$. prove that $\widehat{BAD}=\widehat{CAX}$

An ordinary clock in a factory is running slow so that the minute hand passes the hour hand at the usual dial position($12$ o'clock, etc.) but only every $69$ minutes. At time and one-half for overtime, the extra pay to which a $\textdollar 4.00$ per hour worker should be entitled after working a normal $8$ hour day by that slow running clock, is $\textbf{(A) }\textdollar 2.30\qquad\textbf{(B) }\textdollar 2.60\qquad\textbf{(C) }\textdollar 2.80\qquad\textbf{(D) }\textdollar 3.00\qquad \textbf{(E) }\textdollar 3.30$

Consider the square grid with $A=(0,0)$ and $C=(n,n)$ at its diagonal ends. Paths from $A$ to $C$ are composed of moves one unit to the right or one unit up. Let $C_n$ (n-th catalan number) be the number of paths from $A$ to $C$ which stay on or below the diagonal $AC$. Show that the number of paths from $A$ to $C$ which cross $AC$ from below at most twice is equal to $C_{n+2}-2C_{n+1}+C_n$

Lines tangent to circle $O$ in points $A$ and $B$, intersect in point $P$. Point $Z$ is the center of $O$. On the minor arc $AB$, point $C$ is chosen not on the midpoint of the arc. Lines $AC$ and $PB$ intersect at point $D$. Lines $BC$ and $AP$ intersect at point $E$. Prove that the circumcentres of triangles $ACE$, $BCD$, and $PCZ$ are collinear.

Can a closed disk can be decomposed into a union of two congruent parts having no common point?

The altitudes $AA_1$ and $CC_1$ of a triangle $ABC$ meet at point $H$. Point $H_A$ is symmetric to $H$ about $A$. Line $H_AC_1$ meets $BC$ at point $C' $, point $A' $ is defined similarly. Prove that $A' C' // AC$.

Find the angles of the triangle $ABC$, if we know that its center $O$ of the circumscribed circle and the center $I_A$ of the exscribed circle (tangent to $BC$) are symmetric wrt $BC$. (Bogdan Rublev)

A convex quadrilateral $ABCD$ with $AC \neq BD$ is inscribed in a circle with center $O$. Let $E$ be the intersection of diagonals $AC$ and $BD$. If $P$ is a point inside $ABCD$ such that $\angle PAB+\angle PCB=\angle PBC+\angle PDC=90^\circ$, prove that $O$, $P$ and $E$ are collinear.

$O$ is a point in the plane. Let $O'$ be an arbitrary point on the axis $Ox$ of the plane and let $M$ be an arbitrary point. Rotate $M$, $90^\circ$ clockwise around $O$ to get the point $M'$ and rotate $M$, $90^\circ$ anticlockwise around $O'$ to get the point $M''.$ Prove that the midpoint of the segment $MM''$ is a fixed point.

We call a graph symmetric, if we can put its vertices on the plane such that if the edges are segments, the graph has a reflectional symmetry with respect to a line not passing through its vertices. Find the least value of $K$ such that the edges of every graph with $100$ vertices, can be divided into $K$ symmetric subgraphs.

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]