Using the digits: $ 1,2,3,4,5,$ players $ A$ and $ B$ compose a $ 2005$-digit number $ N$ by selecting one digit at a time: $ A$ selects the first digit, $ B$ the second, $ A$ the third and so on. Player $ A$ wins if and only if $ N$ is divisible by $ 9$. Who will win if both players play as well as possible?

Let $ k$ be a positive integer, $ z$ a complex number, and $ \varepsilon <\frac12$ a positive number. Prove that the following inequality holds for infinitely many positive integers $ n$: \[ \mid \sum_{0\leq l \leq \frac{n}{k+1}} \binom{n-kl}{l}z^l \mid \geq (\frac 12-\varepsilon)^n.\] [i]P. Turan[/i]

Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)

Let $p \equiv 2 \pmod 3$ be a prime, $k$ a positive integer and $P(x) = 3x^{\frac{2p-1}{3}}+3x^{\frac{p+1}{3}}+x+1$. For any integer $n$, let $R(n)$ denote the remainder when $n$ is divided by $p$ and let $S = \{0,1,\cdots,p-1\}$. At each step, you can either (a) replaced every element $i$ of $S$ with $R(P(i))$ or (b) replaced every element $i$ of $S$ with $R(i^k)$. Determine all $k$ such that there exists a finite sequence of steps that reduces $S$ to $\{0\}$. [i]Proposed by fattypiggy123[/i]

Call a positive number $n$ [i]fine[/i], if there exists a prime number $p$ such that $p|n$ and $p^2\nmid n$. Prove that at least 99% of numbers $1, 2, 3, \ldots, 10^{12}$ are fine numbers.

What is angle $B$ of triangle$ ABC$, if it is known that the altitudes drawn from $A$ and $C$ intersect inside the triangle and one of them is divided by of intersection point into equal parts, and the other one in the ratio of $2: 1$, counting from the vertex?

Let $n$ be a positive integer. Morgane has coloured the integers $1,2,\ldots,n$. Each of them is coloured in exactly one colour. It turned out that for all positive integers $a$ and $b$ such that $a<b$ and $a+b \leqslant n$, at least two of the integers among $a$, $b$ and $a+b$ are of the same colour. Prove that there exists a colour that has been used for at least $2n/5$ integers. \\ \\ (Vincent Jugé)

Show that there is no positive integer $k$ for which the equation \[(n-1)!+1=n^{k}\] is true when $n$ is greater than $5$.

A large flat plate of glass is suspended $\sqrt{2/3}$ units above a large flat plate of wood. (The glass is infinitely thin and causes no funny refractive effects.) A point source of light is suspended $\sqrt{6}$ units above the glass plate. An object rests on the glass plate of the following description. Its base is an isosceles trapezoid $ABCD$ with $AB \parallel DC$, $AB = AD = BC = 1$, and $DC = 2$. The point source of light is directly above the midpoint of $CD$. The object’s upper face is a triangle $EF G$ with $EF = 2$, $EG = F G =\sqrt3$. $G$ and $AB$ lie on opposite sides of the rectangle $EF CD$. The other sides of the object are $EA = ED = 1$, $F B = F C = 1$, and $GD = GC = 2$. Compute the area of the shadow that the object casts on the wood plate.

The sequence $a_n$ for $n \in \mathbb{N}$ is defined as follows: \[ a_0 = 6, \quad a_1 = 7, \quad a_{n+2} = 3a_{n+1} - 2a_n \] Find all values of $n$ such that $n^2 = a_n$.

Eight points are equally spaced around a circle of radius $r$. If we draw a circle of radius $1$ centered at each of the eight points, then each of these circles will be tangent to two of the other eight circles that are next to it. IF $r^2=a+b\sqrt{2}$, where $a$ and $b$ are integers, then what is $a+b$? $\text{(A) }3\qquad\text{(B) }4\qquad\text{(C) }5\qquad\text{(D) }6\qquad\text{(E) }7$

Let $ a,b$ be two complex numbers. Prove that roots of $ z^{4}\plus{}az^{2}\plus{}b$ form a rhombus with origin as center, if and only if $ \frac{a^{2}}{b}$ is a non-positive real number.

If $a$, $b$, $c$ are rational, show that \[ \frac{1}{(b-c)^2}+\frac{1}{(c-a)^2}+\frac{1}{(a-b)^2} \] is the square of a rational.

$\boxed{\text{A1}}$Let $a,b,c$ be positive reals numbers such that $a+b+c=1$.Prove that $2(a^2+b^2+c^2)\ge \frac{1}{9}+15abc$

A pair of positive integer numbers \((a, b)\) is given. It turns out that for every positive integer number \(n\), for which the numbers \((n - a)(n + b)\) and \(n^2 - ab\) are positive, they have the same number of divisors. Is it necessarily true that \(a = b\)? [i]Proposed by Oleksii Masalitin[/i]

Find the number of integers $x$ which satisfy the equation $(x^2-5x+5)^{x+5}=1$.

Find the integer that is closest to $ 1000 \sum_{n=3}^{10000}\frac{1}{n^{2}-4}.$

Find all polynomials $P(x)$ with integer coefficients such that $P(P(n) + n)$ is a prime number for infinitely many integers $n$.

Given a triangle $ABC$. Its incircle is tangent to $BC, CA, AB$ at $D, E, F$ respectively. Let $K, L$ be points on $CA, AB$ respectively such that $K \neq A \neq L, \angle EDK = \angle ADE, \angle FDL = \angle ADF$. Prove that the circumcircle of $AKL$ is tangent to the incircle of $ABC$.

Let $n$ be a positive integer, such that $125n+22$ is a power of $3$. Prove that $125n+29$ has a prime factor greater than $100$.

Given a sequence $\{a_n\}$ of real numbers such that $|a_{k+m} - a_k - a_m| \leq 1$ for all positive integers $k$ and $m$, prove that, for all positive integers $p$ and $q$, \[|\frac{a_p}{p} - \frac{a_q}{q}| < \frac{1}{p} + \frac{1}{q}.\]

Let $\triangle ABC$ be a triangle in a plane such that $AB=13$, $BC=14$, and $CA=15$. Let $D$ be a point in three-dimensional space such that $\angle{BDC}=\angle{CDA}=\angle{ADB}=90^\circ$. Let $d$ be the distance from $D$ to the plane containing $\triangle ABC$. The value $d^2$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m+n$. [i]Proposed by William Yue[/i]

Line passes the focal point $F$ of parabola $y^2=8(x+2)$ with bank angle of $60^{\circ}$ intersects the parabola at $A,B$. Perpendicular bisector of $AB$ intersects $x$-axis at $P$, then the length of $PF$ is $\text{(A)}\frac{16}{3}\qquad\text{(B)}\frac{8}{3}\qquad\text{(C)}\frac{16}{3}\sqrt3\qquad\text{(D)}8\sqrt3$

In a class, the total numbers of boys and girls are in the ratio $4 : 3$. On one day it was found that $8$ boys and $14$ girls were absent from the class, and that the number of boys was the square of the number of girls. What is the total number of students in the class?

Prove that there exists a prime number $p$, such that the sum of digits of $p$ is a composite odd integer. Find the smallest such $p$.