Let $ a>1$ be a positive integer. Prove that every non-zero positive integer $ N$ has a multiple in the sequence $ (a_n)_{n\ge1}$, $ a_n\equal{}\left\lfloor\frac{a^n}n\right\rfloor$.

Let $ABC$ be a triangle and $\ell_1,\ell_2$ be two parallel lines. Let $\ell_i$ intersects line $BC,CA,AB$ at $X_i,Y_i,Z_i$, respectively. Let $\Delta_i$ be the triangle formed by the line passed through $X_i$ and perpendicular to $BC$, the line passed through $Y_i$ and perpendicular to $CA$, and the line passed through $Z_i$ and perpendicular to $AB$. Prove that the circumcircles of $\Delta_1$ and $\Delta_2$ are tangent.

One side of the rectangle is $1$ cm. It is known that the rectangle can be divided by two orthogonal lines onto four rectangles, and each of the smaller rectangles has the area not less than $1$ square centimetre, and one of them is not less than $2$ square centimetres. What is the least possible length of another side of big rectangle?

For all $n\ge2$, let $a_n$ be the product of all coprime natural numbers less than $n$. Prove that (a) $n\mid a_n+1\Leftrightarrow n=2,4,p^\alpha,2p^\alpha$ (b) $n\mid a_n-1\Leftrightarrow n\ne2,4,p^\alpha,2p^\alpha$ Here $p$ is an odd prime number and $\alpha\in\mathbb N$.

David and Evan are playing a game. Evan thinks of a positive integer $N$ between 1 and 59, inclusive, and David tries to guess it. Each time David makes a guess, Evan will tell him whether the guess is greater than, equal to, or less than $N$. David wants to devise a strategy that will guarantee that he knows $N$ in five guesses. In David's strategy, each guess will be determined only by Evan's responses to any previous guesses (the first guess will always be the same), and David will only guess a number which satisfies each of Evan's responses. How many such strategies are there? Note: David need not guess $N$ within his five guesses; he just needs to know what $N$ is after five guesses.

A TV station holds a math talent competition, where each participant will be scored by 8 people. The scores are F (failed), G (good), or E (exceptional). The competition is participated by three people, A, B, and C. In the competition, A and B get the same score from exactly 4 people. C states that he has differing scores with A from at least 4 people, and also differing scores with B from at least 4 people. Assuming C tells the truth, how many scoring schemes can occur?

A container contains five red balls. On each turn, one of the balls is selected at random, painted blue, and returned to the container. The expected number of turns it will take before all five balls are colored blue is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

DeAndre Jordan shoots free throws that are worth $1$ point each. He makes $40\%$ of his shots. If he takes two shots find the probability that he scores at least $1$ point.

$100$ integers are arranged in a circle. Each number is greater than the sum of the two subsequent numbers (in a clockwise order). Determine the maximal possible number of positive numbers in such circle. [i](S.Berlov)[/i]

Find all positive integers $n$ for which $(x^n+y^n+z^n)/2$ is a perfect square whenever $x$, $y$, and $z$ are integers such that $x+y+z=0$.

For all positive real numbers $a,b,c$, prove that \[\sqrt{\frac{a^4 + 2b^2c^2}{a^2+2bc}} + \sqrt{\frac{b^4+2c^2a^2}{b^2+2ca}} + \sqrt{\frac{c^4 + 2a^2b^2}{c^2 + 2ab}} \geq a + b + c.\] [i]In-Sung Na.[/i]

As shown in the figure below, six semicircles lie in the interior of a regular hexagon with side length $2$ so that the diameters of the semicircles coincide with the sides of the hexagon. What is the area of the shaded region—inside the hexagon but outside all of the semicircles? [asy] size(140); fill((1,0)--(3,0)--(4,sqrt(3))--(3,2sqrt(3))--(1,2sqrt(3))--(0,sqrt(3))--cycle,gray(0.4)); fill(arc((2,0),1,180,0)--(2,0)--cycle,white); fill(arc((3.5,sqrt(3)/2),1,60,240)--(3.5,sqrt(3)/2)--cycle,white); fill(arc((3.5,3sqrt(3)/2),1,120,300)--(3.5,3sqrt(3)/2)--cycle,white); fill(arc((2,2sqrt(3)),1,180,360)--(2,2sqrt(3))--cycle,white); fill(arc((0.5,3sqrt(3)/2),1,240,420)--(0.5,3sqrt(3)/2)--cycle,white); fill(arc((0.5,sqrt(3)/2),1,300,480)--(0.5,sqrt(3)/2)--cycle,white); draw((1,0)--(3,0)--(4,sqrt(3))--(3,2sqrt(3))--(1,2sqrt(3))--(0,sqrt(3))--(1,0)); draw(arc((2,0),1,180,0)--(2,0)--cycle); draw(arc((3.5,sqrt(3)/2),1,60,240)--(3.5,sqrt(3)/2)--cycle); draw(arc((3.5,3sqrt(3)/2),1,120,300)--(3.5,3sqrt(3)/2)--cycle); draw(arc((2,2sqrt(3)),1,180,360)--(2,2sqrt(3))--cycle); draw(arc((0.5,3sqrt(3)/2),1,240,420)--(0.5,3sqrt(3)/2)--cycle); draw(arc((0.5,sqrt(3)/2),1,300,480)--(0.5,sqrt(3)/2)--cycle); label("$2$",(3.5,3sqrt(3)/2),NE); [/asy] $\textbf{(A)}\ 6\sqrt3-3\pi \qquad\textbf{(B)}\ \frac{9\sqrt3}{2}-2\pi \qquad\textbf{(C)}\ \frac{3\sqrt3}{2}-\frac{\pi}{3} \qquad\textbf{(D)}\ 3\sqrt3-\pi \\ \qquad\textbf{(E)}\ \frac{9\sqrt3}{2}-\pi$

