Find all triples $(a,b,c)$ of positive integers such that if $n$ is not divisible by any prime less than $2014$, then $n+c$ divides $a^n+b^n+n$. [i]Proposed by Evan Chen[/i]

Triangle $ABC$ has $\angle{A}=90^\circ$, $\angle{C}=30^\circ$, and $AC=12$. Let the circumcircle of this triangle be $W$. Define $D$ to be the point on arc $BC$ not containing $A$ so that $\angle{CAD}=60^\circ$. Define points $E$ and $F$ to be the foots of the perpendiculars from $D$ to lines $AB$ and $AC$, respectively. Let $J$ be the intersection of line $EF$ with $W$, where $J$ is on the minor arc $AC$. The line $DF$ intersects $W$ at $H$ other than $D$. The area of the triangle $FHJ$ is in the form $\frac{a}{b}(\sqrt{c}-\sqrt{d})$ for positive integers $a,b,c,d,$ where $a,b$ are relatively prime, and the sum of $a,b,c,d$ is minimal. Find $a+b+c+d$.

Let $ ABC$ be a fixed triangle, and let $ A_1$, $ B_1$, $ C_1$ be the midpoints of sides $ BC$, $ CA$, $ AB$, respectively. Let $ P$ be a variable point on the circumcircle. Let lines $ PA_1$, $ PB_1$, $ PC_1$ meet the circumcircle again at $ A'$, $ B'$, $ C'$, respectively. Assume that the points $ A$, $ B$, $ C$, $ A'$, $ B'$, $ C'$ are distinct, and lines $ AA'$, $ BB'$, $ CC'$ form a triangle. Prove that the area of this triangle does not depend on $ P$. [i]Author: Christopher Bradley, United Kingdom [/i]

Let $k$ be a fixed positive integer. The sequence $\{a_{n}\}_{n\ge1}$ is defined by \[a_{1}=k+1, a_{n+1}=a_{n}^{2}-ka_{n}+k.\] Show that if $m \neq n$, then the numbers $a_{m}$ and $a_{n}$ are relatively prime.

Consider positive integers $a<b$ and the set $C\subset\{a,a+1,a+2,\dots ,b-2,b-1,b\}$. Suppose $C$ has more than $\frac{b-a+1}{2}$ elements. Prove that there are two elements $x,y\in C$ that satisfy $x+y=a+b$. [i] (From "Radu Păun" contest, Radu Miculescu)[/i]

Circle $\Gamma$ with radius $1$ is centered at point $A$ on the circumference of circle $\omega$ with radius $7$. Suppose that point $P$ lies on $\omega$ with $AP=4$. Determine the product of the distances from $P$ to the two intersections of $\omega$ and $\Gamma$. [i]2018 CCA Math Bonanza Team Round #6[/i]

Let $ \mathcal{F}$ be a surface which is simply covered by two systems of geodesics such that any two lines belonging to different systems form angles of the same opening. Prove that $ \mathcal{F}$ can be developed (that is, isometrically mapped) into the plane.

$\exists ? f: R\to R$ continuos function that: $\forall x_0\in R \lim\limits_{x \to x_0} \frac{|f(x)-f(x_0)|}{|x-x_0|}=+\infty$

A sequence $(a_{n})$ is defined by $a_{1}= 1$ and $a_{n}= a_{1}a_{2}...a_{n-1}+1$ for $n \geq 2.$ Find the smallest real number $M$ such that $\sum_{n=1}^{m}\frac{1}{a_{n}}<M\; \forall m\in\mathbb{N}$.

A group of $16$ people will be partitioned into $4$ indistinguishable $4$-person committees. Each committee will have one chairperson and one secretary. The number of different ways to make these assignments can be written as $3^{r}M$, where $r$ and $M$ are positive integers and $M$ is not divisible by $3$. What is $r$? $ \textbf{(A) }5 \qquad \textbf{(B) }6 \qquad \textbf{(C) }7 \qquad \textbf{(D) }8 \qquad \textbf{(E) }9 \qquad $

Vincent is playing a game with Evil Bill. The game uses an infinite number of red balls, an infinite number of green balls, and a very large bag. Vincent first picks two nonnegative integers $g$ and $k$ such that $g < k \le 2016$, and Evil Bill places $g$ green balls and $2016 - g$ red balls in the bag, so that there is a total of $2016$ balls in the bag. Vincent then picks a ball of either color and places it in the bag. Evil Bill then inspects the bag. If the ratio of green balls to total balls in the bag is ever exactly $\frac{k}{2016}$ , then Evil Bill wins. If the ratio of green balls to total balls is greater than $\frac{k}{2016}$ , then Vincent wins. Otherwise, Vincent and Evil Bill repeat the previous two actions (Vincent picks a ball and Evil Bill inspects the bag). If $S$ is the sum of all possible values of $k$ that Vincent could choose and be able to win, determine the largest prime factor of $S$.

Let $S = \{1, 2, \dots, 9\}.$ Compute the number of functions $f : S \rightarrow S$ such that, for all $s \in S, f(f(f(s))) =s$ and $f(s) - s$ is not divisible by $3$.

$ n\geq 2$ cars are participating in a rally. The cars leave the start line at different times and arrive at the finish line at different times. During the entire rally each car takes over any other car at most once , the number of cars taken over by each car is different and each car is taken over by the same number of cars. Find all possible values of $ n$

Define a sequence $\left( a_{n}\right) _{n\in\mathbb{N}}$ by $a_{1}=a_{2}=a_{3}=1$ and $a_{n+1}=\dfrac{a_{n}^{2}+a_{n-1}^{2}}{a_{n-2}}$ for every integer $n\geq3$. Show that all elements $a_{i}$ of this sequence are integers. (L. J. Mordell and apparently Dana Scott, see also http://oeis.org/A064098)

The 9 members of a baseball team went to an ice-cream parlor after their game. Each player had a singlescoop cone of chocolate, vanilla, or strawberry ice cream. At least one player chose each flavor, and the number of players who chose chocolate was greater than the number of players who chose vanilla, which was greater than the number of players who chose strawberry. Let $N$ be the number of different assignments of flavors to players that meet these conditions. Find the remainder when $N$ is divided by $1000.$

Find all positive integer $n$ for which there exist real number $a_1,a_2,\ldots,a_n$ such that $$\{a_j-a_i|1\le i<j\le n\}=\left\{1,2,\ldots,\frac{n(n-1)}2\right\}.$$