Given an integer $n \ge 2$, evaluate $\Sigma \frac{1}{pq}$ ,where the summation is over all coprime integers $p$ and $q$ such that $1 \le p < q \le n$ and $p + q > n$.

Find positive reals $a, b, c$ which maximizes the value of $a+ 2b+ 3c$ subject to the constraint that $9a^2 + 4b^2 + c^2 = 91$

Given a positive integer $m$, a sequence of real numbers $a= (a_1,a_2,a_3,...)$ is called $m$-powerful if it satisfies $$(\sum_{k=1}^{n} a_k )^{m} = \sum_{k=1}^{n} a_k^{m}$$for all positive integers $n$. (a) Show that a sequence is $30$-powerful if and only if at most one of its terms is non-zero. (b) Find a sequence none of whose terms are zero but which is $2017$-powerful.

One pupil has $7$ cards of paper. He takes a few of them and tears each in $7$ pieces. Then, he choses a few of the pieces of paper that he has and tears it again in $7$ pieces. He continues the same procedure many times with the pieces he has every time. Will he be able to have sometime $2009$ pieces of paper?

The product of $10$ natural numbers is equal to $10^{10}$. What is the largest possible sum of these numbers?

The numbers $d_1, d_2,..., d_6$ are distinct digits of the decimal number system other than $6$. Prove that $d_1+d_2+...+d_6= 36$ if and only if $(d_1-6) (d_2-6) ... (d_6 -6) = -36$.

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?

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}.$$

We consider the real numbers $a _ 1, a _ 2, a _ 3, a _ 4, a _ 5$ with the zero sum and the property that $| a _ i - a _ j | \le 1$ , whatever it may be $i,j \in \{1, 2, 3, 4, 5 \} $. Show that $a _ 1 ^ 2 + a _ 2 ^ 2 + a _ 3 ^ 2 + a _ 4 ^ 2 + a _ 5 ^ 2 \le \frac {6} {5}$ .

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.

Let $p$ be a prime number. A set of $p + 2$ positive integers, not necessarily distinct, is called [i]interesting [/i] if the sum of any $p$ of them is divisible by each of the other two. Determine all interesting sets.

a) Prove that if the sum of the non-zero digits $a_1, a_2, ... , a_n$ is a multiple of $27$, then it is possible to permute these digits in order to obtain an $n$-digit number that is a multiple of $27$. b) Prove that if the non-zero digits $a_1, a_2, ... , a_n$ have the property that every ndigit number obtained by permuting these digits is a multiple of $27$, then the sum of these digits is a multiple of $27$

Prove that if the product of $n$ real and positive numbers is equal to $1$, its sum is greater than or equal to $n$.

An $n \times m$ table ( $n \le m$ ) is filled in accordance with the rules of the game "Minesweeper": mines are placed at some cells (not more than one mine at the cell) and in the remaining cells one writes the number of the mines in the neighboring (by side or by vertex) cells. Then the sum of allnumbers in the table is computed (this sum is equal to $9$ for the picture). What is the largest possible value of this sum? (V. Lebed) [img]https://cdn.artofproblemsolving.com/attachments/2/9/726ccdbc57807788a5f6e88a5acb42b10a6cc0.png[/img]

For every four-digit number, we take the product of its four digits. Then we add all of these products together . What is the result? ( G Galperin)

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]

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$?

Let $a$ and $b$ be two real numbers and let $n$ be a nonnegative integer. Then prove that $$\sum_{k=0}^{n} {n \choose k} (a + k)^k (b - k)^{n-k} = \sum_{k=0}^{n} \frac{n!}{t!} (a + b)^t $$

Let $n$ be a nonnegative integer and $M =\{n^3, n^3+1, n^3+2, ..., n^3+n\}$. Consider $A$ and $B$ two nonempty, disjoint subsets of $M$ such that the sum of elements of the set $A$ divides the sum of elements of the set $B$. Prove that the number of elements of the set $A$ divides the number of elements of the set $B$.