Find all positive integer $n$, such that there exists $n$ points $P_1,\ldots,P_n$ on the unit circle , satisfying the condition that for any point $M$ on the unit circle, $\sum_{i=1}^n MP_i^k$ is a fixed value for \\a) $k=2018$ \\b) $k=2019$.

Determine all rhombuses $ ABCD$ with the given length $ 2a$ of ist sides by giving the angle $ \alpha \equal{} \angle BAD$, such that there exists a circle which cuts each side of the rhombus in a chord of length $ a$.

Show that $ n\equiv 0\pmod 9 $ if $ 2^n\equiv -1\pmod n, $ where $ n $ is a natural number greater than $ 3. $

Let $ <h_n>$ $ n\in\mathbb N$ a harmonic sequence of positive real numbers (that means that every $ h_n$ is the harmonic mean of its two neighbours $ h_{n\minus{}1}$ and $ h_{n\plus{}1}$ : $ h_n\equal{}\frac{2h_{n\minus{}1}h_{n\plus{}1}}{h_{n\minus{}1}\plus{}h_{n\plus{}1}}$) Show that: if the sequence includes a member $ h_j$, which is the square of a rational number, it includes infinitely many members $ h_k$, which are squares of rational numbers.

Consider a rectangular grid of $ 10 \times 10$ unit squares. We call a [i]ship[/i] a figure made up of unit squares connected by common edges. We call a [i]fleet[/i] a set of ships where no two ships contain squares that share a common vertex (i.e. all ships are vertex-disjoint). Find the greatest natural number that, for each its representation as a sum of positive integers, there exists a fleet such that the summands are exactly the numbers of squares contained in individual ships.

Let $a,b,c$ be positive reals such that $a+b+c=ab+bc+ca$. Prove that \[ (a+b)^{ab-bc}(b+c)^{bc-ca}(c+a)^{ca-ab} \ge a^{ca}b^{ab}c^{bc}. \][i]Proposed by Sammy Luo[/i]

Let $n\ge 3$ be a fixed integer. There are $m\ge n+1$ beads on a circular necklace. You wish to paint the beads using $n$ colors, such that among any $n+1$ consecutive beads every color appears at least once. Find the largest value of $m$ for which this task is $\emph{not}$ possible. [i]Carl Schildkraut, USA[/i]

Prove that there are arithmetic progressions of arbitrary length, consisting of different pairwise coprime natural numbers.

For a positive integer $n$ we denote by $u(n)$ the largest prime number less than or equal to $n$, and with $v(n)$ the smallest prime number larger than $n$. Prove that \[ \frac 1 {u(2)v(2)} + \frac 1{u(3)v(3)} + \cdots + \frac 1{ u(2010)v(2010)} = \frac 12 - \frac 1{2011}. \]

Find all functions from the reals to the reals satisfying \[f(xf(y) + x) = xy + f(x)\]

$n(n\geq2)$ is a given intenger, and $a_1,a_2,...,a_n$ are real numbers. For any $i=1,2,\cdots ,n$, $$a_i\neq -1,a_{i+2}=\frac{a_i^2+a_i}{a_{i+1}+1}.$$ Prove: $a_1=a_2=\cdots=a_n$. (Note: $a_{n+1}=a_1,a_{n+2}=a_2$.)

Let $P(x) = x^4 + ax^3 + bx^2 + cx + d$ and $Q(x) = x^2 + px + q$be two real polynomials. Suppose that there exista an interval $(r,s)$ of length greater than $2$ SUCH THAT BOTH $P(x)$ AND $Q(x)$ ARE nEGATIVE FOR $X \in (r,s)$ and both are positive for $x > s$ and $x<r$. Show that there is a real $x_0$ such that $P(x_0) < Q(x_0)$

Let $a_i, b_i$ be coprime positive integers for $i = 1, 2, \ldots , k$, and $m$ the least common multiple of $b_1, \ldots , b_k$. Prove that the greatest common divisor of $a_1 \frac{m}{b_1} , \ldots, a_k \frac{m}{b_k}$ equals the greatest common divisor of $a_1, \ldots , a_k.$

