Find the smallest positive integer $n\neq 2004$ for which there exists a polynomial $f\in\mathbb{Z}[x]$ such that the equation $f(x)=2004$ has at least one, and the equation $f(x)=n$ has at least $2004$ different integer solutions.

A point $ P$ is selected at random from the interior of the pentagon with vertices $ A \equal{} (0,2)$, $B \equal{} (4,0)$, $C \equal{} (2 \pi \plus{} 1, 0)$, $D \equal{} (2 \pi \plus{} 1,4)$, and $ E \equal{} (0,4)$. What is the probability that $ \angle APB$ is obtuse? [asy] size(150); pair A, B, C, D, E; A = (0,1.5); B = (3,0); C = (2 *pi + 1, 0); D = (2 * pi + 1,4); E = (0,4); draw(A--B--C--D--E--cycle); label("$A$", A, dir(180)); label("$B$", B, dir(270)); label("$C$", C, dir(0)); label("$D$", D, dir(0)); label("$E$", E, dir(180)); [/asy] $ \displaystyle \textbf{(A)} \ \frac {1}{5} \qquad \textbf{(B)} \ \frac {1}{4} \qquad \textbf{(C)} \ \frac {5}{16} \qquad \textbf{(D)} \ \frac {3}{8} \qquad \textbf{(E)} \ \frac {1}{2}$

Let $ I$ be the incenter of triangle $ ABC$, and let $ A_1$, $ B_1$, $ C_1$ be arbitrary points on the segments $ (AI)$, $ (BI)$, $ (CI)$, respectively. The perpendicular bisectors of $ AA_1$, $ BB_1$, $ CC_1$ intersect each other at $ A_2$, $ B_2$, and $ C_2$. Prove that the circumcenter of the triangle $ A_2B_2C_2$ coincides with the circumcenter of the triangle $ ABC$ if and only if $ I$ is the orthocenter of triangle $ A_1B_1C_1$.

Let $ABC$ and $PQR$ be two triangles such that [list] [b](a)[/b] $P$ is the mid-point of $BC$ and $A$ is the midpoint of $QR$. [b](b)[/b] $QR$ bisects $\angle BAC$ and $BC$ bisects $\angle QPR$ [/list] Prove that $AB+AC=PQ+PR$.

Square with side 100 was cut by 99 horizontal and 99 vertical lines into 10000 rectangles (not necessarily with integer sides). How many rectangles in this square with area not exceeding 1 at least can be?

We reflected each vertex of a triangle on the opposite side. Prove that the area of the triangle formed by these three reflection points is smaller than the area of the initial triangle multiplied by five.

Find all positive integers $n$, for which there exists a positive integer $k$ such that for every positive divisor $d$ of $n$, the number $d - k$ is also a (not necessarily positive) divisor of $n$.

Let $ABCD$ be a rectangle. We consider the points $E\in CA,F\in AB,G\in BC$ such that $DC\perp CA,EF\perp AB$ and $EG\perp BC$. Solve in the set of rational numbers the equation $AC^x=EF^x+EG^x$.

Let $AD$ be the altitude, $AE$ be the median, and $O$ be the circumcenter of a triangle $ABC.$ Points $X$ and $Y$ are selected inside the triangle such that $\angle BAX=\angle CAY,$ $OX\perp AX,$ and $OY\perp AY.$ Prove that points $D,E,X,Y$ are concyclic. (M. Kurskiy)

