The country has $n \ge 3$ airports, some pairs of which are connected by bidirectional flights. Every day, the government closes the airport with the strictly highest number of flights going out of it. What is the maximum number of days this can continue? [i]Proposed by Fedir Yudin[/i]

a) For integer $n \ge 3$, suppose that $0 < a_1 < a_2 < ...< a_n$ is a arithmetic sequence and $0 < b_1 < b_2 < ... < b_n$ is a geometric sequence with $a_1 = b_1, a_n = b_n$. Prove that a_k > b_k for all $k = 2,3,..., n -1$. b) Prove that for every positive integer $n \ge 3$, there exist an integer arithmetic sequence $(a_n)$ and an integer geometric sequence $(b_n)$ such that $0 < b_1 < a_1 < b_2 < a_2 < ... < b_n < a_n$.

The incircle of $ABC$ touches $BC$, $CA$, $AB$ at $K$, $L$, $M$ respectively. The line through $A$ parallel to $LK$ meets $MK$ at $P$, and the line through $A$ parallel to $MK$ meets $LK$ at $Q$. Show that the line $PQ$ bisects $AB$ and bisects $AC$.

There are four basketball players $A,B,C,D$. Initially the ball is with $A$. The ball is always passed from one person to a different person. In how many ways can the ball come back to $A$ after $\textbf{seven}$ moves? (for example $A\rightarrow C\rightarrow B\rightarrow D\rightarrow A\rightarrow B\rightarrow C\rightarrow A$, or $A\rightarrow D\rightarrow A\rightarrow D\rightarrow C\rightarrow A\rightarrow B\rightarrow A)$.

The function $f$ from the set $\mathbb{N}$ of positive integers into itself is defined by the equality \[f(n)=\sum_{k=1}^{n} \gcd(k,n),\qquad n\in \mathbb{N}.\] a) Prove that $f(mn)=f(m)f(n)$ for every two relatively prime ${m,n\in\mathbb{N}}$. b) Prove that for each $a\in\mathbb{N}$ the equation $f(x)=ax$ has a solution. c) Find all ${a\in\mathbb{N}}$ such that the equation $f(x)=ax$ has a unique solution.

If $(a_n)$ is a sequence of real numbers such that for $n \geq 1$ $$(2-a_n )a_{n+1} =1,$$ prove that $\lim_{n\to \infty} a_n =1.$

If the incircle of a right triangle with area $a$ is the circumcircle of a right triangle with area $b$, what is the minimum value of $\frac{a}{b}$? $ \textbf{(A)}\ 3 + 2\sqrt2 \qquad\textbf{(B)}\ 1+\sqrt2 \qquad\textbf{(C)}\ 2\sqrt2 \qquad\textbf{(D)}\ 2+\sqrt3 \qquad\textbf{(E)}\ 2\sqrt3$

Let $m, n$ be positive integers $(m, n>=2)$. Given an $n$-element set $A$ of integers $(A=\{a_1,a_2,\cdots ,a_n\})$, for each pair of elements $a_i, a_j(j>i)$, we make a difference by $a_j-a_i$. All these $C^2_n$ differences form an ascending sequence called “derived sequence” of set $A$. Let $\bar{A}$ denote the derived sequence of set $A$. Let $\bar{A}(m)$ denote the number of terms divisible by $m$ in $\bar{A}$ . Prove that $\bar{A}(m)\ge \bar{B}(m)$ where $A=\{a_1,a_2,\cdots ,a_n\}$ and $B=\{1,2,\cdots ,n\}$.

Two thieves stole an open chain with $2k$ white beads and $2m$ black beads. They want to share the loot equally, by cutting the chain to pieces in such a way that each one gets $k$ white beads and $m$ black beads. What is the minimal number of cuts that is always sufficient?

Let $A$ be a set consist of finite real numbers,$A_1,A_2,\cdots,A_n$ be nonempty sets of $A$, such that [b](a)[/b] The sum of the elements of $A$ is $0,$ [b](b)[/b] For all $x_i \in A_i(i=1,2,\cdots,n)$,we have $x_1+x_2+\cdots+x_n>0$. Prove that there exist $1\le k\le n,$ and $1\le i_1<i_2<\cdots<i_k\le n$, such that \[|A_{i_1}\bigcup A_{i_2} \bigcup \cdots \bigcup A_{i_k}|<\frac{k}{n}|A|.\] Where $|X|$ denote the numbers of the elements in set $X$.

The measure of the angles of a triangle are in arithmetic progression and the lengths of its altitudes are as well. Show that such a triangle is equilateral.

Find $\displaystyle \sum_{k=0}^{49}(-1)^k\binom{99}{2k}$, where $\binom{n}{j}=\frac{n!}{j!(n-j)!}$. $ \textbf{(A)}\ -2^{50} \qquad\textbf{(B)}\ -2^{49} \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 2^{49} \qquad\textbf{(E)}\ 2^{50} $

