Prove that \[2010< \frac{2^{2}+1}{2^{2}-1}+\frac{3^{2}+1}{3^{2}-1}+...+\frac{2010^{2}+1}{2010^{2}-1}< 2010+\frac{1}{2}.\]

Find positive real numbers $x,y,z$ that are solutions of the system $x+y+z=xy+yz+zx$ and $xyz=1$ , and have the smallest possible sum.

Two circles intersect at points $P$ and $Q$. Point $A$ lies on the first circle, but outside the second. Lines $AP$ and $AQ$ intersect the second circle at points $B$ and $C$, respectively. Indicate the position of point $A$ at which triangle $ABC$ has the largest area. (D. Prokopenko)

Prove that there is no function from positive real numbers to itself, $f : (0,+\infty)\to(0,+\infty)$ such that: $f(f(x) + y) = f(x) + 3x + yf(y)$ ,for every $x,y \in (0,+\infty)$ by Greece, Athanasios Kontogeorgis (aka socrates)

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]

Initially, Alice is given a positive integer $a_0$. At time $i$, Alice has two choices, $$\begin{cases}a_i\mapsto\frac1{a_{i-1}}\\a_i\mapsto2a_{i-1}+1\end{cases}$$ Note that it is dangerous to perform the first operation, so Alice cannot choose this operation in two consecutive turns. However, if $x>8763$, then Alice could only perform the first operation. Determine all $a_0$ so that $\{i\in\mathbb N\mid a_i\in\mathbb N\}$ is an infinite set.

Which of the following is the set of all perfect squares that can be written as sum of three odd composite numbers? $\textbf{a)}\ \{(2k + 1)^2 : k \geq  0\}$ $\textbf{b)}\ \{(4k + 3)^2 : k \geq  1\}$ $\textbf{c)}\ \{(2k + 1)^2 : k \geq  3\}$ $\textbf{d)}\ \{(4k + 1)^2 : k \geq 2\}$ $\textbf{e)}\ \text{None of above}$

Circle $\omega$ has radius 10 with center $O$. Let $P$ be a point such that $PO=6$. Let the midpoints of all chords of $\omega$ through $P$ bound a region of area $R$. Find the value of $\lfloor 10R \rfloor$. [i]Proposed by Andrew Zhao[/i]

Find all the functions $f : \mathbb{R} \to \mathbb{R}$ satisfying for all $x,y \in \mathbb{R}$ $f(f(x)-y^2) = f(x)^2 - 2f(x)y^2 + f(f(y))$.

Calculate the volume $ V $ of tetrahedron $ ABCD $ given the length $ d $ of edge $ AB $ and the area $ S $ of the projection of the tetrahedron on the plane perpendicular to the line $ AB $.

How many positive integers less than $1000$ are there such that they cannot be written as sum of $2$ or more successive positive integers? $ \textbf{(A)}\ 6 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 26 \qquad\textbf{(D)}\ 68 \qquad\textbf{(E)}\ 72 $

The Fibonacci sequence is given by equalities $$F_1=F_2=1, F_{k+2}=F_k+F_{k+1}, k\in N$$. a) Prove that for every $m \ge 0$, the area of ​​the triangle $A_1A_2A_3$ with vertices $A_1(F_{m+1},F_{m+2})$, $A_2 (F_{m+3},F_{m+4})$, $A_3 (F_{m+5},F_{m+6})$ is equal to $0.5$. b) Prove that for every $m \ge 0$ the quadrangle $A_1A_2A_4$ with vertices $A_1(F_{m+1},F_{m+2})$, $A_2 (F_{m+3},F_{m+4})$, $A_3 (F_{m+5},F_{m+6})$, $A_4 (F_{m+7},F_{m+8})$ is a trapezoid, whose area is equal to $2.5$. c) Prove that the area of ​​the polygon $A_1A_2...A_n$ , $n \ge3$ with vertices does not depend on the choice of numbers $m \ge 0$, and find this area.

