Prove that for all positive integers $n$ holds that $$\frac{1}{2 \cdot 3}+\frac{1}{3 \cdot 4}+...+\frac{1}{(2n-1) \cdot 2n}=\frac{1}{n+1}+\frac{1}{n+2}+...+\frac{1}{2n}$$

Let $B_n$ be the set of all sequences of length $n$, consisting of zeros and ones. For every two sequences $a,b \in B_n$ (not necessarily different) we define strings $\varepsilon_0\varepsilon_1\varepsilon_2 \dots \varepsilon_n$ and $\delta_0\delta_1\delta_2 \dots \delta_n$ such that $\varepsilon_0=\delta_0=0$ and $$ \varepsilon_{i+1}=(\delta_i-a_{i+1})(\delta_i-b_{i+1}), \quad \delta_{i+1}=\delta_i+(-1)^{\delta_i}\varepsilon_{i+1} \quad (0 \leq i \leq n-1). $$. Let $w(a,b)=\varepsilon_0+\varepsilon_1+\varepsilon_2+\dots +\varepsilon_n$ . Find $f(n)=\sum\limits_{a,b \in {B_n}} {w(a,b)} $. .

Prove that for a natural number $ n > 2 $ the number $ n! $ is the sum of its $ n $ various divisors.

*. Positive numbers $x_1, x_2, ..., x_{100}$ satisfy the system $$\begin{cases} x^2_1+ x^2_2+ ... + x^2_{100} > 10 000 \\ x_1 + x_2 + ...+ x_{100} < 300 \end{cases}$$ Prove that among these numbers there are three whose sum is greater than $100$.

Consider a triple $(a, b, c)$ of pairwise distinct positive integers satisfying $a + b + c = 2013$. A step consists of replacing the triple $(x, y, z)$ by the triple $(y + z - x,z + x - y,x + y - z)$. Prove that, starting from the given triple $(a, b,c)$, after $10$ steps we obtain a triple containing at least one negative number.

(a) Does there exist an infinite sequence of real numbers such that the sum of every ten successive numbers is positive, while for every $n$ the sum of the first $10n + 1$ successive numbers is negative? (b) Does there exist an infinite sequence of integers with the same properties? (AK Tolpygo)

Consider all functions $f:\mathbb{R} \to \mathbb{R}$ satisfying $f(1-f(x))=x$ for all $x \in \mathbb{R}$. a) By giving a concrete example, show that such a function exists. b) For each such function define the sum \[S_f=f(-2017)+f(-2016)+\dots+f(-1)+f(0)+f(1)+\dots+f(2017)+f(2018).\] Determine all possible values of $S_f$.

Evaluate the sum: $1^3 + 3^3 + 5^3 +... + (2n - 1)^3$.

Let $a_1, a_2,...,a_{2018}$ be a sequence of numbers such that all its elements are elements of a set $\{-1,1\}$. Sum $$S=\sum \limits_{1 \leq i < j \leq 2018} a_i a_j$$ can be negative and can also be positive. Find the minimal value of this sum

Calculate if $n\in N$ with $n>2$ the value of $$B=\sqrt{1+\frac{1}{2^2}+\frac{1}{3^2}}+\sqrt{1+\frac{1}{3^2}+\frac{1}{4^2}}+...+\sqrt{1+\frac{1}{(n-1)^2}+\frac{1}{n^2}} $$

For any positive integer n, evaluate $$\sum_{i=0}^{\lfloor \frac{n+1}{2} \rfloor} {n-i+1 \choose i}$$ , where $\lfloor n \rfloor$ is the greatest integer less than or equal to $n$ .

Inside the triangle $ABC$ a point $M$ is given . Find the points $P,Q$ and $R$ lying on the sides $AB,BC$ and $AC$ respectively and such so that the sum $MP+PQ+QR+RM$ is the smallest.

There are three squares in the picture. Find the sum of angles $ADC$ and $BDC$. [img]https://cdn.artofproblemsolving.com/attachments/c/9/885a6c6253fca17e24528f8ba8a5d31a18c845.png[/img]

