A bee starts flying from point $P_0$. She flies 1 inch due east to point $P_1$. For $j \ge 1$, once the bee reaches point $P_j$, she turns $30^{\circ}$ counterclockwise and then flies $j+1$ inches straight to point $P_{j+1}$. When the bee reaches $P_{2015}$ she is exactly $a\sqrt{b} + c\sqrt{d}$ inches away from $P_0$, where $a$, $b$, $c$ and $d$ are positive integers and $b$ and $d$ are not divisible by the square of any prime. What is $a+b+c+d$? $ \textbf{(A)}\ 2016 \qquad\textbf{(B)}\ 2024 \qquad\textbf{(C)}\ 2032 \qquad\textbf{(D)}\ 2040 \qquad\textbf{(E)}\ 2048$

A game is played on a board with an infinite row of holes labelled $0, 1, 2, \dots$. Initially, $2009$ pebbles are put into hole $1$; the other holes are left empty. Now steps are performed according to the following scheme: (i) At each step, two pebbles are removed from one of the holes (if possible), and one pebble is put into each of the neighbouring holes. (ii) No pebbles are ever removed from hole $0$. (iii) The game ends if there is no hole with a positive label that contains at least two pebbles. Show that the game always terminates, and that the number of pebbles in hole $0$ at the end of the game is independent of the specific sequence of steps. Determine this number.

From a $n\times (n-1)$ rectangle divided into unit squares, we cut the [i]corner[/i], which consists of the first row and the first column. (that is, the corner has $2n-2$ unit squares). For the following, when we say [i]corner[/i] we reffer to the above definition, along with rotations and symmetry. Consider an infinite lattice of unit squares. We will color the squares with $k$ colors, such that for any corner, the squares in that corner are coloured differently (that means that there are no squares coloured with the same colour). Find out the minimum of $k$. [i]Proposed by S. Berlov[/i]

Let $x,y\in[0,\infty)$. Which of the following is true? $\textbf{(A)}~\left|\log\left(1+x^2\right)-\log\left(1+y^2\right)\right|\le|x-y|$ $\textbf{(B)}~\left|\sin^2x-\sin^2y\right|\le|x-y|$ $\textbf{(C)}~\left|\tan^{-1}x-\tan^{-1}y\right|\le|x-y|$ $\textbf{(D)}~\text{None of the above}$

Let $m$ be a positive integer. Determine the smallest positive integer $n$ for which there exist real numbers $x_1, x_2,...,x_n \in (-1, 1)$ such that $|x_1| + |x_2| +...+ |x_n| = m + |x_1 + x_2 + ... + x_n|$.

If $ y \equal{} \sqrt{x^2 \minus{} 2x \plus{} 1} \plus{} \sqrt{x^2 \plus{} 2x \plus{} 1}$, then $ y$ is: $ \textbf{(A)}\ 2x\qquad \textbf{(B)}\ 2(x \plus{} 1)\qquad \textbf{(C)}\ 0\qquad \textbf{(D)}\ |x \minus{} 1| \plus{} |x \plus{} 1|\qquad \textbf{(E)}\ \text{none of these}$

Let us have an infinite grid of unit squares. We write in every unit square a real number, such that the absolute value of the sum of the numbers from any $n*n$ square is less or equal than $1$. Prove that the absolute value of the sum of the numbers from any $m*n$ rectangular is less or equal than $4$.

A sample of 121 integers is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let $D$ be the difference between the mode and the arithmetic mean of the sample. What is the largest possible value of $\lfloor D\rfloor$? (For real $x$, $\lfloor x\rfloor$ is the greatest integer less than or equal to $x$.)

Done with her new problems, Wendy takes a break from math. Still without any fresh reading material, she feels a bit antsy. She starts to feel annoyed that Michael's loose papers clutter the family van. Several of them are ripped, and bits of paper litter the floor. Tired of trying to get Michael to clean up after himself, Wendy spends a couple of minutes putting Michael's loose papers in the trash. "That seems fair to me," confirms Hannah encouragingly. While collecting Michael's scraps, Wendy comes across a corner of a piece of paper with part of a math problem written on it. There is a monic polynomial of degree $n$, with real coefficients. The first two terms after $x^n$ are $a_{n-1}x^{n-1}$ and $a_{n-2}x^{n-2}$, but the rest of the polynomial is cut off where Michael's page is ripped. Wendy barely makes out a little of Michael's scribbling, showing that $a_{n-1}=-a_{n-2}$. Wendy deciphers the goal of the problem, which is to find the sum of the squares of the roots of the polynomial. Wendy knows neither the value of $n$, nor the value of $a_{n-1}$, but still she finds a [greatest] lower bound for the answer to the problem. Find the absolute value of that lower bound.

