Terry the Tiger lives on a cube-shaped world with edge length $2$. Thus he walks on the outer surface. He is tied, with a leash of length $2$, to a post located at the center of one of the faces of the cube. The surface area of the region that Terry can roam on the cube can be represented as $\frac{p \pi}{q} + a\sqrt{b}+c$ for integers $a, b, c, p, q$ where no integer square greater than $1$ divides $b, p$ and $q$ are coprime, and $q > 0$. What is $p + q + a + b + c$? (Terry can be at a location if the shortest distance along the surface of the cube between that point and the post is less than or equal to $2$.)

A ball of mass $m$ is launched into the air. Ignore air resistance, but assume that there is a wind that exerts a constant force $F_0$ in the -$x$ direction. In terms of $F_0$ and the acceleration due to gravity $g$, at what angle above the positive $x$-axis must the ball be launched in order to come back to the point from which it was launched? $ \textbf{(A)}\ \tan^{-1}(F_0/mg)$ $\textbf{(B)}\ \tan^{-1}(mg/F_0)$ $\textbf{(C)}\ \sin^{-1}(F_0/mg)$ $\textbf{(D)}\ \text{the angle depends on the launch speed}$ $\textbf{(E)}\ \text{no such angle is possible}$

Let $ABC$ be a triangle with orthocenter $h$. Let $AH$, $BH$, and $CH$ intersect the circumcircle of $\triangle ABC$ at points $D$, $E$, and $F$. Find the maximum value of $\frac{[DEF]}{[ABC]}$. (Here $[X]$ denotes the area of $X$.) [i]Proposed by tkhalid.[/i]

In the array of $13$ squares shown below, $8$ squares are colored red, and the remaining $5$ squares are colored blue. If one of all possible such colorings is chosen at random, the probability that the chosen colored array appears the same when rotated $90^{\circ}$ around the central square is $\tfrac{1}{n}$, where $n$ is a positive integer. Find $n$. [asy] draw((0,0)--(1,0)--(1,1)--(0,1)--(0,0)); draw((2,0)--(2,2)--(3,2)--(3,0)--(3,1)--(2,1)--(4,1)--(4,0)--(2,0)); draw((1,2)--(1,4)--(0,4)--(0,2)--(0,3)--(1,3)--(-1,3)--(-1,2)--(1,2)); draw((-1,1)--(-3,1)--(-3,0)--(-1,0)--(-2,0)--(-2,1)--(-2,-1)--(-1,-1)--(-1,1)); draw((0,-1)--(0,-3)--(1,-3)--(1,-1)--(1,-2)--(0,-2)--(2,-2)--(2,-1)--(0,-1)); size(100); [/asy]

Prove that for all positive real numbers $a,b,c$ the following inequality holds: \[(a+b+c)\left(\frac1a+\frac1b+\frac1c\right)\ge\frac{2(a^2+b^2+c^2)}{ab+bc+ca}+7\] and determine all cases of equality. [i]Lucian Petrescu[/i]

Alice and Bob want to play a game. In the beginning of the game, they are teleported to two random position on a train, whose length is $ 1 $ km. This train is closed and dark. So they dont know where they are. Fortunately, both of them have iPhone 133, it displays some information: 1. Your facing direction 2. Your total walking distance 3. whether you are at the front of the train 4. whether you are at the end of the train Moreover, one may see the information of the other one. Once Alice and Bob meet, the game ends. Alice and Bob can only discuss their strategy before the game starts. Find the least value $ x $ so that they are guarantee to end the game with total walking distance $ \le x $ km.

A tetrahedron has five edges of length $3$ and circumradius $2$. What is the length of the sixth edge?

In triangle $ ABC$, $ AB \equal{} AC \equal{} 100$, and $ BC \equal{} 56$. Circle $ P$ has radius $ 16$ and is tangent to $ \overline{AC}$ and $ \overline{BC}$. Circle $ Q$ is externally tangent to $ P$ and is tangent to $ \overline{AB}$ and $ \overline{BC}$. No point of circle $ Q$ lies outside of $ \triangle ABC$. The radius of circle $ Q$ can be expressed in the form $ m \minus{} n\sqrt {k}$, where $ m$, $ n$, and $ k$ are positive integers and $ k$ is the product of distinct primes. Find $ m \plus{} nk$.

A point $A$ is outside a circle $\mathcal K$ with center $O$. Line $AO$ intersects the circle at $B$ and $C$, and a tangent through $A$ touches the circle in $D$. Let $E$ be an arbitrary point on the line $BD$ such that $D$ lies between $B$ and $E$. The circumcircle of the triangle $DCE$ meets line $AO$ at $C$ and $F$ and line $AD$ at $D$ and $G$. Prove that the lines $BD$ and $FG$ are parallel.

Is it possible to tile $2003 \times 2003$ board by $1 \times 2$ dominoes placed horizontally and $1 \times 3$ rectangles placed vertically?

[color=darkred]Let $g:\mathbb{R}\to\mathbb{R}$ be a continuous and strictly decreasing function with $g(\mathbb{R})=(-\infty,0)$ . Prove that there are no continuous functions $f:\mathbb{R}\to\mathbb{R}$ with the property that there exists a natural number $k\ge 2$ so that : $\underbrace{f\circ f\circ\ldots\circ f}_{k\text{ times}}=g$ . [/color]

