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)

Prove that the rectangle $m\times n$ table can be filled with exact squares so, that the sums in the rows and the sums in the columns will be exact squares also.

For a positive integer $n,$ let $a_n$ be the integer closest to $\sqrt{n}.$ Compute $$ \frac{1}{a_1 } + \frac{1}{a_2 }+ \cdots + \frac{1}{a_{2004}}.$$

Let $a, b, c, d$ be reals such that $\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}= 7$ and $\frac{a}{c}+\frac{b}{d}+\frac{c}{a}+\frac{d}{b}= 12$. Find the value of $w =\frac{a}{b}+\frac{c}{d}$ .

$a, b, c, d$ are integers with $ad \ne bc$. Show that $1/((ax+b)(cx+d))$ can be written in the form $ r/(ax+b) + s/(cx+d)$. Find the sum $1/1\cdot 4 + 1/4\cdot 7 + 1/7\cdot 10 + ... + 1/2998 \cdot 3001$.

Six distinct positive integers $a,b,c.d,e, f$ are given. Jack and Jill calculated the sums of each pair of these numbers. Jack claims that he has $10$ prime numbers while Jill claims that she has $9$ prime numbers among the sums. Who has the correct claim?

Let $n_1,n_2,n_3,...,n_{2000}$ be $2000$ positive integers satisfying $n_1<n_2<n_3<...<n_{2000}$. Prove that $$\frac{n_1}{[n_1,n_2]}+\frac{n_1}{[n_2,n_3]}+\frac{n_1}{[n_3,n_4]}+...+\frac{n_1}{[n_{1999},n_{2000}]} \le 1 - \frac{1}{2^{1999}}$$ where $[a, b]$ denotes the least common multiple of $a$ and $b$.

On a circle, there are $1000$ nonzero real numbers painted black and white in turn. Each black number is equal to the sum of two white numbers adjacent to it, and each white number is equal to the product of two black numbers adjacent to it. What are the possible values of the total sum of $1000$ numbers?

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.

Fill in the corners of the square, so that the sum of the numbers in each one of the $5$ lines of the square is the same and the sum of the four corners is $123$.

Prove that if the real numbers $ a $ and $ b $ are not both equal to zero, then for every natural $ n $ $$ a^{2n} + a^{2n-1}b + a^{2n-2} b^2 + \ldots + ab^{2n-1} + b^{2n} > 0. $$

Integers $x_0,x_1,...,x_{n-1}, x_n = x_0, x_{n+1} = x_1$ satisfy the inequality $(-1)^{x_k} x_{k-1}x_{k+1} >0$ for $k = 1,2,...,n$. Prove that the difference $\sum_{k=0}^{n-1}x_k -\sum_{k=0}^{n-1}|x_k|$ is divisible by $4$.

A $5$-tuple $(1,1,1,1,2)$ has the property that the sum of any three of them is divisible by the sum of the remaining two. Is there a $5$-tuple with this property whose all terms are distinct?

Suppose $x_1, x_2, x_3$ are the roots of polynomial $P(x) = x^3 - 4x^2 -3x + 2$. The sum $|x_1| + |x_2| + |x_3|$ is (A): $4$ (B): $6$ (C): $8$ (D): $10$ (E): None of the above.

The numbers $1$ to $n^2$ are written in an n×n squared paper in the usual ordering. Any sequence of right and downwards steps from a square to an adjacent one (by side) starting at square $1$ and ending at square $n^2$ is called a path. Denote by $L(C)$ the sum of the numbers through which path $C$ goes. (a) For a fixed $n$, let $M$ and $m$ be the largest and smallest $L(C)$ possible. Prove that $M-m$ is a perfect cube. (b) Prove that for no $n$ can one find a path $C$ with $L(C ) = 1996$.

In the arrangement of $pn$ real numbers below, the difference between the greatest and smallest numbers in each row is at most $d$, $d > 0$. \[ \begin{array}{l} a_{11} \,\, a_{12} \,\, ... \,\, a_{1n}\\ a_{21} \,\, a_{22} \,\, ... \,\, a_{2n}\\ \,\, . \,\, \,\, \,\, \,\, . \,\, \,\, \,\, \,\, \,\, \,\, \,\, \,\, .\\ \,\, . \,\, \,\, \,\, \,\, . \,\, \,\, \,\, \,\, \,\, \,\, \,\, \,\, .\\ \,\, . \,\, \,\, \,\, \,\, . \,\, \,\, \,\, \,\, \,\, \,\, \,\, \,\, .\\ a_{n1} \,\, a_{n2} \,\, ... \,\, a_{nn}\\ \end{array} \] Prove that, when the numbers in each column are rearranged in decreasing order, the difference between the greatest and smallest numbers in each row will still be at most d.

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$

In a row are written $1999$ numbers such that except the first and the last , each is equal to the sum of its neighbours. If the first number is $1$, find the last number. (V Senderov)

Fix $a_1, . . . , a_n \in (0, 1)$ and define $$f(I) = \prod_{i \in I} a_i \cdot \prod_{j \notin I} (1 - a_j)$$ for each $I \subseteq \{1, . . . , n\}$. Assuming that $$\sum_{I\subseteq \{1,...,n\}, |I| odd} {f(I)} = \frac12,$$ show that at least one $a_i$ has to be equal to $\frac12$. (Paolo Leonetti)

The board was placed $$ \begin{array}{rcl}<br /> 1 & = & 1 \\<br /> 2 + 3 + 4 & = & 1 + 8 \\<br /> 5 + 6 + 7 + 8 + 9 & = & 8 + 27\\<br /> 10 + 11 + 12 + 13 + 14 + 15 + 16 & = & 27 + 64\\<br /> & \ldots &<br /> \end{array}$$ Write such a formula for the $ n $-th row of the array that, with the substitutions $ n = 1, 2, 3, 4 $, would give the above four lines of the array and would be true for every natural $ n $.

Suppose that $p> 2$ is a prime number. For each integer $k = 1, 2,..., p-1$, denote $r_k$ as the remainder of the division $k^p$ by $p^2$. Prove that $r_1+r_2+r_3+...+r_{p-1}=\frac{p^2(p-1)}{2}$

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

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.

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

For any positive integer $n$, let $r_n$ denote the greatest odd divisor of $n$. Compute $T =r_{100}+ r_{101} + r_{102}+...+r_{200}$