Consider $P$ a regular $9$-sided convex polygon with each side of length $1$. A diagonal at $P$ is any line joining two non-adjacent vertices of $P$. Calculate the difference between the lengths of the largest and smallest diagonal of $P$.

Every brick has $5$ holes in a line. The holes can be filled with bolts (fitting in one hole) and braces (fitting into two neighboring holes). No hole may remain free. One puts $n$ of these bricks in a line to form a pattern from left to right. In this line no two braces and no three bolts may be adjacent. How many different such patterns can be produced with $n$ bricks?

For positive integers $n,d$, define $n \% d$ to be the unique value of the positive integer $r < d$ such that $n = qd + r$, for some positive integer $q$. What is the smallest value of $n$ not divisible by $5,7,11,13$ for which $n^2 \% 5 < n^2 \% 7 < n^2 \% 11 < n^2 \% 13$?

Consider the set \[\{0, 1\}^n = \{X = (x_1, x_2,\dots , x_n) : x_i \in \{0, 1\}, 1 \leq i \leq n\}.\] We say that $X > Y$ if $X \neq Y$ and the following $n$ inequalities are satisfy \[x_1 \geq y_1, x_1 + x_2 \geq y_1 + y_2,\dots , x_1 + x_2 + \cdots + x_n \geq y_1 + y_2 + \cdots + y_n.\] We define a chain of length $k$ as a subset ${Z_1,\dots , Z_k} \subseteq \{0, 1\}^n$ of distinct elements such that $Z_1 > Z_2 > \cdots > Z_k.$ Determine the lenght of longest chain in $\{0,1\}^n$.

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Let ${A}$ be a finite collection of squares in the coordinate plane such that the vertices of all squares that belong to ${A}$ are ${(m, n), (m + 1, n), (m, n + 1)}$, and ${(m + 1, n + 1)}$ for some integers ${m}$ and ${n}$. Show that there exists a subcollection ${B}$ of ${A}$ such that ${B}$ contains at least ${25 \% }$ of the squares in ${A}$, but no two of the squares in ${B}$ have a common vertex.

We are given a supply of $a \times b$ tiles with $a$ and $b$ distinct positive integers. The tiles are to be used to tile a $28 \times 48$ rectangle. Find $a, b$ such that the tile has the smallest possible area and there is only one possible tiling. (If there are two distinct tilings, one of which is a reflection of the other, then we treat that as more than one possible tiling. Similarly for other symmetries.) Find $a, b$ such that the tile has the largest possible area and there is more than one possible tiling.

Let $x_1, x_2, x_3, x_4$ be the distances from an arbitrary point inside the tetrahedron to the planes of its faces, and let $h_1, h_2, h_3, h_4$ be the corresponding heights of the tetrahedron. Prove that $$\sqrt{h_1+h_2+h_3+h_4} \ge \sqrt{x_1}+\sqrt{x_2}+\sqrt{x_3}+\sqrt{x_4}$$ (Dmitry Nomirovsky)

Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)

Let $ABC$ be a triangle with integral side lengths. The angle bisector drawn from $B$ and the altitude drawn from $C$ meet at point $P$ inside the triangle. Prove that the ratio of areas of triangles $APB$ and $APC$ is a rational number.

The number $27,\,000,\,001$ has exactly four prime factors. Find their sum.

Let squares be constructed on the sides $BC,CA,AB$ of a triangle $ABC$, all to the outside of the triangle, and let $A_1,B_1, C_1$ be their centers. Starting from the triangle $A_1B_1C_1$ one analogously obtains a triangle $A_2B_2C_2$. If $S, S_1, S_2$ denote the areas of triangles$ ABC,A_1B_1C_1,A_2B_2C_2$, respectively, prove that $S = 8S_1 - 4S_2.$

Let $ABC$ be a triangle, and let $\omega_1,\omega_2$ be centered at $O_1$, $O_2$ and tangent to line $BC$ at $B$, $C$ respectively. Let line $AB$ intersect $\omega_1$ again at $X$ and let line $AC$ intersect $\omega_2$ again at $Y$. If $Q$ is the other intersection of the circumcircles of triangles $ABC$ and $AXY$, then prove that lines $AQ$, $BC$, and $O_1O_2$ either concur or are all parallel. [i]Advaith Avadhanam[/i]

Let us consider a convex hexagon ABCDEF. Let $A_1, B_1,C_1, D_1, E_1, F_1$ be midpoints of the sides $AB, BC, CD, DE, EF,FA$ respectively. Denote by $p$ and $p_1$, respectively, the perimeter of the hexagon $ A B C D E F $ and hexagon $ A_1B_1C_1D_1E_1F_1 $. Suppose that all inner angles of hexagon $ A_1B_1C_1D_1E_1F_1 $ are equal. Prove that \[ p \geq \frac{2 \cdot \sqrt{3}}{3} \cdot p_1 .\] When does equality hold ?

