Given an odd $n$, prove that there exist $2n$ integers $a_1,a_2,\cdots ,a_n$; $b_1,b_2,\cdots ,b_n$, such that for any integer $k$ ($0<k<n$), the following $3n$ integers: $a_i+a_{i+1}, a_i+b_i, b_i+b_{i+k}$ ($i=1,2,\cdots ,n; a_{n+1}=a_1, b_{n+j}=b_j, 0<j<n$) are of different remainders on division by $3n$.

Let $a$, $b$, $c$ be positive reals for which \begin{align*} (a+b)(a+c) &= bc + 2 \\ (b+c)(b+a) &= ca + 5 \\ (c+a)(c+b) &= ab + 9 \end{align*} If $abc = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $100m+n$. [i]Proposed by Evan Chen[/i]

Six trees are equally spaced along one side of a straight road. The distance from the first tree to the fourth is 60 feet. What is the distance in feet between the first and last trees? $ \text{(A)}\ 90\qquad\text{(B)}\ 100\qquad\text{(C)}\ 105\qquad\text{(D)}\ 120\qquad\text{(E)}\ 140 $

In the lower left corner of the square $7 \times 7$ board there is a king. In one move, he can move either one cell to the right, or one cell up, or one cell diagonally - to the right and up. How many different ways can the king get to the upper right corner of the board if he is prohibited from visiting the central square?

Find $\sum_{k=0}^n \frac{(-1)^k}{2k+1}\ _n C_k.$

The incircle $\omega$ of triangle $ABC$ touches $BC, CA, AB$ at points $A_1, B_1$ and $C_1$ respectively, $P$ is an arbitrary point on $\omega$. The line $AP$ meets the circumcircle of triangle $AB_1C_1$ for the second time at point $A_2$. Points $B_2$ and $C_2$ are defined similarly. Prove that the circumcircle of triangle $A_2B_2C_2$ touches $\omega$.

An isosceles trapezoid has an inscribed circle tangent to each of its four sides. The radius of the circle is $3$, and the area of the trapezoid is $72$. Let the parallel sides of the trapezoid have lengths $r$ and $s$, with $r \neq s$. Find $r^2+s^2$

Given points $A, M, M_1$ and rational number $\lambda \neq -1$. Construct the triangle $ABC$, such that $M$ lies on $BC$ and $M_1$ lies on $B_1C_1$ ($B_1, C_1$ are the projections of $B, C$ on $AC, AB$ respectively), and $\frac{BM}{MC}=\frac{B_1M_1}{M_1C_1}=\lambda.$

Let $S$ be the set of all positive integers $n$ such that each of the numbers $n + 1$, $n + 3$, $n + 4$, $n + 5$, $n + 6$, and $n + 8$ is composite. Determine the largest integer $k$ with the following property: For each $n \in S$ there exist at least $k$ consecutive composite integers in the set {$n, n +1, n + 2, n + 3, n + 4, n + 5, n + 6, n + 7, n + 8, n + 9$}.

There are some gas stations on a circular highway. The total amount of gasoline in them is enough for two laps. Two drivers want to refuel at one station and starting from it, go in different directions, both of them completing an entire lap. Along the way, they can refuel at other stations, without necessarily taking all the gasoline. Prove that drivers will always be able to do this. [i]Proposed by I. Bogdanov[/i]

Jackson's paintbrush makes a narrow strip that is $6.5$ mm wide. Jackson has enough paint to make a strip of 25 meters. How much can he paint, in $\text{cm}^2$? $\textbf{(A) }162{,}500\qquad\textbf{(B) }162.5\qquad\textbf{(C) }1{,}625\qquad\textbf{(D) }1{,}625{,}000\qquad\textbf{(E) }16{,}250$

Three sequences ${a_n},{b_n},{c_n}$ satisfy the following conditions. [list] [*]$a_1=2,\,b_1=4,\,c_1=5$ [*]$\forall n,\; a_{n+1}=b_n+\frac{1}{c_n}, \, b_{n+1}=c_n+\frac{1}{a_n}, \, c_{n+1}=a_n+\frac{1}{b_n}$ [/list] Prove that for all positive integers $n$, $ $ $ $ $max(a_n,b_n,c_n)>\sqrt{2n+13}$.

Given a positive integer $k$, call $n$ [i]good[/i] if among $$\binom{n}{0},\binom{n}{1},\binom{n}{2},...,\binom{n}{n}$$ at least $0.99n$ of them are divisible by $k$. Show that exists some positive integer $N$ such that among $1,2,...,N$, there are at least $0.99N$ good numbers.

A cube-shaped container has vertices $A$, $B$, $C$, and $D$ where $\overline{AB}$ and $\overline{CD}$ are parallel edges of the cube, and $\overline{AC}$ and $\overline{BD}$ are diagonals of the faces of the cube. Vertex $A$ of the cube is set on a horizontal plane $\mathcal P$ so that the plane of the rectangle $ABCD$ is perpendicular to $\mathcal P$, vertex $B$ is $2$ meters above $\mathcal P$, vertex $C$ is $8$ meters above $\mathcal P$, and vertex $D$ is $10$ meters above $\mathcal P$. The cube contains water whose surface is $7$ meters above $\mathcal P$. The volume of the water is $\tfrac mn$ cubic meters, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] size(250); defaultpen(linewidth(0.6)); pair A = origin, B = (6,3), X = rotate(40)*B, Y = rotate(70)*X, C = X+Y, Z = X+B, D = B+C, W = B+Y; pair P1 = 0.8*C+0.2*Y, P2 = 2/3*C+1/3*X, P3 = 0.2*D+0.8*Z, P4 = 0.63*D+0.37*W; pair E = (-20,6), F = (-6,-5), G = (18,-2), H = (9,8); filldraw(E--F--G--H--cycle,rgb(0.98,0.98,0.2)); fill(A--Y--P1--P4--P3--Z--B--cycle,rgb(0.35,0.7,0.9)); draw(A--B--Z--X--A--Y--C--X^^C--D--Z); draw(P1--P2--P3--P4--cycle^^D--P4); dot("$A$",A,S); dot("$B$",B,S); dot("$C$",C,N); dot("$D$",D,N); label("$\mathcal P$",(-13,4.5)); [/asy]

The function $F$ is a one-to-one transformation of the plane into itself that maps rectangles into rectangles (rectangles are closed; continuity is not assumed). Prove that $F$ maps squares into squares.

Solve the equation $m^{gcd(m,n)} = n^{lcm(m,n)}$ in positive integers, where gcd($m, n$) – greatest common divisor of $m,n$, and lcm($m, n$) – least common multiple of $m,n$.