Found problems: 580
2019 Saint Petersburg Mathematical Olympiad, 5
Call the [i]improvement [/i] of a positive number its replacement by a power of two. (i.e. one of the numbers $1, 2, 4, 8, ...$), for which it increases, but not more than than $3$ times. Given $2^{100}$ positive numbers with a sum of $2^{100}$. Prove that you can erase some of them, and [i]improve [/i] each of the other numbers so that the sum the resulting numbers were again $2^{100}$.
1995 Israel Mathematical Olympiad, 3
If $k$ and $n$ are positive integers, prove the inequality
$$\frac{1}{kn} +\frac{1}{kn+1} +...+\frac{1}{(k+1)n-1} \ge n \left(\sqrt[n]{\frac{k+1}{k}}-1\right)$$
1935 Moscow Mathematical Olympiad, 020
How many ways are there of representing a positive integer $n$ as the sum of three positive integers? Representations which differ only in the order of the summands are considered to be distinct.
2018 Czech-Polish-Slovak Junior Match, 1
Are there four real numbers $a, b, c, d$ for every three positive real numbers $x, y, z$ with the property $ad + bc = x$, $ac + bd = y$, $ab + cd = z$ and one of the numbers $a, b, c, d$ is equal to the sum of the other three?
2014 Contests, 2
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.
2013 Costa Rica - Final Round, 2
Determine all even positive integers that can be written as the sum of odd composite positive integers.
2015 Caucasus Mathematical Olympiad, 4
We call a number greater than $25$, [i] semi-prime[/i] if it is the sum of some two different prime numbers. What is the greatest number of consecutive natural numbers that can be [i]semi-prime[/i]?
2011 Tournament of Towns, 4
The vertices of a $33$-gon are labelled with the integers from $1$ to $33$. Each edge is then labelled with the sum of the labels of its two vertices. Is it possible for the edge labels to consist of $33$ consecutive numbers?
1982 Austrian-Polish Competition, 9
Define $S_n=\sum_{j,k=1}^{n} \frac{1}{\sqrt{j^2+k^2}}$.
Find a positive constant $C$ such that the inequality $n\le S_n \le Cn$ holds for all $n \ge 3$.
(Note. The smaller $C$, the better the solution.)
2004 Tournament Of Towns, 2
Find all possible values of $n \ge 1$ for which there exist $n$ consecutive positive integers whose sum is a prime number.
Kvant 2020, M942
We divide the set $\{1,2,\cdots,2n\}$ into two disjoint sets : $\{a_1,a_2,\cdots,a_n\}$ and $\{b_1,b_2,\cdots,b_n\}$ such that :
$$a_1<a_2<\cdots<a_n\text{ and } b_1>b_2>\cdots>b_n.$$
Show that :
$$|a_1-b_1|+\cdots+|a_n-b_n|=n^2. $$
2019 Durer Math Competition Finals, 15
The positive integer $m$ and non-negative integers $x_0, x_1,..., x_{1001}$ satisfy the following equation: $$m^{x_0} =\sum_{i=1}^{1001}m^{x_i}.$$ How many possibilities are there for the value of $m$?
2013 Dutch BxMO/EGMO TST, 2
Consider a triple $(a, b, c)$ of pairwise distinct positive integers satisfying $a + b + c = 2013$. A step consists of replacing the triple $(x, y, z)$ by the triple $(y + z - x,z + x - y,x + y - z)$. Prove that, starting from the given triple $(a, b,c)$, after $10$ steps we obtain a triple containing at least one negative number.
1988 All Soviet Union Mathematical Olympiad, 466
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.
2005 BAMO, 1
An integer is called [i]formidable[/i] if it can be written as a sum of distinct powers of $4$, and [i]successful [/i] if it can be written as a sum of distinct powers of $6$. Can $2005$ be written as a sum of a [i]formidable [/i] number and a [i]successful [/i] number? Prove your answer.
2014 Greece JBMO TST, 4
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$
2021 Austrian MO Beginners' Competition, 1
The pages of a notebook are numbered consecutively so that the numbers $1$ and $2$ are on the second sheet, numbers $3$ and $4$, and so on. A sheet is torn out of this notebook. All of the remaining page numbers are addedand have sum $2021$.
(a) How many pages could the notebook originally have been?
(b) What page numbers can be on the torn sheet?
(Walther Janous)
1998 Austrian-Polish Competition, 4
For positive integers $m, n$, denote $$S_m(n)=\sum_{1\le k \le n} \left[ \sqrt[k^2]{k^m}\right]$$
Prove that $S_m(n) \le n + m (\sqrt[4]{2^m}-1)$
2018 India PRMO, 22
A positive integer $k$ is said to be [i]good [/i] if there exists a partition of $ \{1, 2, 3,..., 20\}$ into disjoint proper subsets such that the sum of the numbers in each subset of the partition is $k$. How many [i]good [/i] numbers are there?
2012 Danube Mathematical Competition, 4
Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.
2001 Estonia National Olympiad, 2
Find the minimum value of $n$ such that, among any $n$ integers, there are three whose sum is divisible by $3$.
2013 Estonia Team Selection Test, 3
Let $x_1,..., x_n$ be non-negative real numbers, not all of which are zeros.
(i) Prove that
$$1 \le \frac{\left(x_1+\frac{x_2}{2}+\frac{x_3}{3}+...+\frac{x_n}{n}\right)(x_1+2x_2+3x_3+...+nx_n)}{(x_1+x_2+x_3+...+x_n)^2} \le \frac{(n+1)^2}{4n}$$
(ii) Show that, for each $n > 1$, both inequalities can hold as equalities.
2017 Puerto Rico Team Selection Test, 1
Let $f$ be a function such that $f (x + y) = f (x) + f (y)$ for all $x,y \in R$ and $f (1) = 100$. Calculate $\sum_{k = 1}^{10}f (k!)$.
1997 Singapore Senior Math Olympiad, 1
Let $x_1,x_2,x_3,x_4, x_5,x_6$ be positive real numbers. Show that
$$\left( \frac{x_2}{x_1} \right)^5+\left( \frac{x_4}{x_2} \right)^5+\left( \frac{x_6}{x_3} \right)^5+\left( \frac{x_1}{x_4} \right)^5+\left( \frac{x_3}{x_5} \right)^5+\left( \frac{x_5}{x_6} \right)^5 \ge \frac{x_1}{x_2}+\frac{x_2}{x_4}+\frac{x_3}{x_6}+\frac{x_4}{x_1}+\frac{x_5}{x_3}+\frac{x_6}{x_5}$$
2001 Grosman Memorial Mathematical Olympiad, 2
If $x_1,x_2,...,x_{2001}$ are real numbers with $0 \le x_n \le 1$ for $n = 1,2,...,2001$, find the maximum value of
$$\left(\frac{1}{2001}\sum_{n=1}^{2001}x_n^2\right)-\left(\frac{1}{2001}\sum_{n=1}^{2001}x_n\right)^2$$
Where is this maximum attained?