Let there be $2n$ positive reals $a_1,a_2,...,a_{2n}$. Let $s = a_1 + a_3 +...+ a_{2n-1}$, $t = a_2 + a_4 + ... + a_{2n}$, and $x_k = a_k + a_{k+1} + ... + a_{k+n-1}$ (indices are taken modulo $2n$). Prove that $$\frac{s}{x_1}+\frac{t}{x_2}+\frac{s}{x_3}+\frac{t}{x_4}+...+\frac{s}{x_{2n-1}}+\frac{t}{x_{2n}}>\frac{2n^2}{n+1}$$

Determine the smallest number $n \in Z_+$, which can be written as $n = \Sigma_{a\in A}a^2$, where $A$ is a finite set of positive integers and $\Sigma_{a\in A}a= 2014$. In other words: what is the smallest positive number which can be written as a sum of squares of different positive integers summing to $2014$?

We will call the sequence of positive real numbers. $a_1,a_2,\dots ,a_n$ of [i]length [/i] $n$ when $$a_1\geq \frac{a_1+a_2}{2}\geq \dots \geq \frac{a_1+a_2+\cdots +a_n}{n}.$$ Let $x_1,x_2,\dots ,x_n$ and $y_1,y_2,\dots ,y_n$ be sequences of length $n.$ Prove that $$\sum_{i = 1}^{n}x_iy_i\geq\frac{1}{n}\left(\sum_{i = 1}^{n}x_i\right)\left(\sum_{i = 1}^{n}y_i\right).$$ [i](tatari/nightmare)[/i]

Give are the integers $a_{1}=11 , a_{2}=1111, a_{3}=111111, ... , a_{n}= 1111...111$( with $2n$ digits) with $n > 8$ . Let $q_{i}= \frac{a_{i}}{11} , i= 1,2,3, ... , n$ the remainder of the division of $a_{i}$ by$ 11$ . Prove that the sum of nine consecutive quotients: $s_{i}=q_{i}+q_{i+1}+q_{i+2}+ ... +q_{i+8}$ is a multiple of $9$ for any $i= 1,2,3, ... , (n-8)$

Given any set of $14$ (different) natural numbers, prove that for some $k$ ($1 \le k \le 7$) there exist two disjoint $k$-element subsets $\{a_1,...,a_k\}$ and $\{b_1,...,b_k\}$ such that $A =\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}$ and $B =\frac{1}{b_1}+\frac{1}{b_2}+...+\frac{1}{b_k}$ differ by less than $0.001$, i.e. $|A-B| < 0.001$

$268$ numbers are written around a circle. The $17$th number is $3$, the $83$rd is $4$ and the $144$th is $9$. The sum of every $20$ consecutive numbers is $72$. Find the $210$th number.

Find all the positive integers $n$ with the property: there exists an integer $k > 2$ and the positive rational numbers $a_1, a_2, ..., a_k$ such that $a_1 + a_2 + .. + a_k = a_1a_2 . . . a_k = n$.

If $m$ is a positive integer, prove that $2^m$ cannot be written as a sum of two or more consecutive natural numbers.

Calculate the sum: $nx+(n-1)x^2+...+2x^{n-1}+x^n$

A line segment $B_0B_n$ is divided into $n$ equal parts at points $B_1,B_2,...,B_{n-1} $ and $A$ is a point such that $\angle B_0AB_n$ is a right angle. Prove that : $$\sum_{k=0}^{n} |AB_k|^{2} = \sum_{k=0}^{n} |B_0B_k|^2$$

What is the remainder when $\sum_{k=1}^{2005}k^{2005\cdot 2^{2005}}$ is divided by $2^{2005}$?

Positive numbers $x_1,..., x_k$ satisfy the following inequalities: $$x_1^2+...+ x_k^2 <\frac{x_1+...+x_k}{2} \ \ and \ \ x_1+...+x_k < \frac{x_1^3+...+ x_k^3}{2}$$ a) Show that $k > 50$, (3) b) Give an example of such numbers for some value of $k$ (3) c) Find minimum $k$, for which such an example exists. (3)

