Show that for any integer $n\geq2$ and all integers $a_{1},a_{2},...,a_{n}$ the product $\prod_{i<j}{(a_{j}-a_{i})}$ is divisible by $\prod_{i<j}{(j-i)}$ .

Let $ a_1,a_2,...,a_n$ be nonnegative real numbers. Prove that \[ ( \sum_{i=1}^na_i)( \sum_{i=1}^na_i^{n-1}) \leq n \prod_{i=1}^na_i+ (n-1) ( \sum_{i=1}^na_i^n).\] [i]J. Suranyi[/i]

Let $ a_0,a_1,\dots,a_{n \plus{} 1}$ be natural numbers such that $ a_0 \equal{} a_{n \plus{} 1} \equal{} 1$, $ a_i>1$ for all $ 1\leq i \leq n$, and for each $ 1\leq j\leq n$, $ a_i|a_{i \minus{} 1} \plus{} a_{i \plus{} 1}$. Prove that there exist one $ 2$ in the sequence.

Define a search algorithm called $\texttt{powSearch}$. Throughout, assume $A$ is a 1-indexed sorted array of distinct integers. To search for an integer $b$ in this array, we search the indices $2^0,2^1,\ldots$ until we either reach the end of the array or $A[2^k] > b$. If at any point we get $A[2^k] = b$ we stop and return $2^k$. Once we have $A[2^k] > b > A[2^{k-1}]$, we throw away the first $2^{k-1}$ elements of $A$, and recursively search in the same fashion. For example, for an integer which is at position $3$ we will search the locations $1, 2, 4, 3$. Define $g(x)$ to be a function which returns how many (not necessarily distinct) indices we look at when calling $\texttt{powSearch}$ with an integer $b$ at position $x$ in $A$. For example, $g(3) = 4$. If $A$ has length $64$, find \[g(1) + g(2) + \ldots + g(64).\]

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$.

Prove that if the function $ f : \mathbb{R}^2 \rightarrow [0,1]$ is continuous and its average on every circle of radius $ 1$ equals the function value at the center of the circle, then $ f$ is constant. [i]V. Totik[/i]

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.

Prove that for positive real numbers $x$, $y$, $z$, \[ x^3(y^2+z^2)^2 + y^3(z^2+x^2)^2+z^3(x^2+y^2)^2 \geq xyz\left[xy(x+y)^2 + yz(y+z)^2 + zx(z+x)^2\right].\] [i]Zarathustra (Zeb) Brady.[/i]

Let $a,b,c,d$ be positive reals such taht $a+b+c+d=1$. Prove that: \[6(a^{3}+b^{3}+c^{3}+d^{3})\geq a^{2}+b^{2}+c^{2}+d^{2}+\frac{1}{8}.\]

The following diagram shows an eight-sided polygon $ABCDEFGH$ with side lengths $8,15,8,8,8,6,8,$ and $29$ as shown. All of its angles are right angles. Turn this eight-sided polygon into a six-sided polygon by connecting $B$ to $D$ with an edge and $E$ to $G$ with an edge to form polygon $ABDEGH$. Find the perimeter of $ABDEGH$. [asy] size(200); defaultpen(linewidth(2)); pen qq=font("phvb"); pair rectangle[] = {origin,(0,-8),(15,-8),(15,-16),(23,-16),(23,-8),(29,-8),(29,0)}; string point[] = {"A","B","C","D","E","F","G","H"}; int dirlbl[] = {135,225,225,225,315,315,315,45}; string value[] = {"8","15","8","8","8","6","8","29"}; int direction[] = {0,90,0,90,180,90,180,270}; for(int i=0;i<=7;i=i+1) { draw(rectangle[i]--rectangle[(i+1) % 8]); label(point[i],rectangle[i],dir(dirlbl[i]),qq); label(value[i],(rectangle[i]+rectangle[(i+1) % 8])/2,dir(direction[i]),qq); } [/asy]

