The points $A_1, A_2,.. , A_{2n}$ are equally spaced in that order along a straight line with $A_1A_2 = k$. $P$ is chosen to minimise $\sum PA_i$. Find the minimum.

Every positive integer $n>2$ can be written as a sum of distinct positive integers. Let $A(n)$ be the maximal number of summands in such a representation. Find a formula for $A(n).$

Let $n$ be an integer. We consider $s (n)$, the sum of the $2001$ powers of $n$ with the exponents $0$ to $2000$. So $s (n) = \sum_{k=0}^{2000}n ^k$ . What is the unit digit of $s (n)$ in the decimal system?

Determine all positive integers $n$ with at least $4$ factors such that $n$ is the sum the squares of its $4$ smallest factors.

Call a positive integer $N \ge 2$ [i]special [/i] if for every k such that $2 \le k \le N, N$ can be expressed as a sum of $k$ positive integers that are relatively prime to $N$ (although not necessarily relatively prime to each other). Find all special positive integers.

Is it possible to paint all natural numbers in $6$ colors, for each one color to be used and the sum of any five numbers of different color to be painted in the sixth color?

Prove that for any given number $a_k, 1 \le k \le 5$, there are $\lambda_k \in \{-1, 0, 1\}, 1 \le k \le 5$, which are not all equal zero, such that $11 | \lambda_1a_1^2+\lambda_2a_2^2+\lambda_3a_3^2+\lambda_4a_4^2+\lambda_5a_5^2$

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

Do there exist two reals whose sum is rational, but the sum of their $n$ th powers is irrational for all $n > 1$? Do there exist two reals whose sum is irrational, but the sum of whose $n$ th powers is rational for all $n > 1$?

A domino has two numbers (which may be equal) between $0$ and $6$, one at each end. The domino may be turned around. There is one domino of each type, so $28$ in all. We want to form a chain in the usual way, so that adjacent dominos have the same number at the adjacent ends. Dominos can be added to the chain at either end. We want to form the chain so that after each domino has been added the total of all the numbers is odd. For example, we could place first the domino $(3,4)$, total $3 + 4 = 7$. Then $(1,3)$, total $1 + 3 + 3 + 4 = 11$, then $(4,4)$, total $11 + 4 + 4 = 19$. What is the largest number of dominos that can be placed in this way? How many maximum-length chains are there?

Is it possible to partition the set $A = \{1, 2, 3, ... , 32, 33\}$ into eleven subsets that contain three integers each, such that for every one of these eleven subsets, one of the integers is equal to the sum of the other two? If so, give such a partition, if not, prove that such a partition cannot exist.

Let there be a $n\times n$ board. Write down $0$ or $1$ in all $n^2$ squares. For $1 \le k \le n$, let $A_k$ be the product of all numbers in the $k$th row. How many ways are there to write down the numbers so that $A_1 + A_2 + ... + A_n$ is even?

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$

Assume $a_1,a_2,...,a_{14}$ are positive integers such that $\sum_{i=1}^{14}3^{a_i} = 6558$. Prove that the numbers $a_1,a_2,...,a_{14}$ consist of the numbers $1,...,7$, each taken twice.

On a circle, numbers from $1$ to $100$ are arranged in some order. We call a pair of numbers [i]good [/i] if these two numbers do not stand side by side, and at least on one of the two arcs into which they break a circle, all the numbers are less than each of them. What can be the total number of [i]good [/i] pairs?

Let $a, b$ be positive real numbers satisfying $a + b = 1$. Show that if $x_1,x_2,...,x_5$ are positive real numbers such that $x_1x_2...x_5 = 1$, then $(ax_1+b)(ax_2+b)...(ax_5+b)>1$

Prove that for a natural number $ n > 2 $ the number $ n! $ is the sum of its $ n $ various divisors.

Let $n$ be a positive integer. Consider sequences $a_0, a_1, ..., a_k$ and $b_0, b_1,,..,b_k$ such that $a_0 = b_0 = 1$ and $a_k = b_k = n$ and such that for all $i$ such that $1 \le i \le k $, we have that $(a_i, b_i)$ is either equal to $(1 + a_{i-1}, b_{i-1})$ or $(a_{i-1}; 1 + b_{i-1})$. Consider for $1 \le i \le k$ the number $c_i = \begin{cases} a_i \,\,\, if \,\,\, a_i = a_{i-1} \\ b_i \,\,\, if \,\,\, b_i = b_{i-1}\end{cases}$ Show that $c_1 + c_2 + ... + c_k = n^2 - 1$.

If $d_1,d_2,...,d_k$ are all distinct positive divisors of $n$, we define $f_s(n) = d_1^s+d_2^s+..+d_k^s$. For example, we have $f_1(3) = 1 + 3 = 4, f_2(4) = 1 + 2^2 + 4^2 = 21$. Prove that for all positive integers $n$, $n^3f_1(n) - 2nf_9(n) + n^2f_3(n)$ is divisible by $8$.

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.

For any positive integer n, evaluate $$\sum_{i=0}^{\lfloor \frac{n+1}{2} \rfloor} {n-i+1 \choose i}$$ , where $\lfloor n \rfloor$ is the greatest integer less than or equal to $n$ .

Find all pairs of integers $(x, y)$ such that ths sum of the fractions $\frac{19}{x}$ and $\frac{96}{y}$ would be equal to their product.

Let $f(x) = \frac{4^x}{4^x+2}$ for $x > 0$. Evaluate $\sum_{k=1}^{1920}f\left(\frac{k}{1921}\right)$

Integers $1, 2,...,100$ are written on a circle, not necessarily in that order. Can it be that the absolute value of the dierence between any two adjacent integers is at least $30$ and at most $50$?

Find all points on the plane such that the sum of the distances of each of the four lines defined by the unit square of that plane is $4$.