Let $ n \ge 1$ and $ k \ge 3$ be integers. A circle is divided into $ n$ sectors $ a_1,a_2,\dots,a_n$. We will color the $ n$ sectors with $ k$ different colors such that $ a_i$ and $ a_{i \plus{} 1}$ have different color for each $ i \equal{} 1,2,\dots,n$ where $ a_{n \plus{} 1}\equal{}a_1$. Find the number of ways to do such coloring.

Point $P$ is inside $\triangle ABC$. Line segments $APD$, $BPE$, and $CPF$ are drawn with $D$ on $BC$, $E$ on $AC$, and $F$ on $AB$ (see the figure at right). Given that $AP=6$, $BP=9$, $PD=6$, $PE=3$, and $CF=20$, find the area of $\triangle ABC$. [asy] size(200); pair A=origin, B=(7,0), C=(3.2,15), D=midpoint(B--C), F=(3,0), P=intersectionpoint(C--F, A--D), ex=B+40*dir(B--P), E=intersectionpoint(B--ex, A--C); draw(A--B--C--A--D^^C--F^^B--E); pair point=P; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$P$", P, dir(0));[/asy]

Two circles are tangent to each other internally at a point $\ T $. Let the chord $\ AB $ of the larger circle be tangent to the smaller circle at a point $\ P $. Prove that the line $\ TP $ bisects $\ \angle ATB $.

The incircle of a triangle $ABC$ touches the sides $BC,CA,AB$ at points $D,E,F$, respectively. Let $X$ be a point on the incircle, different from the points $D,E,F$. The lines $XD$ and $EF,XE$ and $FD,XF$ and $DE$ meet at points $J,K,L$, respectively. Let further $M,N,P$ be points on the sides $BC,CA,AB$, respectively, such that the lines $AM,BN,CP$ are concurrent. Prove that the lines $JM,KN$ and $LP$ are concurrent. [i]Dinu Serbanescu[/i]

Let $a,b$ be coprime integers. Show that the equation $ax^2 + by^2 =z^3$ has an infinite set of solutions $(x,y,z)$ with $\{x,y,z\}\in\mathbb{Z}$ and each pair of $x,y$ mutually coprime.

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.

Show that for all positive real numbers $x_1,x_2,\ldots,x_n$ with product 1, the following inequality holds \[ \frac 1{n-1+x_1 } +\frac 1{n-1+x_2} + \cdots + \frac 1{n-1+x_n} \leq 1. \]

The natural numbers are written in sequence, in increasing order, and by this we get an infinite sequence of digits. Find the least natural $k$, for which among the first $k$ digits of this sequence, any two nonzero digits have been written a different number of times. [i]Aleksandar Ivanov, Emil Kolev [/i]

show that $\frac1{15} < \frac12\cdot\frac34\cdots\frac{99}{100} < \frac1{10}$

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

Determine all natural numbers $n$ such that for each natural number $a$ relatively prime with $n$ and $a \le 1 + \left\lfloor \sqrt{n} \right\rfloor$ there exists some integer $x$ with $a \equiv x^2 \mod n$. Remark: "Natural numbers" is the set of positive integers.

Hamilton Avenue has eight houses. On one side of the street are the houses numbered 1,3,5,7 and directly opposite are houses 2,4,6,8 respectively. An eccentric postman starts deliveries at house 1 and delivers letters to each of the houses, finally returning to house 1 for a cup of tea. Throughout the entire journey he must observe the following rules. The numbers of the houses delivered to must follow an odd-even-odd-even pattern throughout, each house except house 1 is visited exactly once (house 1 is visited twice) and the postman at no time is allowed to cross the road to the house directly opposite. How many different delivery sequences are possible?

If $m$ and $n$ are integers such that $3m + 4n = 100$, what is the smallest possible value of $\left| m - n \right|$ ?

Consider the sequence $ \{a_n\}_{n\geq1}$ defined as follows: $ a_1 \equal{} 1$, $ a_{2k} \equal{} 1 \plus{} a_k$ and $ a_{2k \plus{} 1} \equal{} \frac {1}{a_{2k}}$ for every $ k\geq 1$. Prove that every positive rational number appears on the sequence $ \{a_n\}$ exactly once.