Let $a, b, c$ be positive real numbers. Prove that $$\frac{a^3}{a^2 + bc}+\frac{b^3}{b^2 + ca}+\frac{c^3}{c^2 + ab} \ge \frac{(a^2 + b^2 + c^2)(ab + bc + ca)}{a^3 + b^3 + c^3 + 3abc}$$

Let $n$ be a positive integer. (a) Prove that $1^5 +3^5 +5^5 +...+(2n-1)^5$ is divisible by $n$. (b) Prove that $1^3 +3^3 +5^3 +...+(2n-1)^3$ is divisible by $n^2$.

Each of given $100$ numbers was increased by $1$. Then each number was increased by $1$ once more. Given that the first time the sum of the squares of the numbers was not changed find how this sum was changed the second time.

We call the [i]tribi [/i] of a positive integer $k$ (denoted $T(k)$) the number of all pairs $11$ in the binary representation of $k$. e.g $$T(1)=T(2)=0,\, T(3)=1, \,T(4)=T(5)=0,\,T(6)=1,\,T(7)=2.$$ Calculate $S_n=\sum_{k=1}^{2^n}T(K)$.

In the beginning, number $1$ has been written to point $(0,0)$ and $0$ has been written to any other point of integral coordinates. After every second, all numbers are replaced with the sum of the numbers in four neighbouring points at the previous second. Find the sum of numbers in all points of integral coordinates after $n$ seconds.

The diameter of a circle of radius $R$ is divided into $4$ equal parts. The point $M$ is taken on the circle. Prove that the sum of the squares of the distances from the point $M$ to the points of division (together with the ends of the diameter) does not depend on the choice of the point $M$. Calculate this sum.

Let $a_n$ denote an angle from the interval for each $\left( 0, \frac{\pi}{2}\right)$ , the tangent of which is equal to $n$ . Prove that $$\sqrt{1+1^2} \sin(a_1-a_{1000}) + \sqrt{1+2^2} \sin(a_2-a_{1000})+...+\sqrt{1+2000^2} \sin(a_{2000}-a_{1000}) = \sin a_{1000} $$

Let $x_0, x_1, . . . , x_{2014}$ be a sequence of real numbers, which for all $i < j$ satisfy $x_i + x_j \le 2j$. Determine the largest possible value of the sum $x_0 + x_1 + · · · + x_{2014}$.

A tourist office was investigating the numbers of sunny and rainy days in a year in each of six regions. The results are partly shown in the following table: Region , sunny or rainy , unclassified $A \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 336 \,\,\,\,\,\,\,\,\,\,\,\,\,\, \,\,\,\,\,\,\,29$ $B \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 321 \,\,\,\,\,\,\,\,\,\,\,\,\,\, \,\,\,\,\,\,\,44$ $C \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 335 \,\,\,\,\,\,\,\,\,\,\,\,\,\, \,\,\,\,\,\,\,30$ $D \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 343 \,\,\,\,\,\,\,\,\,\,\,\,\,\, \,\,\,\,\,\,\,22$ $E \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 329 \,\,\,\,\,\,\,\,\,\,\,\,\,\, \,\,\,\,\,\,\,36$ $F \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\, 330 \,\,\,\,\,\,\,\,\,\,\,\,\,\, \,\,\,\,\,\,\,35$ Looking at the detailed data, an officer observed that if one region is excluded, then the total number of rainy days in the other regions equals one third of the total number of sunny days in these regions. Determine which region is excluded.

Any natural number $n, n\ge 3$ can be presented in different ways as a sum several summands (not necessarily different). Find the greatest possible value of these summands. Folklore

Given $a_1, a_2, ... , a_n$. Define $$b_k = \frac{a_1 + a_2 + ... + a_k}{k}$$ for $1 \le k\le n.$ Let $$C = (a_1 - b_1)^2 + (a_2 - b_2)^2 + ... + (a_n - b_n)^2, D = (a_1 - b_n)^2 + (a_2 - b_n)^2 + ... + (a_n - b_n)^2$$ Prove that $C \le D \le 2C$.

Two disjoint subsets of the set $\{1,2, ... ,m\}$ have the same sums of elements. Prove that each of the subsets $A,B$ has less than $m / \sqrt2$ elements.