Compute the number of positive integers less than or equal to $10000$ which are relatively prime to $2014$.

SQUARING OFF: Master Chief and Samus Aran take turns firing rockets at one another from across the Cartesian plane. Master Chief’s movement is restricted to lattice points within the $10\times 10$ square with vertices $(0,0)$, $(0,10)$, $(10,0)$, and $(10,10)$, while Samus Aran’s movement is restricted to lattice points inside the $10\times 10$ square with vertices $(0,0)$, $(-10,0)$, $(0,-10)$, and $(-10,-10)$. Neither player can be located on or beyond the border of his or her square. Both players randomly choose a lattice point at which they begin the game, and do not move the rest of the game (until either they are killed or kill the other player). Each player’s turn consists of firing a rocket, targeted at a specific undestroyed lattice point inside the border of the opponent’s movement square, which hits immediately. When a rocket hits its intended lattice point, it explodes, destroying the surrounding $3\times 3$ square ($8$ additional adjacent lattice points). The game ends when one player is hit by a rocket (when the player is located within the $3\times 3$ grid hit by a rocket). If the highest possible probability that Samus Aran wins the game in three turns or less, assuming Master Chief goes first, is expressed as $a/b$, where $a$ and $b$ are relatively prime integers, find $a+b$.

$(BEL 6)$ Evaluate $\left(\cos\frac{\pi}{4} + i \sin\frac{\pi}{4}\right)^{10}$ in two different ways and prove that $\dbinom{10}{1}-\dbinom{10}{3}+\frac{1}{2}\dbinom{10}{5}=2^4$

Let $ f(x)$ be a monic polynomial of degree $ 1991$ with integer coefficients. Define $ g(x) \equal{} f^2(x) \minus{} 9.$ Show that the number of distinct integer solutions of $ g(x) \equal{} 0$ cannot exceed $ 1995.$

The value of $\frac{1998- 998}{1000}$ is $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 1000 \qquad \textbf{(C)}\ 0.1 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ 0.001$

Three circles $\omega_1$, $\omega_2$, $\omega_3$ are given. Let $A_0$ and $A_1$ be the common points of $\omega_1$ and $\omega_2$, $B_0$ and $B_1$ be the common points of $\omega_2$ and $\omega_3$, $C_0$ and $C_1$ be the common points of $\omega_3$ and $\omega_1$. Let $O_{i,j,k}$ be the circumcenter of triangle $A_iB_jC_k$. Prove that the four lines of the form $O_{ijk}O_{1 - i,1 - j,1 - k}$ are concurrent or parallel.

A convex pentagon $ABCDE$ is given in the coordinate plane with all vertices in lattice points. Prove that there must be at least one lattice point in the pentagon determined by the diagonals $AC$, $BD$, $CE$, $DA$, $EB$ or on its boundary.

Prove the inequality [b]a.)[/b] $ \left( a_{1}+a_{2}+...+a_{k}\right) ^{2}\leq k\left( a_{1}^{2}+a_{2}^{2}+...+a_{k}^{2}\right) , $ where $k\geq 1$ is a natural number and $a_{1},$ $a_{2},$ $...,$ $a_{k}$ are arbitrary real numbers. [b]b.)[/b] Using the inequality (1), show that if the real numbers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ satisfy the inequality \[ a_{1}+a_{2}+...+a_{n}\geq \sqrt{\left( n-1\right) \left( a_{1}^{2}+a_{2}^{2}+...+a_{n}^{2}\right) }, \] then all of these numbers $a_{1},$ $a_{2},$ $\ldots,$ $a_{n}$ are non-negative.

Let $ P$ be a point in triangle $ ABC$, and define $ \alpha,\beta,\gamma$ as follows: \[ \alpha\equal{}\angle BPC\minus{}\angle BAC, \quad \beta\equal{}\angle CPA\minus{}\angle \angle CBA, \quad \gamma\equal{}\angle APB\minus{}\angle ACB.\] Prove that \[ PA\dfrac{\sin \angle BAC}{\sin \alpha}\equal{}PB\dfrac{\sin \angle CBA}{\sin \beta}\equal{}PC\dfrac{\sin \angle ACB}{\sin \gamma}.\]

a) Show that you can divide an angle $\theta$ to three equal parts using compass and ruler if and only if the polynomial $4t^3-3t-\cos (\theta)$ is reducible over $\mathbb{Q}(\cos (\theta))$. b) Is it always possible to divide an angle into five equal parts?

