Determine all non-negative integral solutions $ (n_{1},n_{2},\dots , n_{14}) $ if any, apart from permutations, of the Diophantine Equation \[n_{1}^{4}+n_{2}^{4}+\cdots+n_{14}^{4}=1,599.\]

The smallest positive integer greater than 1 that leaves a remainder of 1 when divided by 4, 5, and 6 lies between which of the following pairs of numbers? $\textbf{(A) }2\text{ and }19\qquad\textbf{(B) }20\text{ and }39\qquad\textbf{(C) }40\text{ and }59\qquad\textbf{(D) }60\text{ and }79\qquad\textbf{(E) }80\text{ and }124$

Point $E$ is on side $AB$ of square $ABCD$. If $EB$ has length one and $EC$ has length two, then the area of the square is $\text{(A)}\ \sqrt{3} \qquad \text{(B)}\ \sqrt{5} \qquad \text{(C)}\ 3 \qquad \text{(D)}\ 2\sqrt{3} \qquad \text{(E)}\ 5$

A circle with area $40$ is tangent to a circle with area $10$. Let R be the smallest rectangle containing both circles. The area of $R$ is $\frac{n}{\pi}$. Find $n$. [asy] defaultpen(linewidth(0.7)); size(120); real R = sqrt(40/pi), r = sqrt(10/pi); draw(circle((0,0), R)); draw(circle((R+r,0), r)); draw((-R,-R)--(-R,R)--(R+2*r,R)--(R+2*r,-R)--cycle);[/asy]

The Hawking Space Agency operates $n-1$ space flights between the $n$ habitable planets of the Local Galaxy Cluster. Each flight has a fixed price which is the same in both directions, and we know that using these flights, we can travel from any habitable planet to any habitable planet. In the headquarters of the Agency, there is a clearly visible board on a wall, with a portrait, containing all the pairs of different habitable planets with the total price of the cheapest possible sequence of flights connecting them. Suppose that these prices are precisely $1,2, ... , \binom{n}{2}$ monetary units in some order. prove that $n$ or $n-2$ is a square number.

Let $x,y,z$ be nonzero numbers, not necessarily real, such that \[(x-y)^2+(y-z)^2+(z-x)^2=24yz\] and \[\tfrac{x^2}{yz}+\tfrac{y^2}{zx}+\tfrac{z^2}{xy}=3.\] Compute $\tfrac{x^2}{yz}$.

An infinite table whose rows and columns are numbered with positive integers, is given. For a sequence of functions $f_1(x), f_2(x), \ldots $ let us place the number $f_i(j)$ into the cell $(i,j)$ of the table (for all $i, j\in \mathbb{N}$). A sequence $f_1(x), f_2(x), \ldots $ is said to be {\it nice}, if all the numbers in the table are positive integers, and each positive integer appears exactly once. Determine if there exists a nice sequence of functions $f_1(x), f_2(x), \ldots $, such that each $f_i(x)$ is a polynomial of degree 101 with integer coefficients and its leading coefficient equals to 1.

Anna and Ben are playing with a permutation $p$ of length $2020$, initially $p_i = 2021 - i$ for $1\le i \le 2020$. Anna has power $A$, and Ben has power $B$. Players are moving in turns, with Anna moving first. In his turn player with power $P$ can choose any $P$ elements of the permutation and rearrange them in the way he/she wants. Ben wants to sort the permutation, and Anna wants to not let this happen. Determine if Ben can make sure that the permutation will be sorted (of form $p_i = i$ for $1\le i \le 2020$) in finitely many turns, if a) $A = 1000, B = 1000$ b) $A = 1000, B = 1001$ c) $A = 1000, B = 1002$ [i]Anton Trygub[/i]

