To be continuous at $ x \equal{} \minus{} 1$, the value of $ \frac {x^3 \plus{} 1}{x^2 \minus{} 1}$ is taken to be: $ \textbf{(A)}\ \minus{} 2 \qquad\textbf{(B)}\ 0 \qquad\textbf{(C)}\ \frac {3}{2} \qquad\textbf{(D)}\ \infty \qquad\textbf{(E)}\ \minus{} \frac {3}{2}$

DK plays the following game in a simple graph: in each round, he does one of the two operations: ([i]i[/i]) Choose a vertex of odd degree and delete it. Before doing that, DK changes the relation between every two neighbors of the chosen vertex (that is, if they were connected by an edge, then remove this edge, and, if this edge did not exist, then put this edge on the graph). ([i]ii[/i]) Choose a vertex of even degree and change the relation between every two neighbors of it (note that the chosen vertex is not deleted). DK plays this game until there are no more edges on the graph. Show that the number of remaining vertices does not depend on the chosen operations.

Four semicircles of radius $1$ are placed in a square, as shown below. The diameters of these semicircles lie on the sides of the square and each semicircle touches a vertex of the square. Find the absolute difference between the shaded area and the "hatched" area. [asy] import patterns; add("hatch",hatch(1.2mm)); add("checker",checker(2mm)); real r = 1 + sqrt(3); filldraw((0,0)--(r,0)--(r,r)--(0,r)--cycle,gray(0.4),linewidth(1.5)); fill((1,0)--(r,1)--(r-1,r)--(0,r-1)--cycle,white); fill((1,0)--(r,1)--(r-1,r)--(0,r-1)--cycle,pattern("hatch")); filldraw(arc((1,0),1,0,180)--(0,0)--cycle,white,linewidth(1.5)); filldraw(arc((r,1),1,90,270)--(r,0)--cycle,white,linewidth(1.5)); filldraw(arc((r-1,r),1,180,360)--(r,r)--cycle,white,linewidth(1.5)); filldraw(arc((0,r-1),1,270,450)--(0,r)--cycle,white,linewidth(1.5)); [/asy] [i]Proposed by Connor Gordon[/i]

The degree of the polynomial $P(x)$ is $2017.$ Prove that the number of distinct real roots of the equation $P(P(x)) = 0$ is not less than the number of distinct real roots of the equation $P(x) = 0.$

Determine all real numbers $x > 1, y > 1$, and $z > 1$,satisfying the equation $x+y+z+\frac{3}{x-1}+\frac{3}{y-1}+\frac{3}{z-1}=2(\sqrt{x+2}+\sqrt{y+2}+\sqrt{z+2})$

Let $S = \{1,2,3,\dots,2014\}$. What is the largest subset of $S$ that contains no two elements with a difference of $4$ or $7$?

Any of $6$ gossips has her own news. From time to time one of them makes a telephone call to some other gossip and they discuss fill the news they know. What the minimum number of the calls is necessary so as (for) all of them to know all the news?

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

The complete graph with 6 points and 15 edges has each edge colored red or blue. Show that we can find 3 points such that the 3 edges joining them are the same color.

Two integers $0 < k < n$ and distinct real numbers $a_1, a_2, \dots ,a_n$ are given. Define the sets as the following, where all indices are modulo $n$. \begin{align*} A &= \{ 1 \le i \le n : a_i > a_{i-k}, a_{i-1}, a_{i+1}, a_{i+k} \text{ or } a_i < a_{i-k}, a_{i-1}, a_{i+1}, a_{i+k} \} \\ B &= \{ 1 \le i \le n : a_i > a_{i-k}, a_{i+k} \text{ and } a_i < a_{i-1}, a_{i+1} \} \\ C &= \{ 1 \le i \le n ; a_i > a_{i-1}, a_{i+1} \text{ and } a_i < a_{i-k}, a_{i+k} \} \end{align*} Prove that $\lvert A \rvert \ge \lvert B \rvert + \lvert C \rvert$.

Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$