For each positive integer $n\geq 2$ we denote with $p(n)$ the largest prime number less than or equal to $n$, and with $q(n)$ the smallest prime number larger than $n$. Prove that \[ \sum^n_{k=2} \frac 1{p(k)q(k)} < \frac 12. \]

A right circular cone has base radius $ r$ and height $ h$. The cone lies on its side on a flat table. As the cone rolls on the surface of the table without slipping, the point where the cone's base meets the table traces a circular arc centered at the point where the vertex touches the table. The cone first returns to its original position on the table after making $ 17$ complete rotations. The value of $ h/r$ can be written in the form $ m\sqrt {n}$, where $ m$ and $ n$ are positive integers and $ n$ is not divisible by the square of any prime. Find $ m \plus{} n$.

Let $ H$ be a set of real numbers that does not consist of $ 0$ alone and is closed under addition. Further, let $ f(x)$ be a real-valued function defined on $ H$ and satisfying the following conditions: \[ \;f(x)\leq f(y)\ \mathrm{if} \;x \leq y\] and \[ f(x\plus{}y)\equal{}f(x)\plus{}f(y) \;(x,y \in H)\ .\] Prove that $ f(x)\equal{}cx$ on $ H$, where $ c$ is a nonnegative number. [M. Hosszu, R. Borges]

An integer $N$ which satisfies exactly three of the four following conditions is called [i]two-good[/i]. $~$ [center] (I) $N$ is divisible by $2$ (II) $N$ is divisible by $4$ (III) $N$ is divisible by $8$ (IV) $N$ is divisible by $16$ [/center]$~$ How many integers between $1$ and $100$, inclusive, are [i]two-good[/i]? $\textbf{(A) }6\qquad\textbf{(B) }7\qquad\textbf{(C) }8\qquad\textbf{(D) }9\qquad\textbf{(E) }10$

Each point of a plane is painted in one of three colors. Show that there exists a triangle such that: $ (i)$ all three vertices of the triangle are of the same color; $ (ii)$ the radius of the circumcircle of the triangle is $ 2008$; $ (iii)$ one angle of the triangle is either two or three times greater than one of the other two angles.

We define the polynomial $$P (x) = 2014x^{2013} + 2013x^{2012} +... + 4x^3 + 3x^2 + 2x.$$ Find the largest prime divisor of $P (2)$.

Let $S$ be the set of [b]discs[/b] $D$ contained completely in the set $\{ (x,y) : y<0\}$ (the region below the $x$-axis) and centered (at some point) on the curve $y=x^2-\frac{3}{4}$. What is the area of the union of the elements of $S$?

Determine all positive integers $n$ for which there exists an integer $m$ such that ${2^{n}-1}$ is a divisor of ${m^{2}+9}$.

Let $ABC$ be a triangle with $\angle C=60^o$. The point $P$ is the symmetric of $A$ with respect to the point of tangency of the circle inscribed with the side $BC$ . Show that if the perpendicular bisector of the $CP$ segment intersects the line containing the angle - bisector of $\angle B$ at the point $Q$, then the triangle $CPQ$ is equilateral.

Find the following limit. $ \lim_{n\to\infty} \int_{\minus{}1}^1 |x|\left(1\plus{}x\plus{}\frac{x^2}{2}\plus{}\frac{x^3}{3}\plus{}\cdots \plus{}\frac{x^{2n}}{2n}\right)\ dx$.

The parallelogram $ABCD$ has $AB=a,AD=1,$ $\angle BAD=A$, and the triangle $ABD$ has all angles acute. Prove that circles radius $1$ and center $A,B,C,D$ cover the parallelogram if and only \[a\le\cos A+\sqrt3\sin A.\]

Let $ f$ be a strictly increasing, continuous function mapping $ I=[0,1]$ onto itself. Prove that the following inequality holds for all pairs $ x,y \in I$: \[ 1-\cos (xy) \leq \int_0^xf(t) \sin (tf(t))dt + \int_0^y f^{-1}(t) \sin (tf^{-1}(t)) dt .\] [i]Zs. Pales[/i]

Horses X, Y and Z are entered in a three-horse race in which ties are not possible. If the odds against X winning are $3-to-1$ and the odds against Y winning are $2-to-3$, what are the odds against Z winning? (By "[i]odds against H winning are p-to-q[/i]" we mean that probability of H winning the race is $\frac{q}{p+q}$.) $ \textbf{(A)}\ 3-to-20\qquad\textbf{(B)}\ 5-to-6\qquad\textbf{(C)}\ 8-to-5\qquad\textbf{(D)}\ 17-to-3\qquad\textbf{(E)}\ 20-to-3 $