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)

For a positive integer $n$, let $S(n), P(n)$ denote the sum and the product of all the digits of $n$ respectively. 1) Find all values of n such that $n = P(n)$: 2) Determine all values of n such that $n = S(n) + P(n)$.

Write the number $1000$ as the sum of at least two consecutive positive integers. How many (different) ways are there to write it?

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.

Find all polynomials $P(x)$ with real coefficients having the following property: There exists a positive integer n such that the equality $$\sum_{k=1}^{2n+1}(-1)^k \left[\frac{k}{2}\right] P(x + k)=0$$ holds for infinitely many real numbers $x$.

For every nonempty subset $R$ of $S = \{1,2,...,10\}$, we define the alternating sum $A(R)$ as follows: If $r_1,r_2,...,r_k$ are the elements of $R$ in the increasing order, then $A(R) = r_k -r_{k-1} +r_{k-2}- ... +(-1)^{k-1}r_1$. (a) Is it possible to partition $S$ into two sets having the same alternating sum? (b) Determine the sum $\sum_{R} A(R)$, where $R$ runs over all nonempty subsets of $S$.

Let non-integer real numbers $a, b,c,d$ are given, such that the sum of each $3$ of them is integer. May it happen that $ab + cd$ is an integer.

Write $102$ as the sum of the largest number of distinct primes.

Let $n$ be a natural number and let $P (t) = 1 + t + t^2 + ... + t^{2n}$. If $x \in R$ such that $P (x)$ and $P (x^2)$ are rational numbers, prove that $x$ is rational number.

The numbers from $1$ to $64$ are written on the squares of a chessboard (from $1$ to $8$ from left to right on the first row , from $9$ to $16$ from left to right on the second row , and so on). Pluses are written before some of the numbers, and minuses are written before the remaining numbers in such a way that there are $4$ pluses and $4$ minuses in each row and in each column . Prove that the sum of the written numbers is equal to zero.

Consider the cube with the vertices at the points $(\pm 1, \pm 1, \pm 1)$. Let $V_1,...,V_{95}$ be arbitrary points within this cube. Denote $v_i = \overrightarrow{OV_i}$, where $O = (0,0,0)$ is the origin. Consider the $2^{95}$ vectors of the form $s_1v_1 + s_2v_2 +...+ s_{95}v_{95}$, where $s_i = \pm 1$. (a) If $d = 48$, prove that among these vectors there is a vector $w = (a, b, c)$ such that $a^2 + b^2 + c^2 \le 48$. (b) Find a smaller $d$ (the smaller, the better) with the same property.

The Fibonacci sequence is the list of numbers that begins $1, 2, 3, 5, 8, 13$ and continues with each subsequent number being the sum of the previous two. Prove that for every positive integer $n$ when the first $n$ elements of the Fibonacci sequence are alternately added and subtracted, the result is an element of the sequence or the negative of an element of the sequence. For example, when $n = 4$ we have $1-2+3-5 = -3$ and $3$ is an element of the Fibonacci sequence.

Let the sum $\sum_{n=1}^{9} \frac{1}{n(n+1)(n+2)}$ written in its lowest terms be $\frac{p}{q}$ . Find the value of $q - p$.

Carol was given three numbers and was asked to add the largest of the three to the product of the other two. Instead, she multiplied the largest with the sum of the other two, but still got the right answer. What is the sum of the three numbers?

Find positive real numbers $x,y,z$ that are solutions of the system $x+y+z=xy+yz+zx$ and $xyz=1$ , and have the smallest possible sum.

In a convex quadrilateral of area $1$, the sum of the lengths of all sides and diagonals is not less than $4+\sqrt 8$. Prove this.

Let $S(n)$ denote the sum of digits of $n \in N$. Find all $n$ such that $S(n) = S(2n) = S(3n) =... = S(n^2)$

Each of the $8$ vertices of a given cube is given a value $1$ or $-1$. Each of the $6$ faces is given the value of product of its four vertices. Let $A$ be the sum of all the $14$ values. Which are the possible values of $A$?

For certain $a,b,c$ holds: $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}=\frac{1}{a+b+c}$ Prove that for all odd $n$ holds, $$\frac{1}{a^n}+\frac{1}{b^n}+\frac{1}{c^n}=\frac{1}{a^n+b^n+c^n}.$$

Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ . What is the greatest possible value of $a_16$?

For any nonempty set $S$, we define $\sigma(S)$ and $\pi(S)$ as sum and product of all elements from set $S$, respectively. Prove that $a)$ $\sum \limits_{} \frac{1}{\pi(S)} =n$ $b)$ $\sum \limits_{} \frac{\sigma(S)}{\pi(S)} =(n^2+2n)-\left(1+\frac{1}{2}+\frac{1}{3}+...+\frac{1}{n}\right)(n+1)$ where $\sum$ denotes sum by all nonempty subsets $S$ of set $\{1,2,...,n\}$

Is it true that every positive integer greater than $50$ is a sum of $4$ positive integers such that each two of them have a common divisor greater than $1$?

For an integer $ n \geq 2 $, let $ s (n) $ be the sum of positive integers not exceeding $ n $ and not relatively prime to $ n $. a) Prove that $ s (n) = \dfrac {n} {2} \left (n + 1- \varphi (n) \right) $, where $ \varphi (n) $ is the number of integers positive cannot exceed $ n $ and are relatively prime to $ n $. b) Prove that there is no integer $ n \geq 2 $ such that $ s (n) = s (n + 2021) $

Let $x_1,x_2,...,x_n$ be real numbers in an interval $[m,M]$ such that $\sum_{i=1}^n x_i = 0$. Show that $\sum_{i=1}^n x_i ^2 \le -nmM$

In a row there are $51$ written positive integers. Their sum is $100$ . An integer is [i]representable [/i] if it can be expressed as the sum of several consecutive numbers in a row of $51$ integers. Show that for every $k$ , with $1\le k \le 100$ , one of the numbers $k$ and $100-k$ is representable.