Consider polynomials $P$ of degree $2015$, all of whose coefficients are in the set $\{0,1,\dots,2010\}$. Call such a polynomial [i]good[/i] if for every integer $m$, one of the numbers $P(m)-20$, $P(m)-15$, $P(m)-1234$ is divisible by $2011$, and there exist integers $m_{20}, m_{15}, m_{1234}$ such that $P(m_{20})-20, P(m_{15})-15, P(m_{1234})-1234$ are all multiples of $2011$. Let $N$ be the number of good polynomials. Find the remainder when $N$ is divided by $1000$. [i]Proposed by Yang Liu[/i]

The number of points in the set $\{(x,y)|\lg(x^3+\frac{1}{3}y^3+\frac{1}{9})=\lg x+\lg y)\}$ is $\text{(A)}0\qquad\text{(B)}1\qquad\text{(C)}2\qquad\text{(D)}$more than $2$

Let $x>0$ be a real number and $A$ a square $2\times 2$ matrix with real entries such that $\det {(A^2+xI_2 )} = 0$. Prove that $\det{ (A^2+A+xI_2) } = x$.

Initially, the number $10$ is written on the board. In each subsequent moves, you can either (i) erase the number $1$ and replace it with a $10$, or (ii) erase the number $10$ and replace it with a $1$ and a $25$ or (iii) erase a $25$ and replace it with two $10$. After sometime, you notice that there are exactly one hundred copies of $1$ on the board. What is the least possible sum of all the numbers on the board at that moment?

In the diagram below, $ABCD$ is a rectangle with side lengths $AB=3$ and $BC=11$, and $AECF$ is a rectangle with side lengths $AF=7$ and $FC=9,$ as shown. The area of the shaded region common to the interiors of both rectangles is $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] pair A, B, C, D, E, F; A = (0,3); B=(0,0); C=(11,0); D=(11,3); E=foot(C, A, (9/4,0)); F=foot(A, C, (35/4,3)); draw(A--B--C--D--cycle); draw(A--E--C--F--cycle); filldraw(A--(9/4,0)--C--(35/4,3)--cycle,gray*0.5+0.5*lightgray); dot(A^^B^^C^^D^^E^^F); label("$A$", A, W); label("$B$", B, W); label("$C$", C, (1,0)); label("$D$", D, (1,0)); label("$F$", F, N); label("$E$", E, S); [/asy]

In the triangle $ABC$, $AD$ is altitude, $M$ is the midpoint of $BC$. It is known that $\angle BAD = \angle DAM = \angle MAC$. Find the values of the angles of the triangle $ABC$

(a) Is it true that, for arbitrary integer $n{}$ greater than $1$ and distinct positive integers $i{}$ and $j$ not greater than $n{}$, the set of any $n{}$ consecutive integers contains distinct numbers $i^{'}$ and $j^{'}$ whose product $i^{'}j^{'}$ is divisible by the product $ij$? (b) Is it true that, for arbitrary integer $n{}$ greater than $2$ and distinct positive integers $i, j, k$ not greater than $n{}$, the set of any $n{}$ consecutive integers contains distinct numbers $i^{'},j^{'},k^{'}$ whose product $i^{'}j^{'}k^{'}$ is divisible by the product $ijk$?

Let $n$ be a positive integer, and consider a sequence $a_1 , a_2 , \dotsc , a_n $ of positive integers. Extend it periodically to an infinite sequence $a_1 , a_2 , \dotsc $ by defining $a_{n+i} = a_i $ for all $i \ge 1$. If \[a_1 \le a_2 \le \dots \le a_n \le a_1 +n \] and \[a_{a_i } \le n+i-1 \quad\text{for}\quad i=1,2,\dotsc, n, \] prove that \[a_1 + \dots +a_n \le n^2. \]

[b]a)[/b] Let $ \bold {u,v,w,} $ be three coplanar vectors of absolute value $ 1. $ Show that there exist $ \varepsilon_1 ,\varepsilon_2, \varepsilon_3\in \{ \pm 1\} $ such that $$ \big| \varepsilon_1\bold u +\varepsilon_2\bold v +\varepsilon_3\bold w \big|\le 1. $$ [b]b)[/b] Give an example of three vectors such that the inequality above does not work for any sclaras from $ \{ \pm 1\} . $

Evaluate: $\lim_{n\rightarrow\infty}\sum_{k=n^2}^{(n+1)^2} \dfrac{1}{\sqrt{k}}$

Find all quadruples of real numbers $(a,b,c,d)$ satisfying the system of equations \[\begin{cases}(b+c+d)^{2010}=3a\\ (a+c+d)^{2010}=3b\\ (a+b+d)^{2010}=3c\\ (a+b+c)^{2010}=3d\end{cases}\]