Let $\omega$ be a circle with center $O$, and let $l$ be a line not intersecting $\omega$. $E$ is a point on $l$ such that $OE$ is perpendicular with $l$. Let $M$ be an arbitrary point on $M$ different from $E$. Let $A$ and $B$ be distinct points on the circle $\omega$ such that $MA$ and $MB$ are tangents to $\omega$. Let $C$ and $D$ be the foot of perpendiculars from $E$ to $MA$ and $MB$ respectively. Let $F$ be the intersection of $CD$ and $OE$. As $M$ moves, determine the locus of $F$.

Find the smallest number of squares on an $8\times8$ board that should be colored so that every $L$-tromino on the board contains at least one colored square.

$\vartriangle ABC$ is an isosceles triangle with $AB = AC$. Let $M$ be the midpoint of $BC$ and $E$ be the point on AC such that $AE :CE = 5 : 3$. Let $X$ be the intersection of $BE$ and $AM$. Given that the area of $\vartriangle CM X$ is $15$, find the area of $\vartriangle ABC$.

Let $ABC$ be an acute triangle with circumcenter $O$ and orthocenter $H$. Rays $AO$, $CO$ intersect sides $BC, BA$ in points $A_1, C_1$ respectively, $K$ is the projection of $O$ onto the segment $A_1C_1$, $M$ is the midpoint of $AC$. Prove that $\angle HMA = \angle BKC_1$. [i]Proposed by Anton Trygub[/i]

Given an $n$-tuple of numbers $(x_1,x_2,\dots ,x_n)$ where each $x_i=+1$ or $-1$, form a new $n$-tuple $$(x_1x_2,x_2x_3,x_3x_4,\dots ,x_nx_1),$$ and continue to repeat this operation. Show that if $n=2^k$ for some integer $k\ge 1$, then after a certain number of repetitions of the operation, we obtain the $n$-tuple $$(1,1,1,\dots ,1).$$

Let $n$ be a positive integer. Ilya and Sasha both choose a pair of different polynomials of degree $n$ with real coefficients. Lenya knows $n$, his goal is to find out whether Ilya and Sasha have the same pair of polynomials. Lenya selects a set of $k$ real numbers $x_1<x_2<\dots<x_k$ and reports these numbers. Then Ilya fills out a $2 \times k$ table: For each $i=1,2,\dots,k$ he writes a pair of numbers $P(x_i),Q(x_i)$ (in any of the two possible orders) intwo the two cells of the $i$-th column, where $P$ and $Q$ are his polynomials. Sasha fills out a similar table. What is the minimal $k$ such that Lenya can surely achieve the goal by looking at the tables? [i]Proposed by L. Shatunov[/i]

Let $\triangle ABC$ be a triangle and points $P, Q, R$ on the sides $AB, BC,$ and $CA$ respectively, such that: \[ \frac{AP}{AB} = \frac{BQ}{BC} = \frac{CR}{CA} = \frac{1}{n} \] for $n \in \mathbb{N}$. The segments $AQ$ and $CP$ intersect at $D$, the segments $BR$ and $AQ$ intersect at $E$, and the segments $BR$ and $CP$ intersect at $F$. Compute the ratio: \[ \frac{\text{Area}(\triangle ABC)}{\text{Area}(\triangle DEF)}. \]

Let $ \left\{x_n\right\}$, with $ n \equal{} 1, 2, 3, \ldots$, be a sequence defined by $ x_1 \equal{} 603$, $ x_2 \equal{} 102$ and $ x_{n \plus{} 2} \equal{} x_{n \plus{} 1} \plus{} x_n \plus{} 2\sqrt {x_{n \plus{} 1} \cdot x_n \minus{} 2}$ $ \forall n \geq 1$. Show that: [b](1)[/b] The number $ x_n$ is a positive integer for every $ n \geq 1$. [b](2)[/b] There are infinitely many positive integers $ n$ for which the decimal representation of $ x_n$ ends with 2003. [b](3)[/b] There exists no positive integer $ n$ for which the decimal representation of $ x_n$ ends with 2004.

