What is the sum of the reciprocals of the roots of the equation \[ \frac {2003}{2004}x \plus{} 1 \plus{} \frac {1}{x} \equal{} 0? \] $ \textbf{(A)}\ \minus{}\! \frac {2004}{2003} \qquad \textbf{(B)}\ \minus{} \!1 \qquad \textbf{(C)}\ \frac {2003}{2004} \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ \frac {2004}{2003}$

Find the smallest positive integer $n$ for which the polynomial \[x^n-x^{n-1}-x^{n-2}-\cdots -x-1\] has a real root greater than $1.999$. [i]Proposed by James Lin

There are 2008 congruent circles on a plane such that no two are tangent to each other and each circle intersects at least three other circles. Let $ N$ be the total number of intersection points of these circles. Determine the smallest possible values of $ N$.

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ that satisfy \[ f(x^2-y)+2yf(x)=f(f(x))+f(y) \] for all $x,y\in\mathbb{R}$. [i]Proposed by Carl Schildkraut[/i]

A square region of side $12$ contains a water source that supplies an irrigation system constituted by several straight channels forming polygonal lines. Considers the source as a point and each channel as a line segment. Knowing that a point is irrigated if it is not more than $1$ distance from any channel and that the system was designed so that the entire region is irrigated, proves that the total length of irrigation channels exceeds $70$.

Compute the sum of the positive divisors (including $1$) of $9!$ that have units digit $1.$

a) In $XYZ$ triangle, the incircle touches $XY$ and $XZ$ in $T$ and $W$, respectively. Prove that: $$XT=XW=\frac{XY+XZ-YZ}2$$ Let $ABC$ a triangle and $D$ the foot of the perpendicular of $A$ in $BC$. Let $I$, $J$ be the incenters of $ABD$ and $ACD$, respectively. The incircles of $ABD$ and $ACD$ touch $AD$ in $M$ and $N$, respectively. Let $P$ be where the incircle of $ABC$ touches $AB$. The circle with centre $A$ and radius $AP$ intersects $AD$ in $K$. b) Show that $\triangle IMK \cong \triangle KNJ$. c) Show that $IDJK$ is cyclic.

It is about deciphering the code $C_1C_2C_3C_4$ in which each letter is one of the colors: white $(B)$, blue $(A)$, red $(R)$, green $(V)$, black $(N)$ and brown $(C)$ with allowed repetitions. Four were made attempts to decipher it. $NAVB$ and $ACRC$ have two color hits, but in wrong places. $RBAC$ and $VRBA$ have one color match in the correct place, and two other color matches, in places incorrect. Determine all combinations compatible with the information.

Angle bisectors $AA', BB'$and $CC'$ are drawn in triangle $ABC$ with angle $\angle B= 120^o$. Find $\angle A'B'C'$.

The chords $AB$ and $CD$ of a circle intersect at $M$, which is the midpoint of the chord $PQ$. The points $X$ and $Y$ are the intersections of the segments $AD$ and $PQ$, respectively, and $BC$ and $PQ$, respectively. Show that $M$ is the midpoint of $XY$.

Consider an isosceles triangle $KL_1L_2$ with $|KL_1|=|KL_2|$ and let $KA, L_1B_1,L_2B_2$ be its angle bisectors. Prove that $\cos \angle B_1AB_2 < \frac35$

Let $ABCD$ be a parallelogram. Let $W, X, Y,$ and $Z$ be points on sides $AB, BC, CD,$ and $DA$, respectively, such that the incenters of triangles $AWZ, BXW, CYX,$ and $DZY$ form a parallelogram. Prove that $WXYZ$ is a parallelogram.

In a country there are $2014$ airports, no three of them lying on a line. Two airports are connected by a direct flight if and only if the line passing through them divides the country in two parts, each with $1006$ airports in it. Show that there are no two airports such that one can travel from the first to the second, visiting each of the $2014$ airports exactly once.

Through an arbitrary point inside a triangle, lines parallel to the sides of the triangle are drawn, dividing the triangle into three triangles with areas $T_1,T_2,T_3$ and three parallelograms. If $T$ is the area of the original triangle, prove that $$T=(\sqrt{T_1}+\sqrt{T_2}+\sqrt{T_3})^2$$ .

Let $n$ be a positive integer. Let $T_n$ be a set of positive integers such that: \[{T_n={ \{11(k+h)+10(n^k+n^h)| (1 \leq k,h \leq 10)}}\}\] Find all $n$ for which there don't exist two distinct positive integers $a, b \in T_n$ such that $a\equiv b \pmod{110}$

