Let $P$ be a regular polygon with $ 4k + 1 $ sides (where $ k $ is a natural) whose vertices are $ A_1, A_2, ..., A_ {4k + 1} $ (in that order ). Each vertex $ A_j $ of $P$ is assigned a natural of the set $ \{1,2, ..., 4k + 1 \} $ such that no two vertices are assigned the same number. On $P$ the following operation is performed: Let $ B_j $ be the midpoint of the side $ A_jA_ {j + 1} $ for $ j = 1,2, ..., 4k + 1 $ (where is consider $ A_ {4k + 2} = A_1 $). If $ a $, $ b $ are the numbers assigned to $ A_ {j} $ and $ A_ {j + 1} $, respectively, the midpoint $ B_j $ is written the number $ 7a-3b $. By doing this with each of the $ 4k + 1 $ sides, the $ 4k + 1 $ vertices initially arranged are erased. We will say that a natural $ m $ is [i]fatal [/i] if for all natural $ k $ , no matter how the vertices of $P$ are initially arranged, it is impossible to obtain $ 4k + 1 $ equal numbers through a finite amount of operations from $ m $. a) Determine if the $ 2010 $ is fatal or not. Justify. b) Prove that there are infinite fatal numbers. [color=#f00]PS. A help in translation of the 2nd paragraph is welcome[/color]. [hide=Original wording]Diremos que un natural $m$ es fatal si no importa cómo se disponen inicialmente los vértices de ${P}$, es imposible obtener mediante una cantidad finita de operaciones $4k+1$ números iguales a $m$.[/hide]

Let $S$ be the sum of all positive integers $n$ such that $\frac{3}{5}$ of the positive divisors of $n$ are multiples of $6$ and $n$ has no prime divisors greater than $3$. Compute $\frac{S}{36}$.

Let $ M \equal{} \{ x_1..., x_{30}\}$ a set which consists of 30 distinct positive numbers, let $ A_n,$ $ 1 \leq n \leq 30,$ the sum of all possible products with $ n$ elements each of the set $ M.$ Prove if $ A_{15} > A_{10},$ then $ A_1 > 1.$

Let $FELDSPAR$ be a regular octagon, and let $I$ be a point in its interior such that $\angle FIL = \angle LID =$ $\angle DIS$ $=\angle SIA.$ Compute $\angle IAR$ in degrees.

Let $ K $ be the midpoint of the side $ AB $ of a given triangle $ ABC $. Let $ L $ and $ M$ be points on the sides $ AC $ and $ BC$, respectively, such that $ \angle CLK = \angle KMC $. Prove that the perpendiculars to the sides $ AB, AC, $ and $ BC $ passing through $ K,L, $ and $M$, respectively, are concurrent.

Let $D$ be the midpoint of the arc $B-A-C$ of the circumcircle of $\triangle ABC (AB<AC)$. Let $E$ be the foot of perpendicular from $D$ to $AC$. Prove that $|CE|=\frac{|BA|+|AC|}{2}$.

The solution of the equation $ 7^{x\plus{}7}\equal{}8^x$ can be expressed in the form $ x\equal{}\log_b 7^7$. What is $ b$? $ \textbf{(A)}\ \frac{7}{15} \qquad \textbf{(B)}\ \frac{7}{8} \qquad \textbf{(C)}\ \frac{8}{7} \qquad \textbf{(D)}\ \frac{15}{8} \qquad \textbf{(E)}\ \frac{15}{7}$

$n$ positive numbers are given. Is it always possible to find a convex polygon with $n+3$ edges and a triangulation of it so that the length of the diameters used in the triangulation are the given $n$ numbers? [i]Proposed by Morteza Saghafian[/i]

Let $ a$, $ b$, $ c$ be integers each with absolute value less than or equal to $ 10$. The cubic polynomial $ f(x) \equal{} x^3 \plus{} ax^2 \plus{} bx \plus{} c$ satisfies the property \[ \Big|f\left(2 \plus{} \sqrt 3\right)\Big| < 0.0001. \] Determine if $ 2 \plus{} \sqrt 3$ is a root of $ f$.

Let $\ell$ be a given line, $A$ and $B$ given points of the plane. Choose a point $P$ on $\ell $ so that the longer of the segments $AP$, $BP$ is as short as possible. (If $AP = BP,$ either segment may be taken as the longer one.)

Find all integer solutions to the equation $7x^2y^2 + 4x^2 = 77y^2 + 1260$.

A point $D$ is placed on the side $ BC$ of the triangle $ABC$. Circles are inscribed in the triangles $ABD$ and $ACD$, their common exterior tangent line (other than $BC$) intersects $AD$ at the point $K$. Prove that the length of $AK$ does not depend on the position of $D$. (An exterior tangent of two circles is one which is tangent to both circles but does not pass between them.) (I Sharygin)

Let $ x$ be an arbitrary real number in $ (0,1)$. For every positive integer $ k$, let $ f_k(x)$ be the number of points $ mx\in [k,k \plus{} 1)$ $ m \equal{} 1,2,...$ Show that the sequence $ \sqrt [n]{f_1(x)f_2(x)\cdots f_n(x)}$ is convergent and find its limit.

In the triangle $ABC$, the excircle opposite to the vertex $A$ with centre $I$ touches the side BC at D. (The circle also touches the sides of $AB$, $AC$ extended.) Let $M$ be the midpoint of $BC$ and $N$ the midpoint of $AD$. Prove that $I,M,N$ are collinear.

We are given an $n \times n$ board, where $n$ is an odd number. In each cell of the board either $+1$ or $-1$ is written. Let $a_k$ and $b_k$ denote them products of numbers in the $k^{th}$ row and in the $k^{th}$ column respectively. Prove that the sum $a_1 +a_2 +\cdots+a_n +b_1 +b_2 +\cdots+b_n$ cannot be equal to zero.

Let $\Gamma_1$ and $\Gamma_2$ be circles - with respective centres $O_1$ and $O_2$ - that intersect each other in $A$ and $B$. The line $O_1A$ intersects $\Gamma_2$ in $A$ and $C$ and the line $O_2A$ intersects $\Gamma_1$ in $A$ and $D$. The line through $B$ parallel to $AD$ intersects $\Gamma_1$ in $B$ and $E$. Suppose that $O_1A$ is parallel to $DE$. Show that $CD$ is perpendicular to $O_2C$.

An equilateral triangle is divided into $n^2$ congruent equilateral triangles. A spider stands at one of the vertices, a fly at another. Alternately each of them moves to a neighbouring vertex. Prove that the spider can always catch the fly.

Find all integer $n$ such that the following property holds: for any positive real numbers $a,b,c,x,y,z$, with $max(a,b,c,x,y,z)=a$ , $a+b+c=x+y+z$ and $abc=xyz$, the inequality $$a^n+b^n+c^n \ge x^n+y^n+z^n$$ holds.

Denote by $S(n)$ the sum of the digits of the positive integer $n$. Find all the solutions of the equation $n(S(n)-1)=2010.$

For each pair of positive integers $(x, y)$ a nonnegative integer $x\Delta y$ is defined. It is known that for all positive integers $a$ and $b$ the following equalities hold: i. $(a + b)\Delta b = a\Delta b + 1$. ii. $(a\Delta b) \cdot (b\Delta a) = 0$. Find the values of the expressions $2016\Delta 121$ and $2016\Delta 144$.

Suppose that $x$ and $y$ are different real numbers such that $\frac{x^n-y^n}{x-y}$ is an integer for some four consecutive positive integers $n$. Prove that $\frac{x^n-y^n}{x-y}$ is an integer for all positive integers n.

Find the non-constant function $f(x)$ such that $f(x)=x^2-\int_0^1 (f(t)+x)^2dt.$

Let $D$ be a point different from the vertices on the side $BC$ of a triangle $ABC.$ Let $I, \: I_1$ and $I_2$ be the incenters of the triangles $ABC, \: ABD$ and $ADC,$ respectively. Let $E$ be the second intersection point of the circumcircles of the triangles $AI_1I$ and $ADI_2,$ and $F$ be the second intersection point of the circumcircles of the triangles $AII_2$ and $AI_1D.$ Prove that if $AI_1=AI_2,$ then \[ \frac{EI}{FI} \cdot \frac{ED}{FD}=\frac{{EI_1}^2}{{FI_1}^2}.\]

Let $m,n$ and $a_1,a_2,\dots,a_m$ be arbitrary positive integers. Ali and Mohammad Play the following game. At each step, Ali chooses $b_1,b_2,\dots,b_m \in \mathbb{N}$ and then Mohammad chosses a positive integers $s$ and obtains a new sequence $\{c_i=a_i+b_{i+s}\}_{i=1}^m$, where $$b_{m+1}=b_1,\ b_{m+2}=b_2, \dots,\ b_{m+s}=b_s$$ The goal of Ali is to make all the numbers divisible by $n$ in a finite number of steps. FInd all positive integers $m$ and $n$ such that Ali has a winning strategy, no matter how the initial values $a_1, a_2,\dots,a_m$ are. [hide=clarification] after we create the $c_i$ s, this sequence becomes the sequence that we continue playing on, as in it is our 'new' $a_i$[/hide] Proposed by Shayan Gholami

Let $(a_1,a_2,a_3,a_4,a_5)$ be a random permutation of the integers from $1$ to $5$ inclusive. Find the expected value of $$\sum^5_{i=1} |a_i -i | = |a_1 -1|+|a_2 -2|+|a_3 -3|+|a_4 -4|+|a_5 -5|.$$ [i]Proposed by Muztaba Syed[/i]