Determine all integers $a$ for which the equation \[x^{2}+axy+y^{2}=1\] has infinitely many distinct integer solutions $x, \;y$.

It is known that the equation$ |x - 1| + |x - 2| +... + |x - 2001| = a$ has exactly one solution. Find $a$.

Let $M$ be a finite sum of numbers, such that among any three of its elements there are two whose sum belongs to $M$. Find the greatest possible number of elements of $M$.

Let $F(x,y)$ and $G(x,y)$ be relatively prime homogeneous polynomials of degree at least one having integer coefficients. Prove that there exists a number $c$ depending only on the degrees and the maximum of the absolute values of the coefficients of $F$ and $G$ such that $F(x,y)\neq G(x,y)$ for any integers $x$ and $y$ that are relatively prime and satisfy $\max \{ |x|,|y|\} > c$. [K. Gyory]

Let $p(x) = a_{21} x^{21} + a_{20} x^{20} + \dots + a_1 x + 1$ be a polynomial with integer coefficients and real roots such that the absolute value of all of its roots are less than $1/3$, and all the coefficients of $p(x)$ are lying in the interval $[-2019a,2019a]$ for some positive integer $a$. Prove that if this polynomial is reducible in $\mathbb{Z}[x]$, then the coefficients of one of its factors are less than $a$. [i]Submitted by Navid Safaei, Tehran, Iran[/i]

Consider the determinant of the matrix $(a_{ij})_{ij}$ with $1\leq i,j \leq 100$ and $a_{ij}=ij.$ Prove that if the absolute value of each of the $100!$ terms in the expansion of this determinant is divided by $101,$ then the remainder is always $1.$

Let $a,b,c$ be distinct real numbers such that $a+b+c>0$. Let $M$ be the set of $3\times 3$ matrices with the property that each line and each column contain all given numbers $a,b,c$. Find $\{\max \{ \det A \mid A \in M \}$ and the number of matrices which realise the maximum value. [i]Mircea Becheanu[/i]

Each integer is colored with one of two colors, red or blue. It is known that, for every finite set $A$ of consecutive integers, the absolute value of the difference between the number of red and blue integers in the set $A$ is at most $1000$. Prove that there exists a set of $2000$ consecutive integers in which there are exactly $1000$ red numbers and $1000$ numbers blue.

Suppose we have a simple polygon (that is it does not intersect itself, but not necessarily convex). Show that this polygon has a diameter which is completely inside the polygon and the two arcs it creates on the polygon perimeter (the two arcs have 2 vertices in common) both have at least one third of the vertices of the polygon.

Let be five nonzero complex numbers having the same absolute value and such that zero is equal to their sum, which is equal to the sum of their squares. Prove that the affixes of these numbers in the complex plane form a regular pentagon. [i]Daniel Jinga[/i]

How many real solutions are there to the equation $ |x \minus{} |2x \plus{} 1\parallel{} \equal{} 3.$ (Here, $ |x|$ denotes the absolute value of $ x$: i.e., if $ x \geq 0,$ then $ |x| \equal{} |\minus{}x| \equal{} x.$) A. 0 B. 1 C. 2 D. 3 E. 4

Which of the following equations does NOT have a solution? $\textbf{ (A) }\:(x+7)^2=0$ $\textbf{(B) }\:|-3x|+5=0$ $\textbf{ (C) }\:\sqrt{-x}-2=0$ $\textbf{ (D) }\:\sqrt{x}-8=0$ $\textbf{ (E) }\:|-3x|-4=0 $

If $a, b, c$ are non-zero reals, prove that $|\frac{b} {a}-\frac{b} {c}|+|\frac{c} {a}-\frac{c}{b}|+|bc+1|>1$.

An ordered pair $( b , c )$ of integers, each of which has absolute value less than or equal to five, is chosen at random, with each such ordered pair having an equal likelihood of being chosen. What is the probability that the equation $x^ 2 + bx + c = 0$ will [i]not[/i] have distinct positive real roots? $\textbf{(A) }\frac{106}{121}\qquad\textbf{(B) }\frac{108}{121}\qquad\textbf{(C) }\frac{110}{121}\qquad\textbf{(D) }\frac{112}{121}\qquad\textbf{(E) }\text{none of these}$

Determine the sum of absolute values for the complex roots of $ 20 x^8 \plus{} 7i x^7 \minus{}7ix \plus{} 20.$

Given that $|3-a| = 2$, compute the sum of all possible values of $a$.