Let $K$ and $L$ be the points on the semicircle with diameter $AB$. Denote intersection of $AK$ and $AL$ as $T$ and let $N$ be the point such that $N$ is on segment $AB$ and line $TN$ is perpendicular to $AB$. If $U$ is the intersection of perpendicular bisector of $AB$ an $KL$ and $V$ is a point on $KL$ such that angles $UAV$ and $UBV$ are equal. Prove that $NV$ is perpendicular to $KL$.

Find the number of nonnegative integers $n$ for which $(n^2 - 3n + 1)^2 + 1$ is a prime number

Find all the pairs of positive integers $(x,p)$ such that p is a prime, $x \leq 2p$ and $x^{p-1}$ is a divisor of $ (p-1)^{x}+1$.

$$F(x)=x^{6}+15x^{5}+85x^{4}+225x^{3}+274x^{2}+120x+1$$

Given is an isosceles trapezoid $ABCD$ with $AB \parallel CD$ and $AB> CD$. The projection from $D$ on $ AB$ is $E$. The midpoint of the diagonal $BD$ is $M$. Prove that $EM$ is parallel to $AC$. (Karl Czakler)

For a prime $p$, a natural number $n$ and an integer $a$, we let $S_n(a,p)$ denote the exponent of $p$ in the prime factorisation of $a^{p^n} - 1$. For example, $S_1(4,3) = 2$ and $S_2(6,2) = 0$. Find all pairs $(n,p)$ such that $S_n(2013,p) = 100$.

The diagram below shows a shaded region bounded by two concentric circles where the outer circle has twice the radius of the inner circle. The total boundary of the shaded region has length $36\pi$. Find $n$ such that the area of the shaded region is $n\pi$. [img]https://cdn.artofproblemsolving.com/attachments/4/5/c9ffdc41c633cc61127ef585a45ee5e6c0f88d.png[/img]

Let $p \ge 2$ be a prime number and $a \ge 1$ a positive integer with $p \neq a$. Find all pairs $(a,p)$ such that: $a+p \mid a^2+p^2$

What is the value of $ \sum_{n=1}^\infty (\tan^{-1}\sqrt{n}-\tan^{-1}\sqrt{n+1})$?

Which of the following numbers is the largest? $\text{(A)}\ .99 \qquad \text{(B)}\ .9099 \qquad \text{(C)}\ .9 \qquad \text{(D)}\ .909 \qquad \text{(E)}\ .9009$

$4.$ On a table there are notes of values: $1$, $2$, $5$, $10$, $20$ ,$50$, $100$, $200$, $500$, $1000$, $2000$ and $5000$ (the number of any of these notes can be any non-negative integer). Two players , First and Second play a game in turns (First plays first). With one move a player can take any one note of value higher than $1$ , and replace it with notes of less value. The value of the chosen note is equal to the sum of the values of the replaced notes. The loser is the player which can not play any more moves. Which player has the winning strategy?

Three lines passing through point $ O$ form equal angles by pairs. Points $ A_1$, $ A_2$ on the first line and $ B_1$, $ B_2$ on the second line are such that the common point $ C_1$ of $ A_1B_1$ and $ A_2B_2$ lies on the third line. Let $ C_2$ be the common point of $ A_1B_2$ and $ A_2B_1$. Prove that angle $ C_1OC_2$ is right.

Prove that all square matrices of the form (with $a, b \in R$), $$\begin{pmatrix} a & b \\ -b & a \end{pmatrix}$$ form a commutative field $K$ when considering the operations of addition and matrix product. Prove also that if $A \in K$ is an element of said field, there exist two matrices of $K$ such that the square of each is equal to $A$.

If $$w=\sqrt{1+\sqrt{-3+2\sqrt{3}}}-\sqrt{1-\sqrt{-3+2\sqrt{3}}}$$ prove that $w=\sqrt{3}-1$