When finding the sum $\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}+\frac{1}{7}$, the least common denominator used is $\text{(A)}\ 120 \qquad \text{(B)}\ 210 \qquad \text{(C)}\ 420 \qquad \text{(D)}\ 840 \qquad \text{(E)}\ 5040$

Suppose we have a $8\times8$ chessboard. Each edge have a number, corresponding to number of possibilities of dividing this chessboard into $1\times2$ domino pieces, such that this edge is part of this division. Find out the last digit of the sum of all these numbers. (Day 1, 3rd problem author: Michal Rolínek)

Let $n\geq2$ be a positive integer, with divisors $1=d_1<d_2<\,\ldots<d_k=n$. Prove that $d_1d_2+d_2d_3+\,\ldots\,+d_{k-1}d_k$ is always less than $n^2$, and determine when it is a divisor of $n^2$.

Determine the largest positive integer $k$ for which there exists a simple graph $G$ of $2014$ vertices that simultaneously satisfies the following conditions: $a)$ $G$ does not contain triangles $b)$ For each $i$ between $1$ and $k$, inclusive, at least one vertex of $G$ has degree $i$ $c)$ No vertex of $G$ has a degree greater than $k$

Tita the Frog sits on the number line. She is initially on the integer number $k>1$. If she is sitting on the number $n$, she hops to the number $f(n)+g(n)$, where $f(n)$ and $g(n)$ are, respectively, the biggest and smallest positive prime numbers that divide $n$. Find all values of $k$ such that Tita can hop to infinitely many distinct integers.

$ (a)$ The rectangle $ PQRS$ with $ PQ\equal{}l$ and $ QR\equal{}m$ $ (l,m \in \mathbb{N})$ is divided into $ lm$ unit squares. Prove that the diagonal $ PR$ intersects exactly $ l\plus{}m\minus{}d$ of these squares, where $ d\equal{}(l,m)$. $ (b)$ A box with edge lengths $ l,m,n \in \mathbb{N}$ is divided into $ lmn$ unit cubes. How many of the cubes does a main diagonal of the box intersect?

Find all possible $\{ x_1,x_2,...x_n \}$ permutations of $ \{1,2,...,n \}$ so that when $1\le i \le n-2 $ then we have $x_i < x_{i+2}$ and when $1 \le i \le n-3$ then we have $x_i < x_{i+3}$ . Here $n \ge 4$.

Suppose that $x$ is measured in radians. Find the maximum value of \[\frac{\sin2x+\sin4x+\sin6x}{\cos2x+\cos4x+\cos6x}\] for $0\le x\le \frac{\pi}{16}$

The prime numbers $a,b$ and $c$ are such that $a+b^2=4c^2$. Determine the sum of all possible values of $a+b+c$.

Let $n$ be a natural number and $p, q$ be prime numbers such that the following statements hold: $$pq | n^p + 2$$ $$n + 2 | n^p + q^p.$$ Show that there is a natural number $m$ such that $q|4^mn + 2$ holds.

Two different squares are randomly chosen from an $8\times8$ chessboard. What is the probability that two queens placed on the two squares can attack each other? Recall that queens in chess can attack any square in a straight line vertically, horizontally, or diagonally from their current position.

[asy] draw((3,-13)--(21.5,-5)--(19,-18)--(9,-18)--(10,-6)--(23,-14.5)--cycle); label("A",(3,-13),W);label("C",(21.5,-5),N);label("E",(19,-18),E);label("F",(9,-18),W);label("B",(10,-6),N);label("D",(23,-14.5),E); //Credit to Zimbalono for the diagram[/asy] If the sum of the measures in degrees of angles $A,~B,~C,~D,~E$ and $F$ in the figure above is $90n$, then $n$ is equal to $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }4\qquad\textbf{(D) }5\qquad\textbf{(E) }6$

Prove that $ \forall n > 1, n \in \mathbb{N}$ the equation \[ \sum^n_{k\equal{}1} \frac{x^k}{k!} \plus{} 1 \equal{} 0\] has no rational roots.

Consider a sequence of polynomials $P_0(x), P_1(x), P_2(x), \ldots, P_n(x), \ldots$, where $P_0(x) = 2, P_1(x) = x$ and for every $n \geq 1$ the following equality holds: \[P_{n+1}(x) + P_{n-1}(x) = xP_n(x).\] Prove that there exist three real numbers $a, b, c$ such that for all $n \geq 1,$ \[(x^2 - 4)[P_n^2(x) - 4] = [aP_{n+1}(x) + bP_n(x) + cP_{n-1}(x)]^2.\]

In how many zeroes does the number $\dfrac{2002!}{(1001!)^2}$ end? $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }200\qquad\textbf{(E) }400$