In a room there are $2023$ vases numbered from $1$ to $2023$. In each vase we want to put a note with a positive integer from $1$, $2$ $...$ , $2023$ on it. The numbers on the notes do [u]not[/u] necessarily have to be distinct. The following should now apply to each vase. Look at the note inside the vase, find the (not necessarily different) vase with the number written on the note, and look at the note inside this vase. Then the average of the numbers on the two notes must be exactly equal to the number of the first selected vase. For example, if we put a note with the number $5$ in vase $13$, then vase $5$ should contain a note with the number $21$ on it: after all, the average of $5$ and $ 21$ is $13$. Determine all possible ways to provide each vase with a note.

In the complex plane consider the unit circle with the origin as its center. Furthermore, consider inscribed regular 17-gon with one of its vertices being $1+0i.$ How many of its vertices lie in the (open) unit disc centered in $\sqrt{3/2}(1+i)$?

Let $ABC$ be a triangle with incenter $I$ and incircle $\omega$. It is given that there exist points $X$ and $Y$ on the circumference of $\omega$ such that $\angle BXC=\angle BYC=90^\circ$. Suppose further that $X$, $I$, and $Y$ are collinear. If $AB=80$ and $AC=97$, compute the length of $BC$.

Let $ABC$ be a scalene triangle with circumcircle $\Gamma$, and let $D$,$E$,$F$ be the points where its incircle meets $BC$, $AC$, $AB$ respectively. Let the circumcircles of $\triangle AEF$, $\triangle BFD$, and $\triangle CDE$ meet $\Gamma$ a second time at $X,Y,Z$ respectively. Prove that the perpendiculars from $A,B,C$ to $AX,BY,CZ$ respectively are concurrent. [i]Proposed by Michael Kural[/i]

For how many (not necessarily positive) integer values of $n$ is the value of $4000\cdot \left(\tfrac{2}{5}\right)^n$ an integer? $ \textbf{(A) }3 \qquad \textbf{(B) }4 \qquad \textbf{(C) }6 \qquad \textbf{(D) }8 \qquad \textbf{(E) }9 \qquad $

In a group of $n$ people, every weekend someone organizes a party in which he invites all of his acquaintances. Those who meet at a party become acquainted. After each of the $n$ people has organized a party, there still are two people not knowing each other. Show that these two will never get to know each other at such a party.

Find the number of ordered pairs $(P(x),Q(x))$ of polynomials with integer coefficients such that \[ P(x)^2+Q(x)^2=\left(x^{4096}-1\right)^2. \] [i]Proposed by Michael Kural[/i]

The numbers from 1 to $n$ are arranged in some way on a circle. What’s the smallest value of $n$, for which no matter how the numbers are arranged there exist ten consecutively increasing numbers $A_1<A_2<A_3…<A_{10}$ such that $A_1 A_2…A_{10}$ is a convex decagon?

In a convex pentagon $ ABCDE$, let $ \angle EAB \equal{} \angle ABC \equal{} 120^{\circ}$, $ \angle ADB \equal{} 30^{\circ}$ and $ \angle CDE \equal{} 60^{\circ}$. Let $ AB \equal{} 1$. Prove that the area of the pentagon is less than $ \sqrt {3}$.

There are two non-empty stacks of $n$ and $m$ coins on a table. The following operations are allowed: $\bullet$ The same number of coins are removed from both stacks. $\bullet$ The number of coins in a stack is tripled. For which pairs $(n, m)$ is it possible that after finitely many operations, no coins are more available?

Find the limit $$\lim_{n\to\infty}\left(\prod_{k=1}^n\frac k{k+n}\right)^{e^{\frac{1999}n}-1}.$$

Find all real numbers $ x$ such that: $ [x^2\plus{}2x]\equal{}{[x]}^2\plus{}2[x]$ (Here $ [x]$ denotes the largest integer not exceeding $ x$.)

Let $x$ and $y$ be positive reals such that \[ x^3 + y^3 + (x + y)^3 + 30xy = 2000. \] Show that $x + y = 10$.