Determine all triples $(x, y, z)$ of non-zero numbers such that \[ xy(x + y) = yz(y + z) = zx(z + x). \]

Mary is about to pay for five items at the grocery store. The prices of the items are $ \$$7.99, $ \$$ 4.99, $ \$$2.99, $ \$$1.99, and $ \$$0.99. Mary will pay with a twenty-dollar bill. Which of the following is closest to the percentage of the $ \$$20.00 that she will receive in change? $ \textbf{(A) } 5 \qquad \textbf{(B) } 10 \qquad \textbf{(C) } 15 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 25$

For how many integer $ n$, $ P \equal{} n^4 \plus{} 4n^3 \plus{} 3n^2 \minus{} 2n \plus{} 7$ is prime? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{Infinitely many}$

Let $ S$ be a finite set of points in the plane such that no three of them are on a line. For each convex polygon $ P$ whose vertices are in $ S$, let $ a(P)$ be the number of vertices of $ P$, and let $ b(P)$ be the number of points of $ S$ which are outside $ P$. A line segment, a point, and the empty set are considered as convex polygons of $ 2$, $ 1$, and $ 0$ vertices respectively. Prove that for every real number $ x$ \[\sum_{P}{x^{a(P)}(1 \minus{} x)^{b(P)}} \equal{} 1,\] where the sum is taken over all convex polygons with vertices in $ S$. [i]Alternative formulation[/i]: Let $ M$ be a finite point set in the plane and no three points are collinear. A subset $ A$ of $ M$ will be called round if its elements is the set of vertices of a convex $ A \minus{}$gon $ V(A).$ For each round subset let $ r(A)$ be the number of points from $ M$ which are exterior from the convex $ A \minus{}$gon $ V(A).$ Subsets with $ 0,1$ and 2 elements are always round, its corresponding polygons are the empty set, a point or a segment, respectively (for which all other points that are not vertices of the polygon are exterior). For each round subset $ A$ of $ M$ construct the polynomial \[ P_A(x) \equal{} x^{|A|}(1 \minus{} x)^{r(A)}. \] Show that the sum of polynomials for all round subsets is exactly the polynomial $ P(x) \equal{} 1.$ [i]Proposed by Federico Ardila, Colombia[/i]

For every positive integer $n$, form the number $n/s(n)$, where $s(n)$ is the sum of digits of $n$ in base 10. Determine the minimum value of $n/s(n)$ in each of the following cases: (i) $10 \leq n \leq 99$ (ii) $100 \leq n \leq 999$ (iii) $1000 \leq n \leq 9999$ (iv) $10000 \leq n \leq 99999$

Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ? The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$

Given a real number $ c > 0$, a sequence $ (x_n)$ of real numbers is defined by $ x_{n \plus{} 1} \equal{} \sqrt {c \minus{} \sqrt {c \plus{} x_n}}$ for $ n \ge 0$. Find all values of $ c$ such that for each initial value $ x_0$ in $ (0, c)$, the sequence $ (x_n)$ is defined for all $ n$ and has a finite limit $ \lim x_n$ when $ n\to \plus{} \infty$.

The area of polygon $ ABCDEF$, in square units, is [asy]draw((0,0)--(4,0)--(4,9)--(-2,9)--(-2,4)--(0,4)--cycle); label("A",(-2,9),NW); label("B",(4,9),NE); label("C",(4,0),SE); label("D",(0,0),SW); label("E",(0,4),NE); label("F",(-2,4),SW); label("5",(-2,6.5),W); label("4",(2,0),S); label("9",(4,4.5),E); label("6",(1,9),N); label("All angles in this diagram are right.",(0,-3),S);[/asy] \[ \textbf{(A)}\ 24 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 46 \qquad \textbf{(D)}\ 66 \qquad \textbf{(E)}\ 74 \]

In the acute triangle $ABC$, the bisectors of $A,B$ and $C$ intersect the circumcircle again at $A_1,B_1$ and $C_1$, respectively. Let $M$ be the point of intersection of $AB$ and $B_1C_1$, and let $N$ be the point of intersection of $BC$ and $A_1B_1$. Prove that $MN$ passes through the incentre of $\triangle ABC$.

Determine all functions $f:\mathbb{R}\to\mathbb{Z}$ satisfying the inequality $(f(x))^2+(f(y))^2 \leq 2f(xy)$ for all reals $x,y$.