In the sequence $ 2001, 2002, 2003, \ldots$, each term after the third is found by subtracting the previous term from the sum of the two terms that precede that term. For example, the fourth term is $ 2001 \plus{} 2002 \minus{} 2003 \equal{} 2000$. What is the $ 2004^\text{th}$ term in this sequence? $ \textbf{(A)} \minus{} \! 2004 \qquad \textbf{(B)} \minus{} \! 2 \qquad \textbf{(C)}\ 0 \qquad \textbf{(D)}\ 4003 \qquad \textbf{(E)}\ 6007$

Given that $0 < a < b < c < d$, which of the following is the largest? $\textbf{(A)}\ \frac{a\plus{}b}{c\plus{}d} \qquad \textbf{(B)}\ \frac{a\plus{} d}{b\plus{} c} \qquad \textbf{(C)}\ \frac{b\plus{} c}{a\plus{}d}\qquad \textbf{(D)}\ \frac{b\plus{} d}{a\plus{} c} \qquad \textbf{(E)}\ \frac{c\plus{} d}{a\plus{}b}$

Ann and Max play a game on a $100 \times 100$ board. First, Ann writes an integer from 1 to 10 000 in each square of the board so that each number is used exactly once. Then Max chooses a square in the leftmost column and places a token on this square. He makes a number of moves in order to reach the rightmost column. In each move the token is moved to a square adjacent by side or vertex. For each visited square (including the starting one) Max pays Ann the number of coins equal to the number written in that square. Max wants to pay as little as possible, whereas Ann wants to write the numbers in such a way to maximise the amount she will receive. How much money will Max pay Ann if both players follow their best strategies? [i]Lev Shabanov[/i]

For which $n\in\{3900, 3901,\cdots, 3909\}$ can the set $\{1, 2, . . . , n\}$ be partitioned into (disjoint) triples in such a way that in each triple one of the numbers equals the sum of the other two?

Let $n$ be an arbitrary positive integer. (a) For every positive integers $a$ and $b$, show that $gcd(n^a + 1, n^b + 1) \le n^{gcd(a,b)} + 1$. (b) Show that there exist infinitely many composite pairs ($a, b)$, such that each of them is not a multiply of the other number and equality holds in (a).

Take a point $O$ inside $\Delta A B C$ such that $\angle B O C=90^{\circ}$, $\angle C A O=\angle A B O$, $\angle B A O=\angle B C O .$ Find the value of $\frac{A C}{O C}$ [list=1] [*] $\sqrt{2}$ [*] $\sqrt{\frac{3}{2}}$ [*] 2 [*] None of these [/list]

In a convex quadrilateral $ABCD$, $P$ and $Q$ are points on sides $BC$ and $DC$ such that $B\hat{A}P = D\hat{A}Q$. If the line that passes through the orthocenters of $\triangle ABP$ and $\triangle ADQ$ is perpendicular to $AC$, prove that the area of these triangles are equals.

In triangle $ABC$, points $D, E$, and $F$ are marked on sides $AC, BC$, and $AB$ respectively, so that $AD = AB$, $EC = DC$, $BF = BE$. After that, they erased everything except points $E, F$ and $D$. Reconstruct the triangle $ABC$ (no study required).

Let $\omega_1$ and $\omega_2$ be two circles intersecting at distinct points $A$ and $B.$ Point $X$ varies along $\omega_1,$ and point $Y$ is chosen on $\omega_2$ such that $AB$ bisects angle $\angle{XAY}.$ Prove that as $X$ varies along $\omega_1,$ the circumcenter of $\triangle{AXY}$ (if it exists) varies along a fixed line.

Construct a set $S$ of polynomials inductively by the rules: (i) $x\in S$; (ii) if $f(x)\in S$, then $xf(x)\in S$ and $x+(1-x)f(x)\in S$. Prove that there are no two distinct polynomials in $S$ whose graphs intersect within the region $\{0 < x < 1\}$.

Let $S$ be the incenter of triangle $ABC$. $A_1, B_1, C_1$ are the intersections of $AS, BS, CS$ with the circumcircle of triangle $ABC$ respectively. Prove that $SA_1 + SB_1 + SC_1 \geq SA + SB + SC.$

Suppose that $a, b, c, A, B, C$ are real numbers, $a \not= 0$ and $A \not= 0$, such that \[|ax^2+ bx + c| \le |Ax^2+ Bx + C|\] for all real numbers $x$. Show that \[|b^2- 4ac| \le |B^2- 4AC|\]

