In a convex quadrilateral $ ABCD $ with area $ S $, each side was divided into 3 equal parts and segments were drawn connecting the appropriate points of division of the opposite sides in such a way that the quadrilateral was divided into 9 quadrilaterals. Prove that the sum of the areas of the following three quadrilaterals resulting from the division: the one containing the vertex $ A $, the middle one and the one containing the vertex $ C $ is equal to $ \frac{S}{3} $.

In a Cartesian plane, if both horizontal coordinate and vertical coordinate of a point are rational numbers, we call the point [i]rational point[/i]. Otherwise, we call it [i]irrational point[/i]. Consider an arbitrary regular pentagon on the Cartesian plane. Please compare the number of rational point and the number of irrational point among the five vertices of the pentagon. Prove your conclusion.

Given two positive integers $n$ and $k$, we say that $k$ is [i]$n$-ergetic[/i] if: However the elements of $M=\{1,2,\ldots, k\}$ are coloured in red and green, there exist $n$ not necessarily distinct integers of the same colour whose sum is again an element of $M$ of the same colour. For each positive integer $n$, determine the least $n$-ergetic integer, if it exists.

Let $k$ be a positive integer. Show that for all $n>k$ there exist convex figures $F_{1},\ldots, F_{n}$ and $F$ such that there doesn't exist a subset of $k$ elements from $F_{1},..., F_{n}$ and $F$ is covered for this elements, but $F$ is covered for every subset of $k+1$ elements from $F_{1}, F_{2},....., F_{n}$.

Let $ABC$ be a triangle,$O$ its circumcenter and $R$ the radius of its circumcircle.Denote by $O_{1}$ the symmetric of $O$ with respect to $BC$,$O_{2}$ the symmetric of $O$ with respect to $AC$ and by $O_{3}$ the symmetric of $O$ with respect to $AB$. (a)Prove that the circles $C_{1}(O_{1},R)$, $C_{2}(O_{2},R)$, $C_{3}(O_{3},R)$ have a common point. (b)Denote by $T$ this point.Let $l$ be an arbitary line passing through $T$ which intersects $C_{1}$ at $L$, $C_{2}$ at $M$ and $C_{3}$ at $K$.From $K,L,M$ drop perpendiculars to $AB,BC,AC$ respectively.Prove that these perpendiculars pass through a point.

The vertices $ A$ and $ B$ of an equilateral triangle $ ABC$ lie on a circle $k$ of radius $1$, and the vertex $ C$ is in the interior of the circle $ k$. A point $ D$, different from $ B$, lies on $ k$ so that $ AD\equal{}AB$. The line $ DC$ intersects $ k$ for the second time at point $ E$. Find the length of the line segment $ CE$.

All of the roots of $x^3+ax^2+bx+c$ are positive integers greater than $2$, and the coefficients satisfy $a+b+c+1=-2009$. Find $a$

Nine pawns forming a $3$ by $3$ square are placed in the lower left hand corner of an $8$ by $8$ chessboard. Any pawn may jump over another one standing next to it into a free square, i .e. may be reflected symmetrically with respect to a neighb our's centre (jumps may be horizontal , vertical or diagonal) . It is required to rearrange the nine pawns in another corner of the chessboard (in another $3$ by $3$ square) by means of such jumps. Can the pawns be thus re-arranged in the (a) upper left hand corner? (b) upper right hand corner? (J . E . Briskin)

Big Bad Brandon is assigning groups of his Big Bad Burglars to attack 7 different towers. Each Burglar can only belong to one attack group and Brandon takes over a tower if the number of Burglars attacking the tower strictly exceeds the number of knights guarding it. He knows there the total number of knights guarding the towers is 99 but does not know the exact number of knights guarding each tower. What is the minimum number of Burglars that Brandon needs to guarantee he can take over at least 4 of the 7 towers? [i]Proposed by Eric Wang[/i]

$PA, PB, PC$ are three rays in space. Show that there is just one pair of points $B', C$' with $B'$ on the ray $PB$ and $C'$ on the ray $PC$ such that $PC' + B'C' = PA + AB'$ and $PB' + B'C' = PA + AC'$.

Find all pairs of natural numbers $(n,m)$ with $1<n<m$ such that the numbers $1$, $\sqrt[n]n$ and $\sqrt[m]m$ are linearly dependent over the field of rational numbers $\mathbb Q$.

Let \(AOB\) be a given angle less than \(180^{\circ}\) and let \(P\) be an interior point of the angular region determined by \(\angle AOB\). Show, with proof, how to construct, using only ruler and compass, a line segment \(CD\) passing through \(P\) such that \(C\) lies on the way \(OA\) and \(D\) lies on the ray \(OB\), and \(CP:PD=1:2\).

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

