Found problems: 580
2003 Junior Tuymaada Olympiad, 4
The natural numbers $ a_1 $, $ a_2 $, $ \dots $, $ a_n $ satisfy the condition $ 1 / a_1 + 1 / a_2 + \ldots + 1 / a_n = 1 $. Prove that all these numbers do not exceed $$ n ^ {2 ^ n} $$
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 Switzerland Team Selection Test, 2
Real numbers $a_1,a_2,...,a_{16}$ satisfy the conditions $\sum_{i=1}^{16}a_i = 100$ and $\sum_{i=1}^{16}a_i^2 = 1000$ .
What is the greatest possible value of $a_16$?
2019 Silk Road, 4
The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $
Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers.
(Here, $ [x] $ is the largest integer not exceeding $ x $.)
1983 Brazil National Olympiad, 3
Show that $1 + 1/2 + 1/3 + ... + 1/n$ is not an integer for $n > 1$.
2001 Estonia National Olympiad, 3
There are three squares in the picture. Find the sum of angles $ADC$ and $BDC$.
[img]https://cdn.artofproblemsolving.com/attachments/c/9/885a6c6253fca17e24528f8ba8a5d31a18c845.png[/img]
2016 IFYM, Sozopol, 8
Let $a_i$, $i=1,2,…2016$, be fixed natural numbers. Prove that there exist infinitely many 2016-tuples $x_1,x_2…x_{2016}$ of natural numbers, for which the sum
$\sum_{i=1}^{2016}{a_i x_i^i}$
is a 2017-th power of a natural number.
2002 Estonia National Olympiad, 3
John takes seven positive integers $a_1,a_2,...,a_7$ and writes the numbers $a_i a_j$, $a_i+a_j$ and $|a_i -a_j |$ for all $i \ne j$ on the blackboard. Find the greatest possible number of distinct odd integers on the blackboard.
2015 Dutch IMO TST, 4
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.
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).$
2012 Tournament of Towns, 3
Consider the points of intersection of the graphs $y = \cos x$ and $x = 100 \cos (100y)$ for which both coordinates are positive. Let $a$ be the sum of their $x$-coordinates and $b$ be the sum of their $y$-coordinates. Determine the value of $\frac{a}{b}$.
2014 Contests, 4
The numbers from $1$ to $64$ must be written on the small squares of a chessboard, with a different number in each small square. Consider the $112$ numbers you can make by adding the numbers in two small squares which have a common edge. Is it possible to write the numbers in the squares so that these $112$ sums are all different?
2004 Tournament Of Towns, 1
The sum of all terms of a finite arithmetical progression of integers is a power of two. Prove that the number of terms is also a power of two.
1995 Czech and Slovak Match, 4
For each real number $p > 1$, find the minimum possible value of the sum $x+y$, where the numbers $x$ and $y$ satisfy the equation $(x+\sqrt{1+x^2})(y+\sqrt{1+y^2}) = p$.
1992 Chile National Olympiad, 7
$\bullet$ Determine a natural $n$ such that the constant sum $S$ of a magic square of $ n \times n$ (that is, the sum of its elements in any column, or the diagonal) differs as little as possible from $1992$.
$\bullet$ Construct or describe the construction of this magic square.
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$.
2013 Kyiv Mathematical Festival, 2
For which positive integers $n \ge 2$ it is possible to represent the number $n^2$ as a sum of several distinct positive integers not exceeding $2n$?
1996 Singapore Senior Math Olympiad, 2
Let $180^o < \theta_1 < \theta_2 <...< \theta_n = 360^o$. For $i = 1,2,..., n$, $P_i = (\cos \theta_i^o, \sin \theta_i^o)$ is a point on the circle $C$ with centre $(0,0)$ and radius $1$. Let $P$ be any point on the upper half of $C$. Find the coordinates of $P$ such that the sum of areas $[PP_1P_2] + [PP_2P_3] + ...+ [PP_{n-1}P_n]$ attains its maximum.
2014 Gulf Math Olympiad, 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.
2015 Dutch IMO TST, 4
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.
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.
1987 Swedish Mathematical Competition, 1
Sixteen real numbers are arranged in a magic square of side $4$ so that the sum of numbers in each row, column or main diagonal equals $k$. Prove that the sum of the numbers in the four corners of the square is also $k$.
2019 Saint Petersburg Mathematical Olympiad, 4
Olya wrote fractions of the form $1 / n$ on cards, where $n$ is all possible divisors the numbers $6^{100}$ (including the unit and the number itself). These cards she laid out in some order. After that, she wrote down the number on the first card, then the sum of the numbers on the first and second cards, then the sum of the numbers on the first three cards, etc., finally, the sum of the numbers on all the cards. Every amount Olya recorded on the board in the form of irreducible fraction. What is the least different denominators could be on the numbers on the board?
2012 Tournament of Towns, 4
Alex marked one point on each of the six interior faces of a hollow unit cube. Then he connected by strings any two marked points on adjacent faces. Prove that the total length of these strings is at least $6\sqrt2$.
2009 QEDMO 6th, 8
Given $n$ integers $a_1, a_2, ..., a_n$, which $a_1 = 1$ and $a_i \le a_{i + 1} \le 2a_i$ for each $i \in \{1,2,...,n-1\}$ .
Prove that if $a_1 + a_2 +... + a_n$ is even, you do select some of the numbers so that their sum equals $\frac{a_1 + a_2 +... + a_n}{2}$ .