Let $P(x)$ be a polynomial with integer coefficients, leading coefficient 1, and $P(0) = 3$. If the polynomial $P(x)^2 + 1$ can be factored as a product of two non-constant polynomials with integer coefficients, and the degree of $P$ is as small as possible, compute the largest possible value of $P(10)$. [i]2016 CCA Math Bonanza Individual #13[/i]

Through the point of intersection of the altitudes of an acute triangle $ABC$ three circles pass through, each of which touches one of the sides triangle at the foot of the altitude . Prove that the second intersection points of the circles are the vertices of a triangle similar to the original one.

A rectangular piece of paper whose length is $\sqrt3$ times the width has area $A$. The paper is divided into equal sections along the opposite lengths, and then a dotted line is drawn from the first divider to the second divider on the opposite side as shown. The paper is then folded flat along this dotted line to create a new shape with area $B$. What is the ratio $B:A$? [asy] import graph; size(6cm); real L = 0.05; pair A = (0,0); pair B = (sqrt(3),0); pair C = (sqrt(3),1); pair D = (0,1); pair X1 = (sqrt(3)/3,0); pair X2= (2*sqrt(3)/3,0); pair Y1 = (2*sqrt(3)/3,1); pair Y2 = (sqrt(3)/3,1); dot(X1); dot(Y1); draw(A--B--C--D--cycle, linewidth(2)); draw(X1--Y1,dashed); draw(X2--(2*sqrt(3)/3,L)); draw(Y2--(sqrt(3)/3,1-L)); [/asy] $ \textbf{(A)}\ 1:2\qquad\textbf{(B)}\ 3:5\qquad\textbf{(C)}\ 2:3\qquad\textbf{(D)}\ 3:4\qquad\textbf{(E)}\ 4:5 $

Let $f{}$ and $g{}$ be polynomials with integers coefficients. The leading coefficient of $g{}$ is equal to 1. It is known that for infinitely many natural numbers $n{}$ the number $f(n)$ is divisible by $g(n)$ . Prove that $f(n)$ is divisible by $g(n)$ for all positive integers $n{}$ such that $g(n)\neq 0$. [i]From the folklore[/i]

4. Consider spherical surface $S$ which radius is $1$, central point $(0,0,1)$ in $xyz$ space. If point $Q$ move to points on S expect $(0,0,2)$. Let $R$ be an intersection of plane $z=0$ and line $l$ pass point $Q$ and point $P (1,0,2)$. Find the range of moving $R$, then illustrate it.

$n$ players ($n \ge 4$) took part in the tournament. Each player played exactly one match with every other player, there were no draws. There was no four players $(A, B, C, D)$, such that $A$ won with $B$, $B$ won with $C$, $C$ won with $D$ and $D$ won with $A$. Determine, depending on $n$, maximum number of trios of players $(A, B, C)$, such that $A$ won with $B$, $B$ won with $C$ and $C$ won with $A$. (Attention: Trios $(A, B, C)$, $(B, C, A)$ and $(C, A, B)$ are the same trio.)

Find the polynomial $f$ with the following properties: $\bullet$ its leading coefficient is $1$, $\bullet$ its coefficients are nonnegative integers, $\bullet$ $72|f(x)$ if $x$ is an integer, $\bullet$ if $g$ is another polynomial with the same properties, then $g - f$ has a nonnegative leading coecient.

Let $(x_1, y_1, z_1), (x_2, y_2, z_2), \cdots, (x_{19}, y_{19}, z_{19})$ be integers. Prove that there exist pairwise distinct subscripts $i, j, k$ such that $x_i+x_j+x_k$, $y_i+y_j+y_k$, $z_i+z_j+z_k$ are all multiples of $3$.

On the side $BC$ of the triangle $ABC$ there are two points $D$ and $E$ such that $BD < BE$. Denote by $p_1$ and $p_2$ the perimeters of triangles $ABC$ and $ADE$ respectively. Prove that \[p_1 > p_2 + 2\cdot \min\{BD, EC\}.\]