Find the number of integers $x$ such that the following three conditions all hold: $\bullet$ $x$ is a multiple of $5$ $\bullet$ $121 < x < 1331$ $\bullet$ When $x$ is written as an integer in base $11$ with no leading $0$s (i.e. no $0$s at the very left), its rightmost digit is strictly greater than its leftmost digit.

Prove or disprove the following statement: If $F$ is a finite set with two or more elements, then there exists a binary operation $*$ on $F$ such that for all $x,y,z$ in $F$, $(\text i)$ $x*z=y*z$ implies $x=y$ $(\text{ii})$ $x*(y*z)\ne(x*y)*z$

Let $f(x)$ be a polynomial with integer coefficients such that $f(15) f(21) f(35) - 10$ is divisible by $105$. Given $f(-34) = 2014$ and $f(0) \ge 0$, find the smallest possible value of $f(0)$. [i]Proposed by Michael Kural and Evan Chen[/i]

We have a $6 \times 6$ square, partitioned into 36 unit squares. We select some of these unit squares and draw some of their diagonals, subject to the condition that no two diagonals we draw have any common points. What is the maximal number of diagonals that we can draw?

Let $ABC$ be a triangle with $AB \neq BC$ and let $BD$ the interior bisectrix of $ \angle ABC$ with $D \in AC$ . Let $M$ be the midpoint of the arc $AC$ that contains the point $B$ in the circumcircle of the triangle $ABC$ .The circumcircle of the triangle $BDM$ intersects the segment $AB$ in $K \neq B$ . Denote by $J$ the symmetric of $A$ with respect to $K$ .If $DJ$ intersects $AM$ in $O$ then prove that $J,B,M,O$ are concyclic.

Let $A_1A_2...A_{2010}$ be a regular $2010$-gon. Find the number of obtuse triangles whose vertices are among $A_1$, $A_2$,$ ...$, $A_{2010}$.

Dave's Amazing Hotel has $3$ floors. If you press the up button on the elevator from the $3$rd floor, you are immediately transported to the $1$st floor. Similarly, if you press the down button from the $1$st floor, you are immediately transported to the $3$rd floor. Dave gets in the elevator at the $1$st floor and randomly presses up or down at each floor. After doing this $482$ times, the probability that Dave is on the first floor can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. What is the remainder when $m+n$ is divided by $1000$? $\text{(A) }136\qquad\text{(B) }294\qquad\text{(C) }508\qquad\text{(D) }692\qquad\text{(E) }803$

There are ten cards with the number $a$ on each, ten with $b$ and ten with $c$, where $a, b$ and $c$ are distinct real numbers. For every five cards, it is possible to add another five cards so that the sum of the numbers on these ten cards is $0$. Prove that one of $a, b$ and $c$ is $0$.

The numbers 1 through 9 can be arranged in the triangles labeled $a$ through $i$ illustrated below so that the numbers in each of the $2\times2$ triangles sum to the value $n$; that is \[a+b+c+d=b+e+f+g=d+g+h+i=n.\] For each possible sum $n$, show an arrangement, labeled with the sum as shown below. Prove that there are no possible arrangements for any other values of $n$. [asy] size(150); defaultpen(linewidth(0.7)+fontsize(12)); picture p = new picture; draw(p,(-3,-3^.5)/2--(3,-3^.5)/2^^(-1,0)--(1,0)^^(-1,3^.5)/2--(1,3^.5)/2); add(p); add(rotate(120)*p); add(rotate(240)*p); string[] hexlbl = {'d','c','b','f','g','h'}, trilbl = {'a','e','i'}; for(int i = 0; i < hexlbl.length; ++i) label('$'+hexlbl[i]+'$',dir(30+60*i)/3^.5); for(int i = 0; i < trilbl.length; ++i) label('$'+trilbl[i]+'$',dir(90+120*i)*2/3^.5);[/asy]

In triangle $ ABC$ we have $ a \geq b$ and $ a \geq c.$ Prove that the ratio of circumcircle radius to incircle diameter is at least as big as the length of the centroidal axis $ s_a$ to the altitude $ a_a.$ When do we have equality?

Find all primes which are sum of two primes and difference of two primes.

14 students attend the IMO training camp. Every student has at least $k$ favourite numbers. The organisers want to give each student a shirt with one of the student's favourite numbers on the back. Determine the least $k$, such that this is always possible if: $a)$ The students can be arranged in a circle such that every two students sitting next to one another have different numbers. $b)$ $7$ of the students are boys, the rest are girls, and there isn't a boy and a girl with the same number.