Real numbers $x_1,x_2,...x_{2004},y_1,y_2,...y_{2004}$ differ from $1$ and are such that $x_ky_k=1$ for every $k=1,2,...,2004$. Calculate the sum $$S=\frac{1}{1-x_1^3}+\frac{1}{1-x_2^3}+...+\frac{1}{1-x_{2004}^3}+\frac{1}{1-y_1^3}+\frac{1}{1-y_2^3}+...+\frac{1}{1-y_{2004}^3}$$

Find a set of five different relatively prime natural numbers such, that the sum of an arbitrary subset is a composite number.

A pyramid of non-negative integers is constructed as follows (a) The first row consists of only $0$, (b) The second row consists of $1$ and $1$, (c) The $n^{th}$ (for $n > 2$) is an array of $n$ integers among which the left most and right most elements are equal to $n - 1$ and the interior numbers are equal to the sum of two adjacent numbers from the $(n - 1)^{th}$ row (see Figure). Let $S_n$ be the sum of numbers in row $n^{th}$. Determine the remainder when dividing $S_{2018}$ by $2018$: A. $2$ B. $4$ C. $6$ D. $11$ E. $17$

The sum of all terms of a finite arithmetical progression of integers is a power of two. Prove that the number of terms is also a power of two.

It is known that the merchant’s $n$ clients live in locations laid along the ring road. Of these, $k$ customers have debts to the merchant for $a_1,a_2,...,a_k$ rubles, and the merchant owes the remaining $n-k$ clients, whose debts are $b_1,b_2,...,b_{n-k}$ rubles, moreover, $a_1+a_2+...+a_k=b_1+b_2+...+b_{n-k}$. Prove that a merchant who has no money can pay all his debts and have paid all the customer debts, by starting a customer walk along the road from one of points and not missing any of their customers.

Prove that if the numbers $a, b, c$ are related by the relation $\frac{1}{a}+ \frac{1}{b}+ \frac{1}{c}= \frac{1}{a+b+c}$ then the sum of some two of them is equal to zero.

Calculate the sum of all unsimplified fractions whose numerator and denominator are positive divisors of $1000$.

Let $a, b$ and $c$ be positive real numbers such that $a + b + c = 1$. Prove that $$\frac{a}{b}+\frac{b}{a}+\frac{b}{c}+\frac{c}{b}+\frac{c}{a}+\frac{a}{c} \ge 2\sqrt2 \left( \sqrt{\frac{1-a}{a}}+\sqrt{\frac{1-b}{b}}+\sqrt{\frac{1-c}{c}}\right)$$

Do there exist four polynomials $P_1(x), P_2(x), P_3(x), P_4(x)$ with real coefficients, such that the sum of any three of them always has a real root, but the sum of any two of them has no real root?

Consider a sequence of positive integers with total sum $20$ such that no number and no sum of a set of consecutive numbers is equal to $3$. Is it possible for such a sequence to contain more than $10$ numbers? (Alexandr Shapovalov)

A $3\times 3$ table is filled with real numbers in such a way that each number in the table is equal to the absolute value of the difference of the sum of numbers in its row and the sum of numbers in its column. (a) Show that any number in this table can be expressed as a sum or a difference of some two numbers in the table. (b) Show that there is such a table not all of whose entries are $0$.

A polynomial $x^n + a_1x^{n-1} + a_2x^{n-2} +... + a_{n-2}x^2 + a_{n-1}x + a_n$ has $n$ distinct real roots $x_1, x_2,...,x_n$, where $n > 1$. The polynomial $nx^{n-1}+ (n - 1)a_1x^{n-2} + (n - 2)a_2x^{n-3} + ...+ 2a_{n-2}x + a_{n-1}$ has roots $y_1, y_2,..., y_{n_1}$. Prove that $\frac{x^2_1+ x^2_2+ ...+ x^2_n}{n}>\frac{y^2_1 + y^2_2 + ...+ y^2_{n-1}}{n - 1}$

Let $a_1 = 1, a_2, a_3,...$: be a sequence of positive integers such that $$a_k < 1 + a_1 + a_2 +... + a_{k-1}$$ for all $k > 1$. Prove that every positive integer can be expressed as a sum of $a_i$s.

Prove that some (or one) of any $100$ integers can always be chosen so that the sum of the chosen integers is divisible by $100$.

Let $n$ be a positive integer and let $a_1$, $a_2$,..., $a_n$ be positive integers from set $\{1, 2,..., n\}$ such that every number from this set occurs exactly once. Is it possible that numbers $a_1$, $a_1 + a_2 ,..., a_1 + a_2 + ... + a_n$ all have different remainders upon division by $n$, if: $a)$ $n=7$ $b)$ $n=8$

Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.

The product of three positive numbers is $1$ and their sum is greater than the sum of their inverses. Prove that one of these numbers is greater than $1$, while the other two are smaller than $1$.

Let $S$ be the sum of the greatest odd divisors of the natural numbers $1$ through $2^n$. Prove that $3S = 4^n + 2$.

Let $S_n=\sum_{k=0}^{n}\frac{1}{\sqrt{k+1}+\sqrt{k}}$. What is the value of $\sum_{n=1}^{99}\frac{1}{S_n+S_{n-1}}$ ?

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]

The pages of a notebook are numbered consecutively so that the numbers $1$ and $2$ are on the second sheet, numbers $3$ and $4$, and so on. A sheet is torn out of this notebook. All of the remaining page numbers are addedand have sum $2021$. (a) How many pages could the notebook originally have been? (b) What page numbers can be on the torn sheet? (Walther Janous)

Let $n$ be a positive integer, and let $a_1,a_2,...,a_n$ be $n$ positive real numbers such that $a_1+a_2+...+a_n = 1$. Is it true that $\frac{a_1^4}{a_1^2+a_2^2}+\frac{a_2^4}{a_2^2+a_3^2}+\frac{a_3^4}{a_3^2+a_4^2}+...+\frac{a_{n-1}^4}{a_{n-1}^2+a_n^2}+\frac{a_n^4}{a_n^2+a_1^2}\ge \frac{1}{2n}$ ? Justify your answer.

Source: 1976 Euclid Part A Problem 2 ----- The sum of the series $2+5+8+11+14+...+50$ equals $\textbf{(A) } 90 \qquad \textbf{(B) } 425 \qquad \textbf{(C) } 416 \qquad \textbf{(D) } 442 \qquad \textbf{(E) } 495$

Given a sequence of $19$ positive integers not exceeding $88$ and another sequence of $88$ positive integers not exceeding $19$. Show that we can find two subsequences of consecutive terms, one from each sequence, with the same sum.

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)