$ i(L) $ denotes the number of multiplicative binary operations over the set of elements of the finite additive group $ L $ such that the set of elements of $ L, $ along with these additive and multiplicative operations, form a ring. Prove that [b]a)[/b] $ i\left( \mathbb{Z}_{12} \right) =4. $ [b]b)[/b] $ i(A\times B)\ge i(A)i(B) , $ for any two finite commutative groups $ B $ and $ A. $ [b]c)[/b] there exist two sequences $ \left( G_k \right)_{k\ge 1} ,\left( H_k \right)_{k\ge 1} $ of finite commutative groups such that $$ \lim_{k\to\infty }\frac{\# G_k }{i\left( G_k \right)} =0 $$ and $$ \lim_{k\to\infty }\frac{\# H_k }{i\left( H_k \right)} =\infty. $$ [i]Barbu Berceanu[/i]

Let $ ABC$ be an acute triangle, $ CC_1$ its bisector, $ O$ its circumcenter. The perpendicular from $ C$ to $ AB$ meets line $ OC_1$ in a point lying on the circumcircle of $ AOB$. Determine angle $ C$.

Find all natural numbers that can be expressed in a unique way as a sum of five or less perfect squares.

Let $1 \leq n \leq 2021$ be a positive integer. Jack has $2021$ coins arranged in a line where each coin has an $H$ on one side and a $T$ on the other. At the beginning, all coins show $H$ except the nth coin. Jack can repeatedly perform the following operation: he chooses a coin showing $T$, and turns over the coins next to it to the left and to the right (if any). Determine all $n$ such that Jack can make all coins show $T$ after a finite number of operations.

The numbers from 1 to 360 are partitioned into 9 subsets of consecutive integers and the sums of the numbers in each subset are arranged in the cells of a $3 \times 3$ square. Is it possible that the square turns out to be a magic square? Remark: A magic square is a square in which the sums of the numbers in each row, in each column and in both diagonals are all equal.

Let $O$ be a point with three other points $A,B,C$ and $\angle AOB=\angle BOC=\angle AOC=2\pi/3$. Consider the average area of the set of triangles $ABC$ where $OA,OB,OC\in\{3,4,5\}$. The average area can be written in the form $m\sqrt n$ where $m,n$ are integers and $n$ is not divisible by a perfect square greater than $1$. Find $m+n$.

Misha came to country with $n$ cities, and every $2$ cities are connected by the road. Misha want visit some cities, but he doesn`t visit one city two time. Every time, when Misha goes from city $A$ to city $B$, president of country destroy $k$ roads from city $B$(president can`t destroy road, where Misha goes). What maximal number of cities Misha can visit, no matter how president does?

In the diagram below, $A$ and $B$ trisect $DE$, $C$ and $A$ trisect $F G$, and $B$ and $C$ trisect $HI$. Given that $DI = 5$, $EF = 6$, $GH = 7$, find the area of $\vartriangle ABC$. [img]https://cdn.artofproblemsolving.com/attachments/d/5/90334e1bf62c99433be41f3b5e03c47c4d4916.png[/img]

Find $ \sum_{k \in A} \frac{1}{k-1}$ where $A= \{ m^n : m,n \in \mathbb{Z} m,n \geq 2 \} $. Problem was post earlier [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=67&t=29456&hilit=silk+road]here[/url] , but solution not gives and olympiad doesn't indicate, so I post it again :blush: Official solution [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=125&t=365714&p=2011659#p2011659]here[/url]

Find all $f: \mathbb{R} \rightarrow \mathbb{R}$ such that, for all $x,y \in \mathbb{R}-\{0\}$, $$ f(x) \neq 0 \text{ and } \frac{f(x)}{f(y)} + \frac{f(y)}{f(x)} - f \left( \frac{x}{y}-\frac{y}{x} \right) =2 $$

Let $x<y$ be positive real numbers such that $$\sqrt{x}+\sqrt{y}=4 \quad \text{and} \quad \sqrt{x+2}+\sqrt{y+2}=5.$$ Compute $x.$

In $1960$, the oldest of three brothers has an age that is the sum of the of his younger siblings. A few years later, the sum of the ages of two of brothers is double that of the other. A number of years have now passed since $1960$, which is equal to two thirds of the sum of the ages that the three brothers were at that year, and one of them has reached $21$ years. What is the age of each of the others two?

Kostas and Helene have the following dialogue: Kostas: I have in my mind three positive real numbers with product $1$ and sum equal to the sum of all their pairwise products. Helene: I think that I know the numbers you have in mind. They are all equal to $1$. Kostas: In fact, the numbers you mentioned satisfy my conditions, but I did not think of these numbers. The numbers you mentioned have the minimal sum between all possible solutions of the problem. Can you decide if Kostas is right? (Explain your answer).

Does the set of real numbers have a well-order $\prec$ such that the intersection of the subset $\{(x,y) : x\prec y\}$ of the plane with every line is Lebesgue measurable on the line?