Consider all $ m \times n$ matrices whose all entries are $ 0$ or $ 1$. Find the number of such matrices for which the number of $ 1$-s in each row and in each column is even.

Consider a circle $(O)$ and two fixed points $B,C$ on $(O)$ such that $BC$ is not the diameter of $(O)$. $A$ is an arbitrary point on $(O)$, distinct from $B,C$. Let $D,J,K$ be the midpoints of $BC,CA,AB$, respectively, $E,M,N$ be the feet of perpendiculars from $A$ to $BC$, $B$ to $DJ$, $C$ to $DK$, respectively. The two tangents at $M,N$ to the circumcircle of triangle $EMN$ meet at $T$. Prove that $T$ is a fixed point (as $A$ moves on $(O)$).

Show that there is a natural number $n$ such that $n!$ when written in decimal notation ends exactly in 1993 zeros.

Within a group of $ 2009$ people, every two people has exactly one common friend. Find the least value of the difference between the person with maximum number of friends and the person with minimum number of friends.

Let $ ABC$ be a given triangle with the incenter $ I$, and denote by $ X$, $ Y$, $ Z$ the intersections of the lines $ AI$, $ BI$, $ CI$ with the sides $ BC$, $ CA$, and $ AB$, respectively. Consider $ \mathcal{K}_{a}$ the circle tangent simultanously to the sidelines $ AB$, $ AC$, and internally to the circumcircle $ \mathcal{C}(O)$ of $ ABC$, and let $ A^{\prime}$ be the tangency point of $ \mathcal{K}_{a}$ with $ \mathcal{C}$. Similarly, define $ B^{\prime}$, and $ C^{\prime}$. Prove that the circumcircles of triangles $ AXA^{\prime}$, $ BYB^{\prime}$, and $ CZC^{\prime}$ all pass through two distinct points.

Leta,b,c are postive real numbers,proof that $ \frac{a}{b\plus{}2c}\plus{}\frac{b}{c\plus{}2a}\plus{}\frac{c}{a\plus{}2b}\geq1$

Two different ellipses are given. One focus of the first ellipse coincides with one focus of the second ellipse. Prove that the ellipses have at most two points in common.

Find all prime $p$ numbers such that $p^3-4p+9$ is perfect square.

a. Does there exist 4 distinct positive integers such that the sum of any 3 of them is prime? b. Does there exist 5 distinct positive integers such that the sum of any 3 of them is prime?

For any positive numbers $a, b, c$ prove the inequalities \[\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\ge \frac{2}{a+b}+\frac{2}{b+c}+\frac{2}{c+a}\ge \frac{9}{a+b+c}.\]

Find all integer triples $(m,p,q)$ satisfying \[2^mp^2+1=q^5\] where $m>0$ and both $p$ and $q$ are prime numbers.

On Monday, Millie puts a quart of seeds, $ 25\%$ of which are millet, into a bird feeder. On each successive day she adds another quart of the same mix of seeds without removing any seeds that are left. Each day the birds eat only $ 25\%$ of the millet in the feeder, but they eat all of the other seeds. On which day, just after Millie has placed the seeds, will the birds find that more than half the seeds in the feeder are millet? $ \textbf{(A)}\ \text{Tuesday}\qquad \textbf{(B)}\ \text{Wednesday}\qquad \textbf{(C)}\ \text{Thursday} \qquad \textbf{(D)}\ \text{Friday}\qquad \textbf{(E)}\ \text{Saturday}$

Consider the region $A$ in the complex plane that consists of all points $z$ such that both $\frac{z}{40}$ and $\frac{40}{\overline{z}}$ have real and imaginary parts between $0$ and $1$, inclusive. What is the integer that is nearest the area of $A$?

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?

Suppose that $f: \mathbb{R}\rightarrow\mathbb{R}$ fulfils $\left|\sum^n_{k=1}3^k\left(f(x+ky)-f(x-ky)\right)\right|\le1$ for all $n\in\mathbb{N},x,y\in\mathbb{R}$. Prove that $f$ is a constant function.