The numbers $\frac{1}{1}, \frac{1}{2}, ... , \frac{1}{2010}$ are written on a blackboard. A student chooses any two of the numbers, say $x$, $y$, erases them and then writes down $x + y + xy$. He continues to do this until only one number is left on the blackboard. What is this number?

Let $m$ and $n$ be relatively prime positive integers. Determine all possible values of \[\gcd(2^m - 2^n, 2^{m^2+mn+n^2}- 1).\]

In acute-angled triangle $ ABC$, the points $ D,E,F$ are on sides $ BC,CA,AB$, respectively such that $ \angle AFE \equal{} \angle BFD, \angle FDB \equal{} \angle EDC, \angle DEC \equal{} \angle FEA$. Prove that $ AD$ is perpendicular to $ BC$.

a) A bus network is organized so that: 1) one can reach any stop from any other stop without changing buses; 2) every pair of routes has a single stop at which one can change buses; 3) each route has exactly three stops? How many bus routes are there? It is assumed that there are at least two routes. b) A town has $57$ bus routes. How many stops does each route have if it is known that 1) one can reach any stop from any other stop without changing buses; 2) for every pair of routes there is a single stop where one can change buses; 3) each route has three or more stops?

$ABC$ is a triangle inscribed in a circle, and $E$ is the mid-point of the arc subtended by $BC$ on the side remote from $A$. If through $E$ a diameter $ED$ is drawn, show that the measure of the angle $DEA$ is half the magnitude of the difference of the measures of the angles at $B$ and $C$.

There is a WORD game with the following rules. There are finite number of relations $U_{i}\longrightarrow V_{i}$($U_{i},V_{i}$ are words). There is are two words $A,B$. We start from $A$, and we want to reach to $B$. At each step we can change one subword $U_{i}$ to $V_{i}$. Prove that there does not exist an algorithm that picks up $A,B$ and $U_{i}$'s,$V_{i}$'s and decides whether we can reach from $A$ to $B$ or not.

Let $ n$ be a given positive integer. Show that we can choose numbers $ c_k\in\{\minus{}1,1\}$ ($ i\le k\le n$) such that \[ 0\le\sum_{k\equal{}1}^nc_k\cdot k^2\le4.\]

Let $a, b,$ and $c$ be positive real numbers such that $a + b + c = 1$. Prove the following inequality $$a \sqrt[3]{\frac{b}{a}} + b \sqrt[3]{\frac{c}{b}} + c \sqrt[3]{\frac{a}{c}} \le ab + bc + ca + \frac{2}{3}.$$ Proposed by [i]Anastasija Trajanova, Macedonia[/i]

Prove that, if $a$ and $b$ are given integers, the system of equatìons $$x + y + 2z + 2t = a$$ $$2x - 2y + z- t = b$$ has a solution in integers $x, y,z,t$.

Let $ABCD$ be a quadrilateral $AB = BC = CD = DA$. Let $MN$ and $PQ$ be two segments perpendicular to the diagonal $BD$ and such that the distance between them is $d > \frac{BD}{2}$, with $M \in AD$, $N \in DC$, $P \in AB$, and $Q \in BC$. Show that the perimeter of hexagon $AMNCQP$ does not depend on the position of $MN$ and $PQ$ so long as the distance between them remains constant.

Let $\triangle{ABC}$ be an acute triangle with orthocenter $H.$ Points $E$ and $F$ are on segments $\overline{AC}$ and $\overline{AB},$ respectively, such that $\angle{EHF}=90^\circ.$ Let $X$ be the foot of the perpendicular from $H$ to $\overline{EF}.$ Prove that $\angle{BXC}=90^\circ.$

Players $A$ and $B$ play the following game on the coordinate plane. Player $A$ hides a nut at one of the points with integer coordinates, and player $B$ tries to find this hidden nut. In one move $B$ can choose three different points with integer coordinates, then $A$ tells whether these three points together with the nut's point lie on the same circle or not. Can $B$ be guaranteed to find the nut in a finite number of moves?

Determine if there exist five consecutive positive integers such that their LCM is a perfect square.

On the sides $AB$ and $BC$ of triangle $ABC$, points $M$ and $K$ are taken, respectively, so that $S_{KMC} + S_{KAC}=S_{ABC}$. Prove that all such lines $MK$ pass through one point.

