Find all polynomials $f\in Z[X],$ such that for each odd prime $p$ $$f(p)|(p-3)!+\frac{p+1}{2}.$$

Is it possible to dissect a regular decagon along some of its diagonals so that the resulting parts can form two regular polygons? by N.Beluhov

Fermat determines that since his final exam counts as two tests, he only needs to score a $28$ on it for his test average to be $70$. If he gets a perfect $100$ on the final exam, his average will be $88$. What is the lowest score Fermat can receive on his final and still have an average of $80$? $\text{(A) }60\qquad\text{(B) }66\qquad\text{(C) }68\qquad\text{(D) }70\qquad\text{(E) }72$

Points $A_1, A_2, ..., A_{10}$ are marked on a circle clockwise. It is known that these points can be divided into pairs of points symmetric with respect to the centre of the circle. Initially at each marked point there was a grasshopper. Every minute one of the grasshoppers jumps over its neighbour along the circle so that the resulting distance between them doesn't change. It is not allowed to jump over any other grasshopper and to land at a point already occupied. It occurred that at some moment nine grasshoppers were found at points $A_1, A_2, ... , A_9$ and the tenth grasshopper was on arc $A_9A_{10}A_1$. Is it necessarily true that this grasshopper was exactly at point $A_{10}$?

Is there a positive integer with at most four digits whose value is increased by exactly $60\%$ when the first digit is moved to the end of the number? For example, when the first digit of $1234$ is moved to the end of the number, the result is the integer $2341$.

A tree $T$ is given. Starting with the complete graph on $n$ vertices, subgraphs isomorphic to $T$ are erased at random until no such subgraph remains. For what trees does there exist a positive constant $c$ such that the expected number of edges remaining is at least $cn^2$ for all positive integers $n$? [i]David Yang.[/i]

What is the maximum value of $\frac{(2^t-3t)t}{4^t}$ for real values of $t?$ $\textbf{(A)}\ \frac{1}{16} \qquad\textbf{(B)}\ \frac{1}{15} \qquad\textbf{(C)}\ \frac{1}{12} \qquad\textbf{(D)}\ \frac{1}{10} \qquad\textbf{(E)}\ \frac{1}{9}$

If $a_k >0$ [ $k=$1, 2, $\cdots$, $n$], then prove the following inequality $$\left (\sum \limits_{k=1}^n a_k^5 \right )^4 \geq \frac{1}{n} \left (\frac{2}{n-1} \right )^5 \left (\sum \limits_{1\leq i<j\leq n} a_i^2a_j^2 \right )^5$$

Equilateral triangle $ABC$ has side length $6$. Circles with centers at $A$, $B$, and $C$ are drawn such that their respective radii $r_A$, $r_B$, and $r_C$ form an arithmetic sequence with $r_A<r_B<r_C$. If the shortest distance between circles $A$ and $B$ is $3.5$, and the shortest distance between circles $A$ and $C$ is $3$, then what is the area of the shaded region? Express your answer in terms of pi. [asy] size(8cm); draw((0,0)--(6,0)--6*dir(60)--cycle); draw(circle((0,0),1)); draw(circle(6*dir(60),1.5)); draw(circle((6,0),2)); filldraw((0,0)--arc((0,0),1,0,60)--cycle, grey); filldraw(6*dir(60)--arc(6*dir(60),1.5,240,300)--cycle, grey); filldraw((6,0)--arc((6,0),2,120,180)--cycle, grey); label("$A$",(0,0),SW); label("$B$",6*dir(60),N); label("$C$",(6,0),SE); [/asy]

Ray's car averages 40 miles per gallon of gasoline, and Tom's car averages 10 miles per gallon of gasoline. Ray and Tom each drive the same number of miles. What is the cars' combined rate of miles per gallon of gasoline? $ \textbf{(A) }10\qquad\textbf{(B) }16\qquad\textbf{(C) }25\qquad\textbf{(D) }30\qquad\textbf{(E) }40 $

Given a positive integer $n$, find the least $\lambda>0$ such that for any $x_1,\ldots x_n\in \left(0,\frac{\pi}{2}\right)$, the condition $\prod_{i=1}^{n}\tan x_i=2^{\frac{n}{2}}$ implies $\sum_{i=1}^{n}\cos x_i\le\lambda$. [i]Huang Yumin[/i]

Show that for all $x > 1$ there is a triangle with sides, $x^4 + x^3 + 2x^2 + x + 1, 2x^3 + x^2 + 2x + 1, x^4 - 1.$