Let $ \{f_n \}_{n=0}^{\infty}$ be a uniformly bounded sequence of real-valued measurable functions defined on $ [0,1]$ satisfying \[ \int_0^1 f_n^2=1.\] Further, let $ \{ c_n \}$ be a sequence of real numbers with \[ \sum_{n=0}^{\infty} c_n^2= +\infty.\] Prove that some re-arrangement of the series $ \sum_{n=0}^{\infty} c_nf_n$ is divergent on a set of positive measure. [i]J. Komlos[/i]

Let $ ABCD$ be an inscribed quadrilateral and let $ E$ be the midpoint of the diagonal $ BD$. Let $ \Gamma_1,\Gamma_2,\Gamma_3,\Gamma_4$ be the circumcircles of triangles $ AEB$, $ BEC$, $ CED$ and $ DEA$ respectively. Prove that if $ \Gamma_4$ is tangent to the line $ CD$, then $ \Gamma_1,\Gamma_2,\Gamma_3$ are tangent to the lines $ BC,AB,AD$ respectively.

The number $2013$ is expressed in the form \[2013=\frac{a_1!a_2!\cdots a_m!}{b_1!b_2!\cdots b_n!},\] where $a_1\ge a_2\ge\cdots\ge a_m$ and $b_1\ge b_2\ge\cdots\ge b_n$ are positive integers and $a_1+b_1$ is as small as possible. What is $|a_1-b_1|$? ${ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D}}\ 4\qquad\textbf{(E)}\ 5 $

Let $n$ and $k$ be positive integers. A baby uses $n^2$ blocks to form a $n\times n$ grid, with each of the blocks having a positive integer no greater than $k$ on it. The father passes by and notice that: 1. each row on the grid can be viewed as an arithmetic sequence with the left most number being its leading term, with all of them having distinct common differences; 2. each column on the grid can be viewed as an arithmetic sequence with the top most number being its leading term, with all of them having distinct common differences, Find the smallest possible value of $k$ (as a function of $n$.) Note: The common differences might not be positive. Proposed by Chu-Lan Kao

Let be a continuous function $ f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R} $ that has a root, and for which the line $ y=0 $ in the Cartesian plane is an horizontal asymptote. Show that $ f $ is bounded and touches its boundaries. [i]Mihai Piticari[/i] and [i]Vladimir Cerbu[/i]

Determine the maximum possible value of $$\sqrt{x}(2\sqrt{x}+\sqrt{1-x})(3\sqrt{x}+4\sqrt{1-x})$$ over all $x\in [0,1]$.

Let $f:\mathbb{N}\to\mathbb{N}$ be a function satisfying the following conditions: (a) $f(1)=1$. (b) $f(a)\leq f(b)$ whenever $a$ and $b$ are positive integers with $a\leq b$. (c) $f(2a)=f(a)+1$ for all positive integers $a$. How many possible values can the $2014$-tuple $(f(1),f(2),\ldots,f(2014))$ take?

Given a triangle $ABC$, let $P$ be a point inside the triangle such that $| BP | > | AP |, | BP | > | CP |$. Show that $\angle ABC <90^o$

At $n$ distinct points of a circular race course there are $n$ cars ready to start. Each car moves at a constant speed and covers the circle in an hour. On hearing the initial signal, each of them selects a direction and starts moving immediately. If two cars meet, both of them change directions and go on without loss of speed. Show that at a certain moment each car will be at its starting point.

The sum of the greatest integer less than or equal to $x$ and the least integer greater than or equal to $x$ is $5$. The solution set for $x$ is $ \textbf{(A)}\ \Big\{\frac{5}{2}\Big\}\qquad\textbf{(B)}\ \big\{x\ |\ 2 \le x \le 3\big\}\qquad\textbf{(C)}\ \big\{x\ |\ 2\le x < 3\big\}\qquad \\ \textbf{(D)}\ \Big\{x\ |\ 2 < x \le 3\Big\}\qquad\textbf{(E)}\ \Big\{x\ |\ 2 < x < 3\Big\} $

We say that a quadruple of nonnegative real numbers $(a,b,c,d)$ is [i]balanced [/i]if $$a+b+c+d=a^2+b^2+c^2+d^2.$$ Find all positive real numbers $x$ such that $$(x-a)(x-b)(x-c)(x-d)\geq 0$$ for every balanced quadruple $(a,b,c,d)$. \\ \\ (Ivan Novak)

Assume the $m$ is a given integer greater than $ 1$. Find the largest number $C$ such that for all $n \in N$ we have $$\sum_{1\le k \le m ,\,\, (k,m)=1}\frac{1}{k}\ge C \sum_{k=1}^{m}\frac{1}{k}$$

3. Six points A, B, C, D, E, F are connected with segments length of $1$. Each segment is painted red or black probability of $\frac{1}{2}$ independence. When point A to Point E exist through segments painted red, let $X$ be. Let $X=0$ be non-exist it. Then, for $n=0,2,4$, find the probability of $X=n$.

There exists a unique pair of positive integers $k,n$ such that $k$ is divisible by $6$, and $\sum_{i=1}^ki^2=n^2$. Find $(k,n)$.