A grasshopper is jumping about in a grid. From the point with coordinates $(a, b)$ it can jump to either $(a + 1, b),(a + 2, b),(a + 1, b + 1),(a, b + 2)$ or $(a, b + 1)$. In how many ways can it reach the line $x + y = 2014?$ Where the grasshopper starts in $(0, 0)$.

Chord $ \left[AD\right]$ is perpendicular to the diameter $ \left[BC\right]$ of a circle. Let $ E$ and $ F$ be the midpoints of the arcs $ AC$ and $ CD$, respectively. If $ AD\bigcap BE\equal{}\left\{G\right\}$, $ AF\bigcap BC\equal{}\left\{H\right\}$ and $ m(AC)\equal{}\alpha$, find the measure of angle $ BHC$ in terms of $ \alpha$. $\textbf{(A)}\ 90{}^\circ \minus{}\frac{\alpha }{2} \qquad\textbf{(B)}\ 60{}^\circ \minus{}\frac{\alpha }{3} \qquad\textbf{(C)}\ \alpha \minus{}30{}^\circ \\ \qquad\textbf{(D)}\ 15{}^\circ \plus{}\frac{\alpha }{2} \qquad\textbf{(E)}\ \frac{180{}^\circ \minus{}2\alpha }{3}$

A collection $F$ of distinct (not necessarily non-empty) subsets of $X = \{1,2,\ldots,300\}$ is [i]lovely[/i] if for any three (not necessarily distinct) sets $A$, $B$ and $C$ in $F$ at most three out of the following eight sets are non-empty \begin{align*}A \cap B \cap C, \ \ \ \overline{A} \cap B \cap C, \ \ \ A \cap \overline{B} \cap C, \ \ \ A \cap B \cap \overline{C}, \\ \overline{A} \cap \overline{B} \cap C, \ \ \ \overline{A} \cap B \cap \overline {C}, \ \ \ A \cap \overline{B} \cap \overline{C}, \ \ \ \overline{A} \cap \overline{B} \cap \overline{C} \end{align*} where $\overline{S}$ denotes the set of all elements of $X$ which are not in $S$. What is the greatest possible number of sets in a lovely collection?

Let $ a,b,c$ be real numbers. Prove that $ (ab\plus{}bc\plus{}ca\minus{}1)^2 \le (a^2\plus{}1)(b^2\plus{}1)(c^2\plus{}1)$.

Let $A_1,A_2,\ldots,A_n$ be subsets of a finite set $S$ such that $|A_j|=8$ for each $j$. For a subset $B$ of $S$ let $F(B)=\{j \mid 1\le j\le n \ \ \text{and} \ A_j \subset B\}$. Suppose for each subset $B$ of $S$ at least one of the following conditions holds [list][b](a)[/b] $|B| > 25$, [b](b)[/b] $F(B)={\O}$, [b](c)[/b] $\bigcap_{j\in F(B)} A_j \neq {\O}$.[/list] Prove that $A_1\cap A_2 \cap \cdots \cap A_n \neq {\O}$.

If an integer $a > 1$ is given such that $\left(a-1\right)^3+a^3+\left(a+1\right)^3$ is the cube of an integer, then show that $4\mid a$.

Suppose that k and x are positive integers such that $$\frac{k}{2}=\left( \sqrt{1 +\frac{\sqrt3}{2}}\right)^x+\left( \sqrt{1 -\frac{\sqrt3}{2}}\right)^x.$$ Find the sum of all possible values of $k$

Elmo makes $ N$ sandwiches for a fundraiser. For each sandwich he uses $ B$ globs of peanut butter at 4 cents per glob and $ J$ blobs of jam at 5 cents per glob. The cost of the peanut butter and jam to make all the sandwiches is $ \$$2.53. Assume that $ B, J,$ and $ N$ are all positive integers with $ N > 1$. What is the cost of the jam Elmo uses to make the sandwiches? $ \textbf{(A) } \$1.05 \qquad \textbf{(B) } \$1.25 \qquad \textbf{(C) } \$1.45 \qquad \textbf{(D) } \$1.65 \qquad \textbf{(E) } \$1.85$

Let $\otimes$ be a binary operation that takes two positive real numbers and returns a positive real number. Suppose further that $\otimes$ is continuous, commutative $(a\otimes b=b\otimes a)$, distributive across multiplication $(a\otimes(bc)=(a\otimes b)(a\otimes c))$, and that $2\otimes 2=4$. Solve the equation $x\otimes y=x$ for $y$ in terms of $x$ for $x>1$.

Given three reals $a_1,\,a_2,\,a_3>1,\,S=a_1+a_2+a_3$. Provided ${a_i^2\over a_i-1}>S$ for every $i=1,\,2,\,3$ prove that \[\frac{1}{a_1+a_2}+\frac{1}{a_2+a_3}+\frac{1}{a_3+a_1}>1.\]