Rectangle $ABCD$ has $AB=6$ and $BC=3$. Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$. What is the degree measure of $\angle AMD$? $ \textbf{(A)}\ 15 \qquad \textbf{(B)}\ 30 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 60 \qquad \textbf{(E)}\ 75 $

$ABCD$ is inscribed. Bisector of angle between diagonals intersect $AB$ anc $CD$ at $X$ and $Y$. $M,N$ are midpoints of $AD,BC$. $XM=YM$ Prove, that $XN=YN$.

Let $a,b, c > 0$ and $abc = 1$. Prove that $\frac{a - 1}{c}+\frac{c - 1}{b}+\frac{b - 1}{a} \ge 0$

Let $\vartriangle ABC$ be an isosceles triangle with $\angle BAC = 100^o$. Let $D, E$ be points on ray $\overrightarrow{AB}$ so that $BC = AD = BE$. Show that $BC \cdot DE = BD \cdot CE$

Paul owes Paula $35$ cents and has a pocket full of $5$-cent coins, $10$-cent coins, and $25$-cent coins that he can use to pay her. What is the difference between the largest and the smallest number of coins he can use to pay her? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad \textbf{(E) }5$

Let $M$ be the intersection of two diagonal, $AC$ and $BD$, of a rhombus $ABCD$, where angle $A<90^\circ$. Construct $O$ on segment $MC$ so that $OB<OC$ and let $t=\frac{MA}{MO}$, provided that $O \neq M$. Construct a circle that has $O$ as centre and goes through $B$ and $D$. Let the intersections between the circle and $AB$ be $B$ and $X$. Let the intersections between the circle and $BC$ be $B$ and $Y$. Let the intersections of $AC$ with $DX$ and $DY$ be $P$ and $Q$, respectively. Express $\frac{OQ}{OP}$ in terms of $t$.

For finite sets $A$ and $B$, call a function $f: A \rightarrow B$ an \emph{antibijection} if there does not exist a set $S \subseteq A \cap B$ such that $S$ has at least two elements and, for all $s \in S$, there exists exactly one element $s'$ of $S$ such that $f(s')=s$. Let $N$ be the number of antibijections from $\{1,2,3, \ldots 2018 \}$ to $\{1,2,3, \ldots 2019 \}$. Suppose $N$ is written as the product of a collection of (not necessarily distinct) prime numbers. Compute the sum of the members of this collection. (For example, if it were true that $N=12=2\times 2\times 3$, then the answer would be $2+2+3=7$.) [i]Proposed by Ankit Bisain[/i]

Prove that for each $ n$: \[ \sum_{k\equal{}1}^n\binom{n\plus{}k\minus{}1}{2k\minus{}1}\equal{}F_{2n}\]

On two intersecting roads with equal constant speeds Audi and BMW cars are moving fast. It turned out that as in 17.00, and at 18.00 the BMW was twice as far from the intersection, than ''Audi''. At what time could an Audi drive across the river?

Prove that the plane is not a union of the inner regions of finitely many parabolas. (The outer region of a parabola is the union of the lines not intersecting the parabola. The inner region of a parabola is the set of points of the plane that do not belong to the outer region of the parabola)

Consider an acute non-isosceles triangle. In a single step it is allowed to cut any one of the available triangles into two triangles along its median. Is it possible that after a finite number of cuttings all triangles will be isosceles? [i]Proposed by E. Bakaev[/i]

Let $ ABC $ be an obtuse triangle with $ AB=AC, M $ the symmetric point of $ A $ with respect to $ C, $ and $ P $ the intersection of the line $ AB $ with the perpendicular bisector of the segment $ \overline{AB} . $ Knowing that $ PM $ is perpendicular to $ BC, $ show that $ APM $ is equilateral.

Given a positive integer $n \ge 2$, let $\mathcal{P}$ and $\mathcal{Q}$ be two sets, each consisting of $n$ points in three-dimensional space. Suppose that these $2n$ points are distinct. Show that it is possible to label the points of $\mathcal{P}$ as $P_1,P_2,\dots,P_n$ and the points of $\mathcal{Q}$ as $Q_1,Q_2,\dots,Q_n$ such that for any indices $i$ and $j$, the balls of diameters $P_iQ_i$ and $P_jQ_j$ have at least one common point.