A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$. (a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?

Fix $2n$ distinct reals $x_1,y_1,...,x_n,y_n$ and dene the $n\times n$ matrix where its $(i, j)$-th element is $x_i + y_j$ for all $i, j = 1,..., n$. Show that if the products of the numbers in each column is always the same, then also the products of the numbers in each row is always the same. ( Alberto Alfarano)

Prove that among any five distinct rays $ Ox$, $ Oy$, $ Oz$, $ Ot$, $ Or$ in space there exist two which form an angle less than or equal to $ 90^{\circ}$.

In an acute triangle $ABC$ the angle $C$ is greater than the angle $A$. Let $AE$ be a diameter of the circumcircle of the triangle. Let the intersection point of the ray $AC$ and the tangent of the circumcircle through the vertex $B$ be $K$. The perpendicular to $AE$ through $K$ intersects the circumcircle of the triangle $BCK$ for the second time at point $D$. Prove that $CE$ bisects the angle $BCD$.

Take an arbitrary point $D$ on side $BC$ of triangle $ABC$ and draw a circle through point $D$ and the centers of the circles inscribed in triangles $ABD$ and $ACD$. Prove that all circles obtained for different points $D$ of side $BC$ have a common point.

Suppose $P(x)$ is a cubic polynomial with integer coefficients such $P(\sqrt{5})=5$ and $P(\sqrt[3]{5})=5\sqrt[3]{5}$.

We divide up the plane into disjoint regions using a circle, a rectangle and a triangle. What is the greatest number of regions that we can get?

What conditions should real numbers $ a $, $ b $, $ c $, $ d $, $ e $, $ f $ meet in order for a polynomial of second degree $$ax^2 + 2bxy + cy^2 + 2dx + 2ey + f$$ was the product of two first degree polynomials with real coefficients ?

There are $n$ people arranged in a circle, and $n^{n^n}$ coins are distributed among them, where each person has at least $n^n$ coins. Each person is then assigned a random index number in $\{1,2,...n\}$ such that no two people have the same number. Then every minute, if $i$ is the number of minutes passed, the person with index number congruent to $i$ mod $n$ will give a coin to the person on his left or right. After some time, everyone has the same number of coins. For what $n$ is this always possible, regardless of the original distribution of coins and index numbers? [i](Proposed by Ho Janson)[/i]

Let $ABC$ be a triangle. Four distinct points $D,A,B,E$ lie on the line $AB$ in this order such that $DA=AB=BE.$ Find necessary and sufficient condition for lengths $a=BC,b=AC$ such that the angle $\angle DCE$ is right.

Let $ f \ne 0$ be a polynomial with real coefficients. Define the sequence $ f_{0}, f_{1}, f_{2}, \ldots$ of polynomials by $ f_{0}= f$ and $ f_{n+1}= f_{n}+f_{n}'$ for every $ n \ge 0$. Prove that there exists a number $ N$ such that for every $ n \ge N$, all roots of $ f_{n}$ are real.

Find $x$ such that \[2010^{\log_{10}x}=11^{\log_{10}(1+3+5+\cdots +4019).}\]

Two vector fields $\mathbf{F},\mathbf{G}$ are defined on a three dimensional region $W=\{(x,y,z)\in\mathbb{R}^3 : x^2+y^2\leq 1, |z|\leq 1\}$. $$\mathbf{F}(x,y,z) = (\sin xy, \sin yz, 0),\quad \mathbf{G} (x,y,z) = (e^{x^2+y^2+z^2}, \cos xz, 0)$$ Evaluate the following integral. \[\iiint_{W} (\mathbf{G}\cdot \text{curl}(\mathbf{F}) - \mathbf{F}\cdot \text{curl}(\mathbf{G})) dV\]

An equilateral triangle with side 101 is placed on a plane so that one of its sides is horizontal and the triangle is above it. It is divided into smaller equilateral triangles with side 1 by segments parallel to its sides. All sides of these smaller triangles are colored red (including the entire border of the large triangle). An equilateral triangle on a plane is called a "mirror" triangle if its sides are parallel to the sides of the original triangle, but it lies below its horizontal side. What is the smallest number of contours of mirror triangles needed to cover all the red segments? (Mirror triangles may overlap and extend beyond the original triangle.) [i]Proposed by Dmitry Shiryayev[/i]

Sigfried is singing the ABC’s $100$ times straight, for some reason. It takes him $20$ seconds to sing the ABC’s once, and he takes a $5$ second break in between songs. Normally, he sings the ABC’s without messing up, but he gets fatigued when singing correctly repeatedly. For any song, if he sung the previous three songs without messing up, he has a $\frac12$ chance of messing up and taking $30$ seconds for the song instead. What is the expected number of minutes it takes for Sigfried to sing the ABC’s $100$ times? Round your answer to the nearest minute.

Inside the circle $ S $ there is a circle $ T $ and circles $ K_1, K_2, \ldots, K_n $ tangent externally to $ T $ and internally to $ S $, and the circle $ K_1 $ is tangent to $ K_2 $, $ K_2 $ tangent to $ K_3 $ etc. Prove that the points of tangency of the circles $ K_1 $ with $ K_2 $, $ K_2 $ with $ K_3 $ etc. lie on the circle.