Two players, $B$ and $R$, play the following game on an infinite grid of unit squares, all initially colored white. The players take turns starting with $B$. On $B$'s turn, $B$ selects one white unit square and colors it blue. On $R$'s turn, $R$ selects two white unit squares and colors them red. The players alternate until $B$ decides to end the game. At this point, $B$ gets a score, given by the number of unit squares in the largest (in terms of area) simple polygon containing only blue unit squares. What is the largest score $B$ can guarantee? (A [i]simple polygon[/i] is a polygon (not necessarily convex) that does not intersect itself and has no holes.) [i]Proposed by David Torres[/i]

Restore the isosceles triangle $ABC$ ($AB = AC$) if the common points $I, M, H$ of bisectors, medians and altitudes respectively are given.

Sequence $\{a_n\}$ defined by recurrence relation $a_{n+1} = 1+\frac{n^2}{a_n}$. Given $a_1>1$, find the value of $\lim\limits_{n\to\infty} \frac{a_n}{n}$ with proof.

The values of $ a$ in the equation: $ \log_{10}(a^2 \minus{} 15a) \equal{} 2$ are: $ \textbf{(A)}\ \frac {15\pm\sqrt {233}}{2} \qquad\textbf{(B)}\ 20, \minus{} 5 \qquad\textbf{(C)}\ \frac {15 \pm \sqrt {305}}{2}$ $ \textbf{(D)}\ \pm20 \qquad\textbf{(E)}\ \text{none of these}$

Find $x$ such that trigonometric \[\frac{\sin 3x \cos (60^\circ -4x)+1}{\sin(60^\circ - 7x) - \cos(30^\circ + x) + m}=0\] where $m$ is a fixed real number.

Let $f:(0,+\infty)\to(0,+\infty)$ be a decreasing function which satisfies $\int^\infty_0f(x)\text dx<+\infty$. Prove that $\lim_{x\to+\infty}xf(x)=0$.

Let $a_0, a_1, a_2, a_3, a_4$ be five positive numbers in the arithmetic progression with a difference $d$. Prove that $a^3_2 \leq \frac{1}{10}(a^3_0 + 4a^3_1 + 4a^3_3 + a^3_4).$

Let $p$ be a positive integer, $p>1.$ Find the number of $m\times n$ matrices with entries in the set $\left\{ 1,2,\dots,p\right\} $ and such that the sum of elements on each row and each column is not divisible by $p.$

Prove for each non-negative integer $n$ and real number $x$ the inequality \[ \sin{x} \cdot(n \sin{x}-\sin{nx}) \geq 0 \]

Determine all integers $n>1$ such that every power of $n$ has an odd number of digits.

In isosceles triangle $ABC$ with base $BC$, let $M$ be the midpoint of $BC$. Let $P$ be the intersection of the circumcircle of $\vartriangle ACM$ with the circle with center $B$ passing through $M$, such that $P \ne M$. If $\angle BPC = 135^o$, then $\frac{CP}{AP}$ can be written as $a +\sqrt{b}$ for positive integers $a$ and $b$, where $b$ is not divisible by the square of any prime. Find $a + b$.

In $\triangle ABC$ with $\angle BAC = 60^{\circ}$ and circumcircle $\omega$, the angle bisector of $\angle BAC$ intersects side $\overline{BC}$ at point $D$, and line $AD$ is extended past $D$ to a point $A'$. Let points $E$ and $F$ be the feet of the perpendiculars of $A'$ onto lines $AB$ and $AC$, respectively. Suppose that $\omega$ is tangent to line $EF$ at a point $P$ between $E$ and $F$ such that $\tfrac{EP}{FP} = \tfrac{1}{2}$. Given that $EF=6$, the area of $\triangle ABC$ can be written as $\tfrac{m\sqrt{n}}{p}$, where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p$. [i]Proposed by Taiki Aiba[/i]