Let $ ABCD$ be a quadrilateral, and $ E$ be intersection points of $ AB,CD$ and $ AD,BC$ respectively. External bisectors of $ DAB$ and $ DCB$ intersect at $ P$, external bisectors of $ ABC$ and $ ADC$ intersect at $ Q$ and external bisectors of $ AED$ and $ AFB$ intersect at $ R$. Prove that $ P,Q,R$ are collinear.

See all the problems from 5-th Kyiv math festival [url=http://www.mathlinks.ro/Forum/viewtopic.php?p=506789#p506789]here[/url] Let $O$ be the circumcenter and $H$ be the intersection point of the altitudes of acute triangle $ABC.$ The straight lines $BH$ and $CH$ intersect the segments $CO$ and $BO$ at points $D$ and $E$ respectively. Prove that if triangles $ODH$ and $OEH$ are isosceles then triangle $ABC$ is isosceles too.

Let $n$ be a positive integer and $A$ a set containing $8n + 1$ positive integers co-prime with $6$ and less than $30n$. Prove that there exist $a, b \in A$ two different numbers such that $a$ divides $b$.

Prove the identity $ \frac{n-1}{2}=\sum_{k=1}^n \left\{ \frac{m+k-1}{n} \right\} , $ where $ n\ge 2, m $ are natural numbers, and $ \{\} $ denotes the fractional part.

Let $P(x)$ be a monic polynomial with integer coefficients of degree $10$. Prove that there exist distinct positive integers $a,b$ not exceeding $101$ such that $P(a)-P(b)$ is divisible by $101$.

Two cyclists ride on two intersecting circles. Each of them rides on his own circle at a constant speed. Having left at the same time from one of the points of intersection of the circles and having made one lap each, the cyclists meet again at this point. Prove that there exists a fixed point in the plane, the distances from which to cyclists are the same all the time, regardless of the directions they travel in. [i]Proposed by N. Vasiliev and I. Sharygin[/i]

Inscribed Circle of rhombus $ABCD$ touches $AB,BC,CD,DA$ at $E,F,G,H$. $l_1,l_2$ are two lines that are tangent to the circle. $l_1\cap AB=M,l_1\cap BC=N,l_2\cap CD=P,l_2\cap DA=Q$. Prove that $MQ/\! /NP$.

Suppose we have a pack of $2n$ cards, in the order $1, 2, . . . , 2n$. A perfect shuffle of these cards changes the order to $n+1, 1, n+2, 2, . . ., n- 1, 2n, n$ ; i.e., the cards originally in the first $n$ positions have been moved to the places $2, 4, . . . , 2n$, while the remaining $n$ cards, in their original order, fill the odd positions $1, 3, . . . , 2n - 1.$ Suppose we start with the cards in the above order $1, 2, . . . , 2n$ and then successively apply perfect shuffles. What conditions on the number $n$ are necessary for the cards eventually to return to their original order? Justify your answer. [hide="Remark"] Remark. This problem is trivial. Alternatively, it may be required to find the least number of shuffles after which the cards will return to the original order.[/hide]

Find all primes $p,q$ such that \[p^q-q^p=pq^2-19\]

Find all functions $f: \mathbb R^{+} \to \mathbb R^{+}$ satisfying \begin{align*} f(f(x)+y) = f(y) + x, \qquad \text{for all } x,y \in \mathbb R^{+}. \end{align*} Note that $\mathbb R^{+}$ is the set of all positive real numbers.

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $a_1, a_2, \cdots, a_{2n}$ be $2n$ elements of $\{1, 2, 3, \cdots, 2n-1\}$ ($n>3$) with the sum $a_1+a_2+\cdots+a_{2n}=4n$. Prove that exist some numbers $a_i$ with the sum is $2n$.

Let $a_k$ be the number of nonnegative integers $ n $ with the properties: a) $n\in[0, 10^k)$ has exactly $ k $ digits, such that he zeroes on the first positions of $ n $ are included in the decimal writting. b) the digits of $ n $ can be permutated such that the new number is divisible by $11.$ Show that $a_{2m}=10a_{2m-1}$ for every $m\in\mathbb{N}.$

Let $ABC$ be a triangle with $ \widehat{BAC}\neq 90^\circ $. Let $M$ be the midpoint of $BC$. We choose a variable point $D$ on $AM$. Let $(O_1)$ and $(O_2)$ be two circle pass through $ D$ and tangent to $BC$ at $B$ and $C$. The line $BA$ and $CA$ intersect $(O_1),(O_2)$ at $ P,Q$ respectively. [b]a)[/b] Prove that tangent line at $P$ on $(O_1)$ and $Q$ on $(O_2)$ must intersect at $S$. [b]b)[/b] Prove that $S$ lies on a fix line.

Positive integers $a$ and $b$ are each less than 6. What is the smallest possible value for $2\cdot a-a\cdot b$? $\textbf{(A) }-20\qquad\textbf{(B) }-15\qquad\textbf{(C) }-10\qquad\textbf{(D) }0\qquad\textbf{(E) }2$