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.

Let $S$ be the set of integers that can be written in the form $50m + 3n$ where $m$ and $n$ are non-negative integers. For example $3, 50, 53$ are all in $S$. Find the sum of all positive integers not in $S$.

If $$s_n = 1 + q + q^2 +... + q^n$$ and $$ S_n = 1 +\frac{1 + q}{2}+ \left( \frac{1 + q}{2}\right)^2 +... + \left( \frac{1 + q}{2}\right)^n,$$ prove that $${n + 1 \choose 1}+{n + 1 \choose 2} s_1 + {n + 1 \choose 3} s_2 + ... + {n + 1 \choose n + 1} s_n = 2^nS_n$$

A sequence ($a_n$) is given by $a_0 = 0, a_1 = 1$ and $a_{k+2} = a_{k+1} +a_k$ for all integers $k \ge 0$. Prove that the inequality $\sum_{k=0}^n \frac{a_k}{2^k}< 2$ holds for all positive integers $n$.

Let $ABCD$ be a tetrahedron that is not degenerate and not necessarily regular, where sides $AD$ and $BC$ have the same length $a$, sides $BD$ and $AC$ have the same length $b$, side $AB$ has length $c_1$ and the side $CD$ has length $c_2$. There is a point $P$ for which the sum of the distances to the vertices of the tetrahedron is minimal. Determine this sum depending on the quantities $a, b, c_1$ and $c_2$.

We build a modified version of Pascal’s triangle as follows: in the first row we write a $2$ and a $3$, and in the further rows, every number is the sum of the two numbers directly above it (and rows always begin with a $2$ and end with a $3$). In the $13$th row, what is the $5$th number from the left? [img]https://cdn.artofproblemsolving.com/attachments/7/2/58e1a9f43fa7c304bfd285fc1b73bed883e9a6.png[/img]

Let $a_i$, $i=1,2,...,n$ be non-negative real numbers and $\sum_{i=1}^na_i =1$. Find $\max S=\sum_{i\mid j}a_i a_j $.

Two triangular pyramids have common base. One pyramid contains the other. Can the sum of the lengths of the edges of the inner pyramid be longer than that of the outer one?

Determine all even positive integers that can be written as the sum of odd composite positive integers.

a) The numbers $1, 2, . . . , 49$ are arranged in a square table as follows: [img]https://cdn.artofproblemsolving.com/attachments/5/0/c2e350a6ad0ebb8c728affe0ebb70783baf913.png[/img] Among these numbers we select an arbitrary number and delete from the table the row and the column which contain this number. We do the same with the remaining table of $36$ numbers, etc., $7$ times. Find the sum of the numbers selected. b) The numbers $1, 2, . . . , k^2$ are arranged in a square table as follows: [img]https://cdn.artofproblemsolving.com/attachments/2/d/28d60518952c3acddc303e427483211c42cd4a.png[/img] Among these numbers we select an arbitrary number and delete from the table the row and the column which contain this number. We do the same with the remaining table of $(k - 1)^2$ numbers, etc., $k$ times. Find the sum of the numbers selected.

Consider a sequence of positive integers with total sum $2019$ such that no number and no sum of a set of consecutive num bers is equal to $40$. What is the greatest possible length of such a sequence? (Alexandr Shapovalov)

Let $m, n$ be positive integers. Consider a sequence of positive integers $a_1, a_2, ... , a_n$ that satisfies $m = a_1 \ge a_2\ge ... \ge a_n \ge 1$. Then define, for $1\le  i\le  m$, $b_i =$ # $\{ j \in \{1, 2, ... , n\}: a_j \ge i\}$, so $b_i$ is the number of terms $a_j $ of the given sequence for which $a_j  \ge i$. Similarly, we define, for $1\le   j \le  n$, $c_j=$ # $\{ i \in \{1, 2, ... , m\}: b_i \ge j\}$ , thus $c_j$ is the number of terms bi in the given sequence for which $b_i \ge j$. E.g.: If $a$ is the sequence $5, 3, 3, 2, 1, 1$ then $b$ is the sequence $6, 4, 3, 1, 1$. (a) Prove that $a_j = c_j $ for $1  \le j  \le n$. (b) Prove that for $1\le  k \le m$: $\sum_{i=1}^{k} b_i = k \cdot b_k + \sum_{j=b_{k+1}}^{n} a_j$.

Each of the numbers $1$ up to and including $2014$ has to be coloured; half of them have to be coloured red the other half blue. Then you consider the number $k$ of positive integers that are expressible as the sum of a red and a blue number. Determine the maximum value of $k$ that can be obtained.

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

Does there exist a four-digit positive integer with different non-zero digits, which has the following property: if we add the same number written in the reverse order, then we get a number divisible by $101$?

Calculate the sum: $1+ 2q + 3q^2 +...+nq^{n-1}$

Find the number of ways to write the number $2013$ as the sum of two integers greater than or equal to zero so that when adding there is no carry over. Clarification: In the sum $2008+5=2013$ there is carry over from the units to the tens

a) Let $ x_1, x_2, ..., x_n $ ($ n> 2 $) be negative real numbers and $ x_1 + x_2 + ... + x_n = m. $ Determine the maximum value of the sum $ S = x_1x_2 + x_1x_3 + \dots + x_1x_n + x_2x_3 + x_2x_4 + \dots + x_2x_n + \dots + x_ {n-1} x_n. $ b) Let $ x_1, x_2, ..., x_n $ ($ n> 2 $) be nonnegative natural numbers and $ x_1 + x_2 + ... + x_n = m. $ Determine the maximum value of the sum $ S = x_1x_2 + x_1x_3 + \dots + x_1x_n + x_2x_3 + x_2x_4 + \dots + x_2x_n + \dots + x_ {n-1} x_n. $

Each of the thirty squares in the diagram below contains a number $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$ of which each number is used exactly three times. The sum of three numbers in three squares on each of the thirteen line segments is equal to $S$. [img]https://cdn.artofproblemsolving.com/attachments/8/0/3e056ebc252aee9ade1f45fd337cc6a2f84302.png[/img]

Prove that for all natural numbers $n$ greater than $1$ : $$[\sqrt{n}] + [\sqrt[3]{n}] +...+[ \sqrt[n]{n}] = [\log_2 n] + [\log_3 n] + ... + [\log_n n]$$ (VV Kisil)

$64$ non-negative numbers whose sum equals $1956$ are arranged in a square table, eight numbers in each row and each column. The sum of the numbers on the two longest diagonals is equal to $112$. The numbers situated symmetrically with respect to any of the longest diagonals are equal. (a) Prove that the sum of numbers in any column is less than $1035$. (b) Prove that the sum of numbers in any row is less than $518$.

The product of three positive numbers is $1$ and their sum is greater than the sum of their inverses. Prove that one of these numbers is greater than $1$, while the other two are smaller than $1$.

Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when: a) $n=2014$ b) $n=2015 $ c) $n=2018$

Calculate $$\sum_{k=5}^{k=49}\frac{11_(k}{2\sqrt[3]{1331_(k}}$$ knowing that the numbers $11$ and $1331$ are written in base $k \ge 4$.

Find the number of all real functions $f$ which map the sum of $n$ elements into the sum of their images, such that $f^{n-1}$ is a constant function and $f^{n-2}$ is not. Here $f^0(x) = x$ and $f^k = f \circ f^{k-1}$ for $k \ge 1$.