Ahmad and Salem play the following game. Ahmad writes two integers (not necessarily different) on a board. Salem writes their sum and product. Ahmad does the same thing: he writes the sum and product of the two numbers which Salem has just written. They continue in this manner, not stopping unless the two players write the same two numbers one after the other (for then they are stuck!). The order of the two numbers which each player writes is not important. Thus if Ahmad starts by writing $3$ and $-2$, the first five moves (or steps) are as shown: (a) Step 1 (Ahmad) $3$ and $-2$ (b) Step 2 (Salem) $1$ and $-6$ (c) Step 3 (Ahmad) $-5$ and $-6$ (d) Step 4 (Salem) $-11$ and $30$ (e) Step 5 (Ahmad) $19$ and $-330$ (i) Describe all pairs of numbers that Ahmad could write, and ensure that Salem must write the same numbers, and so the game stops at step 2. (ii) What pair of integers should Ahmad write so that the game finishes at step 4? (iii) Describe all pairs of integers which Ahmad could write at step 1, so that the game will finish after finitely many steps. (iv) Ahmad and Salem decide to change the game. The first player writes three numbers on the board, $u, v$ and $w$. The second player then writes the three numbers $u + v + w,uv + vw + wu$ and $uvw$, and they proceed as before, taking turns, and using this new rule describing how to work out the next three numbers. If Ahmad goes first, determine all collections of three numbers which he can write down, ensuring that Salem has to write the same three numbers at the next step.

Ten distinct numbers are chosen at random from the set $\{1, 2, 3, ... , 37\}$. Show that one can select four distinct numbers out of those ten so that the sum of two of them is equal to the sum of the other two.

Let $a,b,c$ and $d$ be non-negative real numbers such that $a+b+c+d = 4$. Show that $\sqrt{a+b+c}+\sqrt{b+c+d}+\sqrt{c+d+a}+\sqrt{d+a+b}\ge 6$.

Call the [i]improvement [/i] of a positive number its replacement by a power of two. (i.e. one of the numbers $1, 2, 4, 8, ...$), for which it increases, but not more than than $3$ times. Given $2^{100}$ positive numbers with a sum of $2^{100}$. Prove that you can erase some of them, and [i]improve [/i] each of the other numbers so that the sum the resulting numbers were again $2^{100}$.

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$

A positive integer $n$ is called [i]good [/i] if they sum up in one and only one way at least of two positive integers whose product also has the value $n$. Here representations that differ only in the order of the summands are considered the same viewed. Find all good positive integers.

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)

Prove that for every integer $k$, there exists a integer $n$ which can be expressed in at least $k$ different ways as the sum of a number of squares of integers (regardless of the order of additions) where the additions are all in different pairs.

Given two points inside a convex dodecagon (twelve sides) situated $10$ cm far from each other. Prove that the difference between the sum of distances, from the point to all the vertices, is less than $1$ m for those points.

Let $n$ be a positive integer. Let $G (n)$ be the number of $x_1,..., x_n, y_1,...,y_n \in \{0,1\}$, for which the number $x_1y_1 + x_2y_2 +...+ x_ny_n$ is even, and similarly let $U (n)$ be the number for which this sum is odd. Prove that $$\frac{G(n)}{U(n)}= \frac{2^n + 1}{2^n - 1}.$$

Find the number of sequences of $2005$ terms with the following properties: (i) No three consecutive terms of the sequence are equal, (ii) Every term equals either $1$ or $-1$, (iii) The sum of all terms of the sequence is at least $666$.

We call a positive integer [i] good[/i] if the sum of the reciprocals of all its natural divisors are integers. Prove that if $ m $ is a [i]good [/i] number, and $ p> m $ is a prime number, then $ pm $ is not [i]good[/i].

$n$ natural numbers ($n>3$) are written on the circumference. The relation of the two neighbours sum to the number itself is a whole number. Prove that the sum of those relations is a) not less than $2n$ b) less than $3n$