Found problems: 594
2020 Malaysia IMONST 1, 1
Find the value of \[+1+2+3-4-5-6+7+8+9-10-11-12+\cdots -2020,\] where the sign alternates between $+$ and $-$ after every three numbers.
2009 Singapore Junior Math Olympiad, 5
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$
2001 Switzerland Team Selection Test, 4
For a natural number $n \ge 2$, consider all representations of $n$ as a sum of its distinct divisors, $n = t_1 + t_2 + ... + t_k, t_i| n$. Two such representations differing only in order of the summands are considered the same (for example, $20 = 10+5+4+1$ and $20 = 5+1+10+4$). Let $a(n)$ be the number of different representations of $n$ in this form. Prove or disprove: There exists M such that $a(n) \le M$ for all $n \ge 2$.
1998 Tuymaada Olympiad, 1
Write the number $\frac{1997}{1998}$ as a sum of different numbers, inverse to naturals.
2011 Argentina National Olympiad, 1
For $k=1,2,\ldots ,2011$ we denote $S_k=\frac{1}{k}+\frac{1}{k+1}+\cdots +\frac{1}{2011}$.
Compute the sum $S_1+S_1^2+S_2^2+\cdots +S_{2011}^2$.
1995 Abels Math Contest (Norwegian MO), 3
Show that there exists a sequence $x_1,x_2,...$ of natural numbers in which every natural number occurs exactly once, such that the sums $\sum_{i=1}^n \frac{1}{x_i}$, $n = 1,2,3,...$, include all natural numbers.
VI Soros Olympiad 1999 - 2000 (Russia), 9.8
Let $a_n$ denote an angle from the interval for each $\left( 0, \frac{\pi}{2}\right)$ , the tangent of which is equal to $n$ . Prove that
$$\sqrt{1+1^2} \sin(a_1-a_{1000}) + \sqrt{1+2^2} \sin(a_2-a_{1000})+...+\sqrt{1+2000^2} \sin(a_{2000}-a_{1000}) = \sin a_{1000} $$
1999 Tournament Of Towns, 1
For what values o f $n$ is it possible to place the integers from $1$ to $n$ inclusive on a circle (not necessarily in order) so that the sum of any two successive integers in the circle is divisible by the next one in the clockwise order?
(A Shapovalov)
2017 Irish Math Olympiad, 5
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.
1997 Tuymaada Olympiad, 3
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?
2008 Indonesia TST, 2
Let $\{a_n\}_{n \in N}$ be a sequence of real numbers with $a_1 = 2$ and $a_n =\frac{n^2 + 1}{\sqrt{n^3 - 2n^2 + n}}$ for all positive integers $n \ge 2$.
Let $s_n = a_1 + a_2 + ...+ a_n$ for all positive integers $n$. Prove that $$\frac{1}{s_1s_2}+\frac{1}{s_2s_3}+ ...+\frac{1}{s_ns_{n+1}}<\frac15$$
for all positive integers $n$.
1988 All Soviet Union Mathematical Olympiad, 484
What is the smallest $n$ for which there is a solution to $$\begin{cases} \sin x_1 + \sin x_2 + ... + \sin x_n = 0 \\ \sin x_1 + 2 \sin x_2 + ... + n \sin x_n = 100 \end{cases}$$ ?
2007 Bosnia and Herzegovina Junior BMO TST, 1
Write the number $1000$ as the sum of at least two consecutive positive integers. How many (different) ways are there to write it?
VMEO III 2006 Shortlist, N9
Assume the $m$ is a given integer greater than $ 1$. Find the largest number $C$ such that for all $n \in N$ we have
$$\sum_{1\le k \le m ,\,\, (k,m)=1}\frac{1}{k}\ge C \sum_{k=1}^{m}\frac{1}{k}$$
2012 NZMOC Camp Selection Problems, 2
Show the the sum of any three consecutive positive integers is a divisor of the sum of their cubes.
1947 Moscow Mathematical Olympiad, 139
In the numerical triangle
$................1..............$
$...........1 ...1 ...1.........$
$......1... 2... 3 ... 2 ... 1....$
$.1...3...6...7...6...3...1$
$...............................$
each number is equal to the sum of the three nearest to it numbers from the row above it; if the number is at the beginning or at the end of a row then it is equal to the sum of its two nearest numbers or just to the nearest number above it (the lacking numbers above the given one are assumed to be zeros). Prove that each row, starting with the third one, contains an even number.
2013 Singapore Junior Math Olympiad, 1
Let $a<b<c<d<e$ be real numbers. Among the $10$ sums of the pairs of these numbers, the least $3$ are $32,36,37$, while the largest two are $48$ and $51$. Find all possible values of $e$
2011 Singapore Junior Math Olympiad, 5
Initially, the number $10$ is written on the board. In each subsequent moves, you can either
(i) erase the number $1$ and replace it with a $10$, or
(ii) erase the number $10$ and replace it with a $1$ and a $25$ or
(iii) erase a $25$ and replace it with two $10$.
After sometime, you notice that there are exactly one hundred copies of $1$ on the board. What is the least possible sum of all the numbers on the board at that moment?
1974 Swedish Mathematical Competition, 1
Let $a_n = 2^{n-1}$ for $n > 0$. Let
\[
b_n = \sum\limits_{r+s \leq n} a_ra_s
\]
Find $b_n-b_{n-1}$, $b_n-2b_{n-1}$ and $b_n$.
1994 North Macedonia National Olympiad, 1
Let $ a_1, a_2, ..., a_ {1994} $ be integers such that $ a_1 + a_2 + ... + a_{1994} = 1994 ^{1994} $ .
Determine the remainder of the division of $ a ^ 3_1 + a ^ 3_2 + ... + a ^ 3_{1994} $ with $6$.
1994 North Macedonia National Olympiad, 3
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. $
2015 Dutch IMO TST, 3
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$.
2009 Postal Coaching, 3
Let $N_0$ denote the set of nonnegative integers and $Z$ the set of all integers. Let a function $f : N_0 \times Z \to Z$ satisfy the conditions
(i) $f(0, 0) = 1$, $f(0, 1) = 1$
(ii) for all $k, k \ne 0, k \ne 1$, $f(0, k) = 0$ and
(iii) for all $n \ge 1$ and $k, f(n, k) = f(n -1, k) + f(n- 1, k - 2n)$. Find the value of
$$\sum_{k=0}^{2009 \choose 2} f(2008, k)$$
1946 Moscow Mathematical Olympiad, 122
On the sides $PQ, QR, RP$ of $\vartriangle PQR$ segments $AB, CD, EF$ are drawn. Given a point $S_0$ inside triangle $\vartriangle PQR$, find the locus of points $S$ for which the sum of the areas of triangles $\vartriangle SAB$, $\vartriangle SCD$ and $\vartriangle SEF$ is equal to the sum of the areas of triangles $\vartriangle S_0AB$, $\vartriangle S_0CD$, $\vartriangle S0EF$. Consider separately the case $$\frac{AB}{PQ }= \frac{CD}{QR} = \frac{EF}{RP}.$$
2019 Tournament Of Towns, 4
Each segment whose endpoints are the vertices of a given regular $100$-gon is colored red, if the number of vertices between its endpoints is even, and blue otherwise. (For example, all sides of the $100$-gon are red.) A number is placed in every vertex so that the sum of their squares is equal to $1$. On each segment the product of the numbers at its endpoints is written. The sum of the numbers on the blue segments is subtracted from the sum of the numbers on the red segments. What is the greatest possible result?
(Ilya Bogdanov)