$n$ students want to equally partition $m$ identical cakes between themselves. What’s the minimal number of pieces of cake one has to cut, so that the upper condition is satisfied? Each cut increases the number of pieces by 1.

For a $n\times n$ complex valued matrix $A$, show that the following two conditions are equivalent. (i) There exists a $n\times n$ complex valued matrix $B$ such that $AB-BA=A$. (ii) There exists a positive integer $k$ such that $A^k = O$. ($O$ is the zero matrix.)

In right triangle $\triangle{ABC}$, a square $WXYZ$ is inscribed such that vertices $W$ and $X$ lie on hypotenuse $\overline{AB}$, vertex $Y$ lies on leg $\overline{BC}$, and vertex $Z$ lies on leg $\overline{CA}$. Let $\overline{AY}$ and $\overline{BZ}$ intersect at some point $P$. If the length of each side of square $WXYZ$ is $4$, the length of the hypotenuse $\overline{AB}$ is $60$, and the distance between point $P$ and point $G$, where $G$ denotes the centroid of $\triangle{ABC}$, is $\tfrac{a}{b}$, compute the value of $a+b$.

Positive integer $d$ is not perfect square. For each positive integer $n$, let $s(n)$ denote the number of digits $1$ among the first $n$ digits in the binary representation of $\sqrt{d}$ (including the digits before the point). Prove that there exists an integer $A$ such that $s(n)>\sqrt{2n}-2$ for all integers $n\ge A$

Show that for every positive integer $n$ we have: $$\sum_{k=0}^{n}\left(\frac{2n+1-k}{k+1}\right)^k=\left(\frac{2n+1}{1}\right)^0+\left(\frac{2n}{2}\right)^1+...+\left(\frac{n+1}{n+1}\right)^n\leq 2^n$$ [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $ABC$ be an acute triangle with $AB<BC$. Let $I$ be the incenter of $ABC$, and let $\omega$ be the circumcircle of $ABC$. The incircle of $ABC$ is tangent to the side $BC$ at $K$. The line $AK$ meets $\omega$ again at $T$. Let $M$ be the midpoint of the side $BC$, and let $N$ be the midpoint of the arc $BAC$ of $\omega$. The segment $NT$ intersects the circumcircle of $BIC$ at $P$. Prove that $PM\parallel AK$.

Two rays with common endpoint $O$ forms a $30^\circ$ angle. Point $A$ lies on one ray, point $B$ on the other ray, and $AB = 1$. The maximum possible length of $OB$ is $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ \dfrac{1+\sqrt{3}}{\sqrt{2}} \qquad \textbf{(C)}\ \sqrt{3} \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ \dfrac{4}{\sqrt{3}}$

The feet of the perpendiculars from the intersection point of the diagonals of a convex cyclic quadrilateral to the sides form a quadrilateral $q$. Show that the sum of the lengths of each pair of opposite sides of $q$ is equal.

[b](a)[/b]Prove that every pentagon with integral coordinates has at least two vertices , whose respective coordinates have the same parity. [b](b)[/b]What is the smallest area possible of pentagons with integral coordinates. Albanian National Mathematical Olympiad 2010---12 GRADE Question 3.

Prove that $\sigma(n)\phi(n) < n^2$, but that there is a positive constant $c$ such that $\sigma(n)\phi(n) \ge c n^2$ holds for all positive integers $n$.

Find the area of the shaded region. [i]Lightning 1.4[/i]

Given a triangle $ABC$ satisfying $AC+BC=3\cdot AB$. The incircle of triangle $ABC$ has center $I$ and touches the sides $BC$ and $CA$ at the points $D$ and $E$, respectively. Let $K$ and $L$ be the reflections of the points $D$ and $E$ with respect to $I$. Prove that the points $A$, $B$, $K$, $L$ lie on one circle. [i]Proposed by Dimitris Kontogiannis, Greece[/i]

Let $(a_n)$ defined by: $a_0=1, \; a_1=p, \; a_2=p(p-1)$, $a_{n+3}=pa_{n+2}-pa_{n+1}+a_n, \; \forall n \in \mathbb{N}$. Knowing that (i) $a_n>0, \; \forall n \in \mathbb{N}$. (ii) $a_ma_n>a_{m+1}a_{n-1}, \; \forall m \ge n \ge 0$. Prove that $|p-1| \ge 2$.