If $a, b, c$ are positive integers such that \[0 < a^{2}+b^{2}-abc \le c,\] show that $a^{2}+b^{2}-abc$ is a perfect square.

Let $u$ and $v$ be integers satisfying $0<v<u.$ Let $A=(u,v),$ let $B$ be the reflection of $A$ across the line $y=x,$ let $C$ be the reflection of $B$ across the y-axis, let $D$ be the reflection of $C$ across the x-axis, and let $E$ be the reflection of $D$ across the y-axis. The area of pentagon $ABCDE$ is 451. Find $u+v.$

There are $ 2009$ pebbles in some points $ (x,y)$ with both coordinates integer. A operation consists in choosing a point $ (a,b)$ with four or more pebbles, removing four pebbles from $ (a,b)$ and putting one pebble in each of the points \[ (a,b\minus{}1),\ (a,b\plus{}1),\ (a\minus{}1,b),\ (a\plus{}1,b)\] Show that after a finite number of operations each point will necessarily have at most three pebbles. Prove that the final configuration doesn't depend on the order of the operations.

Find all real values of $\alpha$, for which there exists one and only one function $f: \mathbb{R} \mapsto \mathbb{R}$ and satisfying the equation \[ f(x^2 + y + f(y)) = (f(x))^2 + \alpha \cdot y \] for all $x, y \in \mathbb{R}$.

Let $n$ be a positive integer, and $x$ be a positive real number. Prove that $$\sum_{k=1}^{n} \left( x \left[\frac{k}{x}\right] - (x+1)\left[\frac{k}{x+1}\right]\right) \leq n,$$ where $[x]$ denotes the largest integer not exceeding $x$.

You have some white one-by-one tiles and some black and white two-bye-one tiles as shown below. There are four different color patterns that can be generated when using these tiles to cover a three-by-one rectangoe by laying these tiles side by side (WWW, BWW, WBW, WWB). How many different color patterns can be generated when using these tiles to cover a ten-by-one rectangle? [asy] import graph; size(5cm); real labelscalefactor = 0.5; pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); draw((12,0)--(12,1)--(11,1)--(11,0)--cycle); fill((13.49,0)--(13.49,1)--(12.49,1)--(12.49,0)--cycle, black); draw((13.49,0)--(13.49,1)--(14.49,1)--(14.49,0)--cycle); draw((15,0)--(15,1)--(16,1)--(16,0)--cycle); fill((17,0)--(17,1)--(16,1)--(16,0)--cycle, black); [/asy]

Let $ a,b,c,d$ be nonnegative real numbers. Prove that \[ a^4\plus{}b^4\plus{}c^4\plus{}d^4\plus{}2abcd \ge a^2b^2\plus{}a^2c^2\plus{}a^2d^2\plus{}b^2c^2\plus{}b^2d^2\plus{}c^2d^2.\]

For each positive integer $n\leq 49$ we define the numbers $a_n = 3n+\sqrt{n^2-1}$ and $b_n=2(\sqrt{n^2+n}+\sqrt{n^2-n})$. Prove that there exist two integers $A,B$ such that \[ \sqrt{a_1-b_1}+\sqrt{a_2-b_2} + \cdots + \sqrt{a_{49}-b_{49}} = A+B\sqrt2. \]

Find all polynomials $ p$ of one variable with integer coefficients such that if $ a$ and $ b$ are natural numbers such that $ a \plus{} b$ is a perfect square, then $ p\left(a\right) \plus{} p\left(b\right)$ is also a perfect square.

Suppose that $ m$ and $ n$ are odd integers such that $ m^2\minus{}n^2\plus{}1$ divides $ n^2\minus{}1$. Prove that $ m^2\minus{}n^2\plus{}1$ is a perfect square.

Show that there are infinitely many pairs of prime numbers $(p,q)$ such that $p\mid 2^{q-1}-1$ and $q\mid 2^{p-1}-1$.