Found problems: 594
2016 Saudi Arabia GMO TST, 1
Let $S = x + y +z$ where $x, y, z$ are three nonzero real numbers satisfying the following system of inequalities:
$$xyz > 1$$
$$x + y + z >\frac{1}{x}+\frac{1}{y}+\frac{1}{z}$$
Prove that $S$ can take on any real values when $x, y, z$ vary
2014 German National Olympiad, 3
Given two positive integers $n$ and $k$, we say that $k$ is [i]$n$-ergetic[/i] if:
However the elements of $M=\{1,2,\ldots, k\}$ are coloured in red and green, there exist $n$ not necessarily distinct integers of the same colour whose sum is again an element of $M$ of the same colour. For each positive integer $n$, determine the least $n$-ergetic integer, if it exists.
2002 Mexico National Olympiad, 5
A [i]trio [/i] is a set of three distinct integers such that two of the numbers are divisors or multiples of the third. Which [i]trio [/i] contained in $\{1, 2, ... , 2002\}$ has the largest possible sum? Find all [i]trios [/i] with the maximum sum.
2008 Danube Mathematical Competition, 3
On a semicircle centred at $O$ and with radius $1$ choose the respective points $A_1,A_2,...,A_{2n}$ , for $n \in N^*$. The lenght of the projection of the vector $\overrightarrow {u}=\overrightarrow{OA_1} +\overrightarrow{OA_2}+...+\overrightarrow{OA_{2n}}$ on the diameter is an odd integer. Show that the projection of that vector on the diameter is at least $1$.
2015 Czech-Polish-Slovak Junior Match, 2
Decide if the vertices of a regular $30$-gon can be numbered by numbers $1, 2,.., 30$ in such a way that the sum of the numbers of every two neighboring to be a square of a certain natural number.
2010 Belarus Team Selection Test, 1.1
Does there exist a subset $E$ of the set $N$ of all positive integers such that none of the elements in $E$ can be presented as a sum of at least two other (not necessarily distinct) elements from $E$ ?
(E. Barabanov)
1996 Mexico National Olympiad, 4
For which integers $n\ge 2$ can the numbers $1$ to $16$ be written each in one square of a squared $4\times 4$ paper such that the $8$ sums of the numbers in rows and columns are all different and divisible by $n$?
2015 Poland - Second Round, 1
Real numbers $x_1, x_2, x_3, x_4$ are roots of the fourth degree polynomial $W (x)$ with integer coefficients.
Prove that if $x_3 + x_4$ is a rational number and $x_3x_4$ is a irrational number, then $x_1 + x_2 = x_3 + x_4$.
2019 Flanders Math Olympiad, 2
Calculate the sum of all unsimplified fractions whose numerator and denominator are positive divisors of $1000$.
1999 Tournament Of Towns, 3
(a) The numbers $1, 2,... , 100$ are divided into two groups so that the sum of all numbers in one group is equal to that in the other. Prove that one can remove two numbers from each group so that the sums of all numbers in each group are still the same.
(b) The numbers $1, 2 , ... , n$ are divided into two groups so that the sum of all numbers in one group is equal to that in the other . Is it true that for every such$ n > 4$ one can remove two numbers from each group so that the sums of all numbers in each group are still the same?
(A Shapovalov) [(a) for Juniors, (a)+(b) for Seniors]
1990 Tournament Of Towns, (265) 3
Find $10$ different positive integers such that each of them is a divisor of their sum
(S Fomin, Leningrad)
1998 Chile National Olympiad, 1
Find all pairs of naturals $a,b$ with $a <b$, such that the sum of the naturals greater than $a$ and less than $ b$ equals $1998$.
2018 CHMMC (Fall), 3
Compute
$$\sum^{\infty}_{n=1} \left( \frac{1}{n^2 + 3n} - \frac{1}{n^2 + 3n + 2}\right)$$
1986 All Soviet Union Mathematical Olympiad, 429
A cube with edge of length $n$ ($n\ge 3$) consists of $n^3$ unit cubes. Prove that it is possible to write different $n^3$ integers on all the unit cubes to provide the zero sum of all integers in the every row parallel to some edge.
2020-21 IOQM India, 3
If $\sum_{k=1}^{N} \frac{2k+1}{(k^2+k)^2}= 0.9999$ then determine the value of $N$.
2013 Tournament of Towns, 1
Several positive integers are written on a blackboard. The sum of any two of them is some power of two (for example, $2, 4, 8,...$). What is the maximal possible number of different integers on the blackboard?
2012 IFYM, Sozopol, 6
Calculate the sum
$1+\frac{\binom{2}{1}}{8}+\frac{\binom{4}{2}}{8^2}+\frac{\binom{6}{3}}{8^3}+...+\frac{\binom{2n}{n}}{8^n}+...$
2018 India PRMO, 6
Integers $a, b, c$ satisfy $a+b-c=1$ and $a^2+b^2-c^2=-1$. What is the sum of all possible values of $a^2+b^2+c^2$ ?
2013 India PRMO, 2
Let $S_n=\sum_{k=0}^{n}\frac{1}{\sqrt{k+1}+\sqrt{k}}$. What is the value of $\sum_{n=1}^{99}\frac{1}{S_n+S_{n-1}}$ ?
2018 Dutch IMO TST, 3
Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is de fined as follows:
we have $a_0 = n$ and for $k \ge 1, a_k$ is the smallest integer greater than $a_{k-1}$ for which $a_k +a_{k-1}$ is the square of an integer.
Prove that there are exactly $\lfloor \sqrt{2n}\rfloor$ positive integers that cannot be written in the form $a_k - a_{\ell}$ with $k > \ell\ge 0$.
2000 Tournament Of Towns, 1
Each of the $16$ squares in a $4 \times 4$ table contains a number. For any square, the sum of the numbers in the squares sharing a common side with the chosen square is equal to $1$. Determine the sum of all $16$ numbers in the table.
(R Zhenodarov)
2016 Saudi Arabia IMO TST, 1
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.
1993 Bundeswettbewerb Mathematik, 1
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).$
1999 Tournament Of Towns, 3
Several positive integers $a_0 , a_1 , a_2 , ... , a_n$ are written on a board. On a second board, we write the amount $b_0$ of numbers written on the first board, the amount $b_1$ of numbers on the first board exceeding $1$, the amount $b_2$ of numbers greater than $2$, and so on as long as the $b$s are still positive. Then we stop, so that we do not write any zeros. On a third board we write the numbers $c_0 , c_1 , c_2 , ...$. using the same rules as before, but applied to the numbers $b_0 , b_1 , b_2 , ...$ of the second board. Prove that the same numbers are written on the first and the third boards.
(H. Lebesgue - A Kanel)
2020 Vietnam Team Selection Test, 1
Given that $n> 2$ is a positive integer and a sequence of positive integers $a_1 <a_2 <...<a_n$. In
the subsets of the set $\{1,2,..., n\} $, there a subset $X$ such that $| \sum_{i \notin X} a_i -\sum_{i \in X} a_i |$ is the smallest .
Prove that there exists a sequence of positive integers $0<b_1 <b_2 <...<b_n$ such that $\sum_{i \notin X} b_i= \sum_{i \in X} b_i$.
In case this doesn't make sense, have a look at [url=https://drive.google.com/file/d/1xoBhJlG0xHwn6zAAA7AZDoaAqzZue-73/view]original wording in Vietnamese[/url].