We are given a convex quadrilateral and point $M$ inside it . The perimeter of the quadrilateral has length $L$ while the lengths of the diagonals are $D_1$ and $D_2$. Prove that the sum of the distances from $M$ to the vertices of the quadrilateral are not greater than $L + D_1 + D_2$ . (V. Prasolov)

We consider on a circle a finite number of real numbers with the sum strictly greater than $0$. Of all the sums that have as terms numbers on consecutive positions on the circle, let $S$ be the largest sum and $s$ the smallest sum. Show that $S + s> 0$.

It is given that the equation $x^2 + ax + 20 = 0$ has integer roots. What is the sum of all possible values of $a$?

Find all sets of $n\ge 2$ consecutive integers $\{a+1,a+2,...,a+n\}$ where $a\in Z$, in which one of the numbers is equal to the sum of all the others. (Bogdan Rublev)

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

Consider all sets $A$ of one hundred different natural numbers with the property that any three elements $a,b,c \in A$ (not necessarily different) are the sides of a non-obtuse triangle. Denote by $S(A)$ the sum of the perimeters of all such triangles. Compute the smallest possible value of $S(A)$.

A $x>2$ real number is given. Bob has got $1997$ labels and writes one of the numbers $"x^0, x^1, x^2 ,\dotsm x^{1995}, x^{1996}"$ each labels such that all labels has distinct numbers. Bob puts some labels to right pocket, some labels to left pocket. Prove that sum of numbers of the right pocket never equal to sum of numbers of the left pocket.

Fix $a_1, . . . , a_n \in (0, 1)$ and define $$f(I) = \prod_{i \in I} a_i \cdot \prod_{j \notin I} (1 - a_j)$$ for each $I \subseteq \{1, . . . , n\}$. Assuming that $$\sum_{I\subseteq \{1,...,n\}, |I| odd} {f(I)} = \frac12,$$ show that at least one $a_i$ has to be equal to $\frac12$. (Paolo Leonetti)

For any integer $n\ge2$ evaluate the sum \[\sum_{k=1}^{n^2-1}\bigl\lfloor\sqrt k\bigr\rfloor.\]

For an integer $n \ge 1$ we consider sequences of $2n$ numbers, each equal to $0, -1$ or $1$. The [i]sum product value[/i] of such a sequence is calculated by first multiplying each pair of numbers from the sequence, and then adding all the results together. For example, if we take $n = 2$ and the sequence $0,1, 1, -1$, then we find the products $0\cdot 1, 0\cdot 1, 0\cdot -1, 1\cdot 1, 1\cdot -1, 1\cdot -1$. Adding these six results gives the sum product value of this sequence: $0+0+0+1+(-1)+(-1) = -1$. The sum product value of this sequence is therefore smaller than the sum product value of the sequence $0, 0, 0, 0$, which equals $0$. Determine for each integer $n \ge 1$ the smallest sum product value that such a sequence of $2n$ numbers could have. [i]Attention: you are required to prove that a smaller sum product value is impossible.[/i]

a) $100$ numbers (some positive, some negative) are written in a row. All of the following three types of numbers are underlined: 1) every positive number, 2) every number whose sum with the number following it is positive, 3) every number whose sum with the two numbers following it is positive. Can the sum of all underlined numbers be (i) negative? (ii) equal to zero? b) $n$ numbers (some positive and some negative) are written in a row. Each positive number and each number whose sum with several of the numbers following it is positive is underlined. Prove that the sum of all underlined numbers is positive.

Let $a, b, c$ be real numbers such that: $$\frac{a}{b + c}+\frac{b}{c + a}+\frac{c}{a + b}= 1$$ Determine all values ​​which the following expression can take : $$\frac{a^2}{b + c} + \frac{b^2}{c + a} + \frac{c^2}{a + b}.$$

For $k=1,2,\ldots ,2011$ we denote $S_k=\frac{1}{k}+\frac{1}{k+1}+\cdots +\frac{1}{2011}$. Compute the sum $S_1+S_1^2+S_2^2+\cdots +S_{2011}^2$.

Let $s_m$ be the number $66\cdots 6$ with $m$ digits $6$. Find \[ s_1 + s_2 + \cdots + s_n \]

Integers $1, 2,...,100$ are written on a circle, not necessarily in that order. Can it be that the absolute value of the dierence between any two adjacent integers is at least $30$ and at most $50$?

Let $a<b<c<d<e$ be real numbers. Among the $10$ sums of the pairs of these numbers, the least $3$ are $32,36,37$, while the largest two are $48$ and $51$. Find all possible values of $e$

For which positive integers $n \ge 2$ it is possible to represent the number $n^2$ as a sum of n distinct positive integers not exceeding $\frac{3n}{2}$ ?

Determine the positive integers $n \ge 3$ such that, for every integer $m \ge 0$, there exist integers $a_1, a_2,..., a_n$ such that $a_1 + a_2 +...+ a_n = 0$ and $a_1a_2 + a_2a_3 + ...+a_{n-1}a_n + a_na_1 = -m$ Alexandru Mihalcu

Let $q(n)$ denote the sum of the digits of a natural number $n$. Determine $q(q(q(2000^{2000})))$.

Let $P$ be an interior point of a circle and $A_1,A_2...,A_{10}$ be points on the circle such that $\angle A_1PA_2 = \angle A_2PA_3 = ... = \angle A_{10}PA_1 = 36^o$. Prove that $PA_1 + PA_3 + PA_5 + PA_7 +PA_9 = PA_2 + PA_4 + PA_6 + PA_8 + PA_{10}$.

For every natural number $n$ prove that $$\left( 1+ \frac12 + ...+ \frac1n \right)^2+ \left( \frac12 + ...+ \frac1n \right)^2+...+ \left( \frac{1}{n-1} + \frac12 \right)^2+ \left( \frac1n \right)^2=2n- \left( 1+ \frac12 + ...+ \frac1n \right)$$ (S. Manukian, Yerevan)

Let a positive integer $n$ be given. Determine, in terms of $n$, the least positive integer $k$ such that among any $k$ positive integers, it is always possible to select a positive even number of them having sum divisible by $n$.

Let there be a $n\times n$ board. Write down $0$ or $1$ in all $n^2$ squares. For $1 \le k \le n$, let $A_k$ be the product of all numbers in the $k$th row. How many ways are there to write down the numbers so that $A_1 + A_2 + ... + A_n$ is even?

Show that there is a subset of $A$ from $\{1,2, 3,... , 2014\}$ such that : (i) $|A| = 12$ (ii) for each coloring number in $A$ with red or white , we can always find some numbers colored in $A$ whose sum is $2015$.

Denote $f(m) =\sum_{k=1}^m (-1)^k cos \frac{k\pi}{2 m + 1}$ For which positive integers $m$ is $f(m)$ rational?