Let $ a_1,a_2,...,a_n$ is permutaion of $ 1,2,...,n$. For this permutaion call the pair $ (a_i,a_j)$ [i]wrong pair [/i]if $ i<j$ and $ a_i >a_j$.Let [i]number of inversion [/i] is number of [i]wrong pair [/i] of permutation $ a_1,a_2,a_3,..,a_n$. Let $ n \ge 2$ is positive integer. Find the number of permutation of $ 1,2,..,n$ such that its [i]number of inversion [/i]is divisible by $ n$.

Determine the smallest positive real number $ k$ with the following property. Let $ ABCD$ be a convex quadrilateral, and let points $ A_1$, $ B_1$, $ C_1$, and $ D_1$ lie on sides $ AB$, $ BC$, $ CD$, and $ DA$, respectively. Consider the areas of triangles $ AA_1D_1$, $ BB_1A_1$, $ CC_1B_1$ and $ DD_1C_1$; let $ S$ be the sum of the two smallest ones, and let $ S_1$ be the area of quadrilateral $ A_1B_1C_1D_1$. Then we always have $ kS_1\ge S$. [i]Author: Zuming Feng and Oleg Golberg, USA[/i]

Let $ABCD$ be a rectangle with: $AB=a$, $BC=b$. Inside the rectangle we have to exteriorly tangents circles such that one is tangent to the sides $AB$ and $AD$,the other is tangent to the sides $CB$ and $CD$. 1. Find the distance between the centers of the circles(using $a$ and $b$). 2. When the radiums of both circles change the tangency point between both of them changes, and describes a locus. Find that locus.

Define the sequence of positive integers $\{a_n\}$ as follows. Let $a_1=1$, $a_2=3$, and for each $n>2$, let $a_n$ be the result of expressing $a_{n-1}$ in base $n-1$, then reading the resulting numeral in base $n$, then adding $2$ (in base $n$). For example, $a_2=3_{10}=11_2$, so $a_3=11_3+2_3=6_{10}$. Express $a_{2013}$ in base $10$.

Let $ABC$ be a triangle with $AB = 13$, $BC = 14$, and $AC = 15$. Let $D$ and $E$ be the midpoints of $BC$ and $AB$, respectively. If $AD$ and $CE$ intersect at $G$, compute the area of quadrilateral $BEGD$.

A round robin tournament is held with $2016$ participants. Each player plays each other player once and no games result in ties. We say a pair of players $A$ and $B$ is a [i]dominant pair[/i] if all other players either defeat $A$ and $B$ or are defeated by both $A$ and $B$. Find the maximum number dominant pairs. [i]Proposed by Nathan Ramesh

Let be a natural number $ n\ge 2. $ Prove that there exists an unique bipartition $ \left( A,B \right) $ of the set $ \{ 1,2\ldots ,n \} $ such that $ \lfloor \sqrt x \rfloor\neq y , $ for any $ x,y\in A , $ and $ \lfloor \sqrt z \rfloor\neq t , $ for any $ z,t\in B. $ [i]Costin Bădică[/i]

Suppose $a_1$, $a_2$, $\ldots$, $a_{10}$ are nonnegative integers such that \[\sum_{k=1}^{10}a_k=15\qquad\text{and}\qquad \sum_{k=1}^{10}ka_k = 80.\] Let $M$ and $m$ denote the maximum and minimum respectively of $\sum_{k=1}^{10}k^2a_k$. Compute $M-m$.

Determine the number of sets $A = \{a_1,a_2,...,a_{1000}\}$ of positive integers satisfying $a_1 < a_2 <...< a_{1000} \le 2014$, for which we have that the set $S = \{a_i + a_j | 1 \le i, j \le 1000$ with $i + j \in A\}$ is a subset of $A$.

Fuzzy likes isosceles trapezoids. He can choose lengths from $1, 2, \dots, 8$, where he may choose any amount of each length. He takes a multiset of three integers from $1, \dots, 8$. From this multiset, one length will become a base length, one will become a diagonal length, and one will become a leg length. He uses each element as either a diagonal, leg, or base length exactly once. Fuzzy is happy if he can use these lengths to make an isosceles trapezoid such that the undecided base has nonzero rational length. How many multiset choices can he make? (Multisets are unordered) [i]Proposed by Timothy Qian[/i]

[b]9.[/b] Show that if the trigonometric polynomial $f(\theta)= \sum_{v=1}^{n} a_v \cos v\theta$ monotonically decreases over the closed interval $[0,\pi]$, then the trigonometric polynomial $g(\theta)=\sum_{v=1}^{n}a_v \sin v\theta$ is non negative in the same interval. [b](S. 26)[/b]