A [i]binary string[/i] is a sequence, each of whose terms is $0$ or $1$. A set $\mathcal{B}$ of binary strings is defined inductively according to the following rules. [list] [*]The binary string $1$ is in $\mathcal{B}$.[/*] [*]If $s_1,s_2,\dotsc ,s_n$ is in $\mathcal{B}$ with $n$ odd, then both $s_1,s_2,\dotsc ,s_n,0$ and $0,s_1,s_2,\dotsc ,s_n$ are in $\mathcal{B}$.[/*] [*]If $s_1,s_2,\dotsc ,s_n$ is in $\mathcal{B}$ with $n$ even, then both $s_1,s_2,\dotsc ,s_n,1$ and $1,s_1,s_2,\dotsc ,s_n$ are in $\mathcal{B}$.[/*] [*]No other binary strings are in $\mathcal{B}$.[/*] [/list] For each positive integer $n$, let $b_n$ be the number of binary strings in $\mathcal{B}$ of length $n$. [list=a] [*]Prove that there exist constants $c_1,c_2>0$ and $1.6<\lambda_1,\lambda_2<1.9$ such that $c_1\lambda_1^n<b_n<c_2\lambda_2^n$ for all positive integer $n$.[/*] [*]Determine $\liminf_{n\to \infty} {\sqrt[n]{b_n}}$ and $\limsup_{n\to \infty} {\sqrt[n]{b_n}}$[/*] [/list] [i]Note: The problem is open in the sense that no solution is currently known to part (b).[/i]

A square with sides of length $1$ cm is given. There are many different ways to cut the square into four rectangles. Let $S$ be the sum of the four rectangles’ perimeters. Describe all possible values of $S$ with justification.

In a circle $O$, there are six points, $ A$, $ B$, $C$, $D$, $E$, $F$ in a counterclockwise order such that $BD \perp CF$ , and $CF$, $BE$, $AD$ are concurrent. Let the perpendicular from $B$ to $AC$ be $M$, and the perpendicular from $D$ to $CE$ be $N$. Prove that $AE \parallel MN$.

Yesterday, Alex, Beth, and Carl raked their lawn. First, Alex and Beth raked half of the lawn together in $30$ minutes. While they took a break, Carl raked a third of the remaining lawn in $60$ minutes. Finally, Beth joined Carl and together they finished raking the lawn in $24$ minutes. If they each rake at a constant rate, how many hours would it have taken Alex to rake the entire lawn by himself?

Charlotte writes a test consisting of 100 questions, where the answer to each question is either TRUE or FALSE. Charlotte’s teacher announces that for every five consecutive questions on the test, the answers to exactly three of them are TRUE. Just before the test starts, the teacher whispers to Charlotte that the answers to the first and last questions are both FALSE. (a) Determine the number of questions for which the correct answer is TRUE. (b) What is the correct answer to the sixth question on the test? (c) Explain how Charlotte can correctly answer all 100 questions on the test.

Given is a graph $G$ of $n+1$ vertices, which is constructed as follows: initially there is only one vertex $v$, and one a move we can add a vertex and connect it to exactly one among the previous vertices. The vertices have non-negative real weights such that $v$ has weight $0$ and each other vertex has a weight not exceeding the avarage weight of its neighbors, increased by $1$. Prove that no weight can exceed $n^2$.

In a function $f (x) = (x^2 + ax + b )/ (x^2 + cx + d)$ , the quadratics $x^2 + ax + b$ and $x^2 + cx + d$ have no common roots. Prove that the next two statements are equivalent: (i) there is a numerical interval without any values of $f(x)$ , (ii) $f(x)$ can be represented in the form $f (x) = f_1 (f_2( ... f_{n-1} (f_n (x))... ))$ where each of the functions $f_j$ is o f one of the three forms $k_j x + b_j, 1/x, x^2$ . (A Kanel)

It can be shown that there exists a unique polynomial $P$ in two variables such that for all positive integers $m$ and $n,$ $$P(m,n)=\sum_{i=1}^m\sum_{i=1}^n (i+j)^7.$$ Compute $P(3,-3).$

Let $a_1,b_1,c_1$ are three lines each two of them are mutually crossed and aren't parallel to some plane. The lines $a_2,b_2,c_2$ intersect the lines $a_1,b_1,c_1$ at the points $a_2$ in $A$, $C_2$, $B_1$; $b_2$ in $C_1$, $B$, $A_2$; $c_2$ in $B_2$, $A_1$, $C$ respectively in such a way that $A$ is the perpendicular bisector of $B_1C_2$, $B$ is the perpendicular bisector of $C_1A_2$ and $C$ is the perpendicular bisector of $A_1B_2$. Prove that: (a) $A$ is the perpendicular bisector of $B_2C_1$, $B$ is the perpendicular bisector of $C_2A_1$ and $C$ is the perpendicular bisector of $A_2B_1$; (b) triangles $A_1B_1C_1$ and $A_2B_2C_2$ are the same.

The cube $nxnxn$ consists of $n^3$ unit cubes $1x1x1$, and at least one of these unit cubes is black. Show that we can always cut the cube in $2$ parallelepiped pieces so that each piece contains exactly one black 1x1 square .

A point $P{}$ is considered on the incircle of the triangle $ABC$. We draw the tangent segments from $P{}$ to the three excircles of $ABC$. Prove that from the obtained three tangent segments it is possible to make a right triangle if and only if the point $P{}$ lies on one of the lines connecting two of the midpoints of the sides of $ABC$.

There are two circles with a common center $ O $ and a point $ A $. Construct a circle with center $ A $ intersecting the given circles at points $ M $ and $ N $ such that the line $ MN $ passes through point $ O $.

Real numbers $x_1,x_2,...x_{2004},y_1,y_2,...y_{2004}$ differ from $1$ and are such that $x_ky_k=1$ for every $k=1,2,...,2004$. Calculate the sum $$S=\frac{1}{1-x_1^3}+\frac{1}{1-x_2^3}+...+\frac{1}{1-x_{2004}^3}+\frac{1}{1-y_1^3}+\frac{1}{1-y_2^3}+...+\frac{1}{1-y_{2004}^3}$$