Say that a sequence $a_1$, $a_2$, $a_3$, $a_4$, $a_5$, $a_6$, $a_7$, $a_8$ is [i]cool[/i] if * the sequence contains each of the integers 1 through 8 exactly once, and * every pair of consecutive terms in the sequence are relatively prime. In other words, $a_1$ and $a_2$ are relatively prime, $a_2$ and $a_3$ are relatively prime, $\ldots$, and $a_7$ and $a_8$ are relatively prime. How many cool sequences are there?

Suppose $\alpha, \beta$ are two positive rational numbers. Assume for some positive integers $m,n$, it is known that $\alpha^{\frac 1n}+\beta^{\frac 1m}$ is a rational number. Prove that each of $\alpha^{\frac 1n}$ and $\beta^{\frac 1m}$ is a rational number.

There is a point inside an equilateral triangle side $d$ whose distance from the vertices is $3, 4, 5$. Find $d$.

Find all real numbers $a, b, c$ that satisfy $$ 2a - b =a^2b, \qquad 2b-c = b^2 c, \qquad 2c-a= c^2 a.$$

Let $D$ be the midpoint of the base $AB$ of the isosceles acute triangle $ABC$. Choose point $E$ on segment $AB$, and let $O$ be the circumcenter of triangle $ACE$. Prove that the line through $D$ perpendicular to $DO$, the line through $E$ perpendicular to $BC$, and the line through $B$ parallel to $AC$ are concurrent.

Find all prime numbers $ p $ such that $ 4p^2 + 1 $ and $ 6p^2 + 1 $ are also prime numbers.

Prove that the numbers from $1$ to $ 15$ cannot be divided into two groups: $A$ of $2$ numbers and $B$ of $13$ numbers such that the sum of the numbers in group $B$ is equal to product of numbers in group $A$.

Let $n \geq 2$ be a positive integer and $a_{1},\ldots , a_{n}$ be positive real numbers such that $a_{1}+...+a_{n}= 1$. Prove that: \[\frac{a_{1}}{1+a_{2}+\cdots +a_{n}}+\cdots +\frac{a_{n}}{1+a_{1}+a_{2}+\cdots +a_{n-1}}\geq \frac{n}{2n-1}\]

Prove that: (a) if $y<\frac12$ and $n\ge3$ is a natural number then $(y+1)^n\ge y^n+(1+2y)^\frac n2$; (b) if $x,y,z$ and $n\ge3$ are natural numbers for which $x^2-1\le2y$ then $x^n+y^n\ne z^n$.

Let $ f:\mathbb{Z}_{>0}\rightarrow\mathbb{R} $ be a function such that for all $n > 1$ there is a prime divisor $p$ of $n$ such that \[ f(n)=f\left(\frac{n}{p}\right)-f(p). \] Furthermore, it is given that $ f(2^{2014})+f(3^{2015})+f(5^{2016})=2013 $. Determine $ f(2014^2)+f(2015^3)+f(2016^5) $.

Real numbers $x$ and $y$ satisfy $$xy+\frac{x}{y} = 3$$ $$\frac{1}{x^2y^2}+\frac{y^2}{x^2} = 4$$ If $x^2$ can be expressed in the form $\frac{a+\sqrt{b}}{c}$ for integers $a$, $b$, and $c$. Find $a+b+c$. [i]Proposed by Andy Xu[/i]

Al has three bags, each with three marbles each. Bag $1$ has two blue marbles and one red marble, Bag $2$ has one blue marble and two red marbles, and Bag $3$ has three red marbles. He chooses two distinct bags at random, then one marble at random from each of the chosen bags. What is the probability that he chooses two blue marbles?

Each point of a circle is painted in one of the $ N$ colors ($N \geq 2$). Prove that there exists an inscribed trapezoid such that all its vertices are painted the same color.

Find all natural numbers $x,y,z$ such that $a+2^x3^y=z^2$.

For a positive integer n, let $w(n)$ denote the number of distinct prime divisors of n. Determine the least positive integer k such that $2^{w(n)} \leq k \sqrt[4]{n}$ for all positive integers n.

Fifteen pairwise coprime positive integers chosen so that each of them less than 2010. Show that at least one of them is prime.

Let $A$ be a finite set of points in the coordinate plane. Suppose that $A$ has $n\geq3$ points. Given any $a$ in $A$, the horizontal and vertical lines through $a$ define four [i]closed[/i] quadrants centered at $a$. For any real number $\alpha$, call a point $a$ in $A$ $\alpha$-good if there are two diagonally opposite closed quadrants centered at $a$ that each contain at least $\alpha n$ points from $A$. Show that there is some $a$ in $A$ that is $\frac{1}{8}$-good.

A $\emph{luns}$ with vertices $X$ and $Y$ is a region bounded by two circular arcs meeting at the endpoints $X$ and $Y$. Let $A$, $B$, and $V$ be points such that $\angle AVB=75^\circ$, $AV=\sqrt{2}$ and $BV=\sqrt{3}$. Let $\mathcal{L}$ be the largest area luns with vertices $A$ and $B$ that does not intersect the lines $VA$ or $VB$ in any points other than $A$ and $B$. Define $k$ as the area of $\mathcal{L}$. Find the value \[ \dfrac {k}{(1+\sqrt{3})^2}. \]

$2000$ lines are set on the plane. Prove that among them there are two such that have the same number of different intersection points with the rest of the lines.

Points $A$ and $B$ are 10 units apart. Points $B$ and $C$ are 4 units apart. Points $C$ and $D$ are 3 units apart. If $A$ and $D$ are as close as possible, then the number of units between them is $\text{(A)}\ 0 \qquad \text{(B)}\ 3 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 11 \qquad \text{(E)}\ 17$

Consider a chess board, with the numbers $1$ through $64$ placed in the squares as in the diagram below. \[\begin{tabular}{| c | c | c | c | c | c | c | c |} \hline 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ \hline 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 \\ \hline 17 & 18 & 19 & 20 & 21 & 22 & 23 & 24 \\ \hline 25 & 26 & 27 & 28 & 29 & 30 & 31 & 32 \\ \hline 33 & 34 & 35 & 36 & 37 & 38 & 39 & 40 \\ \hline 41 & 42 & 43 & 44 & 45 & 46 & 47 & 48 \\ \hline 49 & 50 & 51 & 52 & 53 & 54 & 55 & 56 \\ \hline 57 & 58 & 59 & 60 & 61 & 62 & 63 & 64 \\ \hline \end{tabular}\] Assume we have an infinite supply of knights. We place knights in the chess board squares such that no two knights attack one another and compute the sum of the numbers of the cells on which the knights are placed. What is the maximum sum that we can attain? Note. For any $2\times3$ or $3\times2$ rectangle that has the knight in its corner square, the knight can attack the square in the opposite corner.

Find minimum of $x+y+z$ where $x$, $y$ and $z$ are real numbers such that $x \geq 4$, $y \geq 5$, $z \geq 6$ and $x^2+y^2+z^2 \geq 90$

Find all functions $f(x)$ defined in the range $\left(-\frac\pi2,\frac\pi2\right)$ that are differentiable at $0$ and satisfy $$f(x)=\frac12\left(1+\frac1{\cos x}\right)f\left(\frac x2\right)$$ for every $x$ in the range $\left(-\frac\pi2,\frac\pi2\right)$. [i]L. Davidov[/i]

Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.

Suppose $x$ is in the interval $[0,\pi/2]$ and $\log_{24\sin{x}}(24\cos{x})=\frac{3}{2}$. Find $24\cot^2{x}$.