In this figure $\angle RFS = \angle FDR$, $FD = 4$ inches, $DR = 6$ inches, $FR = 5$ inches, $FS = 7\dfrac{1}{2}$ inches. The length of $RS$, in inches, is: [asy] import olympiad; pair F,R,S,D; F=origin; R=5*dir(aCos(9/16)); S=(7.5,0); D=4*dir(aCos(9/16)+aCos(1/8)); label("$F$",F,SW);label("$R$",R,N); label("$S$",S,SE); label("$D$",D,W); label("$7\frac{1}{2}$",(F+S)/2.5,SE); label("$4$",midpoint(F--D),SW); label("$5$",midpoint(F--R),W); label("$6$",midpoint(D--R),N); draw(F--D--R--F--S--R); markscalefactor=0.1; draw(anglemark(S,F,R)); draw(anglemark(F,D,R)); //Credit to throwaway1489 for the diagram[/asy] $\textbf{(A)}\ \text{undetermined} \qquad \textbf{(B)}\ 4\qquad \textbf{(C)}\ 5\dfrac{1}{2} \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 6\dfrac{1}{4}$

Let $N$ be the number of ways to colour each cell in a $2 \times 50$ rectangle either red or blue such that each $2 \times 2$ block contains at least one blue cell. Show that $N$ is a multiple of $3^{25}$, but not a multiple of $3^{26}$

Let $ABC$ be a triangle with incenter $I$ and let $AI$ meet $BC$ at $D$. Let $E$ be a point on the segment $AC$, such that $CD=CE$ and let $F$ be on the segment $AB$ such that $BF=BD$. Let $(CEI) \cap (DFI)=P \neq I$ and $(BFI) \cap (DEI)=Q \neq I$. Prove that $PQ \perp BC$. [i]Proposed by Leonardo Franchi, Italy[/i]

Determine all positive integer solutions $(x, y, z, t)$ of the equation \[(x+y)(y+z)(z+x)=xyzt\] for which $\gcd(x, y)=\gcd(y, z)=\gcd(z, x)=1$.

A circle is inscribed in a square, then a square is inscribed in this circle, and finally, a circle is inscribed in this square. What is the ratio of the area of the smaller circle to the area of the larger square? $ \textbf{(A)}\ \frac{\pi}{16}\qquad \textbf{(B)}\ \frac{\pi}{8}\qquad \textbf{(C)}\ \frac{3\pi}{16}\qquad \textbf{(D)}\ \frac{\pi}{4}\qquad \textbf{(E)}\ \frac{\pi}{2}$

Let $f(X)$ be a monic irreducible polynomial over $\mathbb{Z}$; therefore, by Gauss's Lemma, $f$ is also irreducible over $\mathbb{Q}$ (you may assume this). Moreover, assume $f(X) \mid f\left(X^2+n\right)$ where $n$ is an integer such that $n \notin\{-1,0,1\}$. Show that $n^2 \nmid f(0)$.

Let $ABC$ be a triangle with incircle $\omega$, incenter $I$ and circumcircle $\Gamma$. Let $D$ be the tangency point of $\omega$ with $BC$, let $M$ be the midpoint of $ID$, and let $A'$ be the diametral opposite of $A$ with respect to $\Gamma$. If we denote $X=A'M\cap \Gamma$, then prove that the circumcircle of triangle $AXD$ is tangent to $BC$.

$2013$ users have registered on the social network "Graph". Some users are friends, and friendship in "Graph" is mutual. It is known that among network users there are no three, each of whom would be friends. Find the biggest one possible number of pairs of friends in "Graph".

Answer the following questions : [b](a)[/b] Evaluate $~~\lim_{x\to 0^{+}} \Big(x^{x^x}-x^x\Big)$ [b](b)[/b] Let $A=\frac{2\pi}{9}$, i.e. $40$ degrees. Calculate the following $$1+\cos A+\cos 2A+\cos 4A+\cos 5A+\cos 7A+\cos 8A$$ [b](c)[/b] Find the number of solutions to $$e^x=\frac{x}{2017}+1$$

Find the sum of all positive rational numbers that are less than $10$ and that have denominator $30$ when written in lowest terms.

Sam and Jonathan play a game where they take turns flipping a weighted coin, and the game ends when one of them wins. The coin has a $\frac89$ chance of landing heads and a $\frac19$ chance of landing tails. Sam wins when he flips heads, and Jonathan wins when he flips tails. Find the probability that Samwins, given that he takes the first turn. [i]Proposed by Samuel Tsui[/i]