Olympiad problems

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.

1992 Austrian-Polish Competition, 1

Tags: sum , positive , number theory , product , even , divisor

For a natural number $n$, denote by $s(n)$ the sum of all positive divisors of n. Prove that for every $n > 1$ the product $s(n - 1)s(n)s(n + 1)$ is even.

2019 SAFEST Olympiad, 4

Tags: minimum , sum , algebra , inequalities

Let $a_1, a_2, . . . , a_{2019}$ be any positive real numbers such that $\frac{1}{a_1 + 2019}+\frac{1}{a_2 + 2019}+ ... +\frac{1}{a_{2019} + 2019}=\frac{1}{2019}$. Find the minimum value of $a_1a_2... a_{2019}$ and determine for which values of $a_1, a_2, . . . , a_{2019}$ this minimum occurs

Kvant 2020, M942

Tags: sum

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

2003 Belarusian National Olympiad, 4

Tags: algebra , sum , min , inequalities

Positive numbers $a_1,a_2,...,a_n, b_1, b_2,...,b_n$ satisfy the condition $a_1+a_2+...+a_n=b_1+ b_2+...+b_n=1$. Find the smallest possible value of the sum $$\frac{a_1^2}{a_1+b_1}+\frac{a_2^2}{a_2+b_2}+...+\frac{a_n^2}{a_n+b_n}$$ (V.Kolbun)

2017 Puerto Rico Team Selection Test, 1

Tags: sum , algebra , functional equation , functional

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!)$.

1996 Estonia National Olympiad, 1

Tags: sum , product , diophantine equation , diophantine , number theory

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.

2001 Singapore MO Open, 4

Tags: consecutive , sum of squares , sum , number theory

A positive integer $n$ is said to possess Property ($A$) if there exists a positive integer $N$ such that $N^2$ can be written as the sum of the squares of $n$ consecutive positive integers. Is it true that there are infinitely many positive integers which possess Property ($A$)? Justify your answer. (As an example, the number $n = 2$ possesses Property ($A$) since $5^2 = 3^2 + 4^2$).

2013 Tournament of Towns, 2

Tags: consecutive , number theory , sum , product

A math teacher chose $10$ consequtive numbers and submitted them to Pete and Basil. Each boy should split these numbers in pairs and calculate the sum of products of numbers in pairs. Prove that the boys can pair the numbers differently so that the resulting sums are equal.

2013 Tournament of Towns, 4

Tags: coloring , sum , product , algebra , combinatorics

On a circle, there are $1000$ nonzero real numbers painted black and white in turn. Each black number is equal to the sum of two white numbers adjacent to it, and each white number is equal to the product of two black numbers adjacent to it. What are the possible values of the total sum of $1000$ numbers?

1939 Moscow Mathematical Olympiad, 045

Tags: geometry , sum , geometric construction , line construction

Consider points $A, B, C$. Draw a line through $A$ so that the sum of distances from $B$ and $C$ to this line is equal to the length of a given segment.

1975 Dutch Mathematical Olympiad, 3

Tags: inequalities , sum , algebra

Given are the real numbers $x_1,x_2,...,x_n$ and $t_1,t_2,...,t_n$ for which holds: $\sum_{i=1}^n x_i = 0$. Prove that $$\sum_{i=1}^n \left( \sum_{j=1}^n (t_i-t_j)^2x_ix_j \right)\le 0.$$

2004 Greece JBMO TST, 2

Tags: algebra , sum

Real numbers $x_1,x_2,...x_{2004},y_1,y_2,...y_{2004}$ differ from $1$ and are such that $x_ky_k=1$ for every $k=1,2,...,2004$. Calculate the sum $$S=\frac{1}{1-x_1^3}+\frac{1}{1-x_2^3}+...+\frac{1}{1-x_{2004}^3}+\frac{1}{1-y_1^3}+\frac{1}{1-y_2^3}+...+\frac{1}{1-y_{2004}^3}$$

1960 Kurschak Competition, 2

Tags: number theory , integer , sum

Let $a_1 = 1, a_2, a_3,...$: be a sequence of positive integers such that $$a_k < 1 + a_1 + a_2 +... + a_{k-1}$$ for all $k > 1$. Prove that every positive integer can be expressed as a sum of $a_i$s.

1982 Bundeswettbewerb Mathematik, 1

Tags: sum , number theory , divisor

Let $S$ be the sum of the greatest odd divisors of the natural numbers $1$ through $2^n$. Prove that $3S = 4^n + 2$.

2013 Dutch Mathematical Olympiad, 5

Tags: digit , sum , number theory

The number $S$ is the result of the following sum: $1 + 10 + 19 + 28 + 37 +...+ 10^{2013}$ If one writes down the number $S$, how often does the digit `$5$' occur in the result?

1984 Tournament Of Towns, (077) 2

Tags: number theory , combinatorics , remainder , sum , permutation

A set of numbers $a_1, a_2 , . . . , a_{100}$ is obtained by rearranging the numbers $1 , 2,..., 100$ . Form the numbers $b_1=a_1$ $b_2= a_1 + a_2$ $b_3=a_1 + a_2 + a_3$ ... $b_{100}=a_1 + a_2 + ...+a_{100}$ Prove that among the remainders on dividing the numbers by $100 , 11$ of them are different . ( L . D . Kurlyandchik , Leningrad)

2006 MOP Homework, 5

Tags: prime , sum , number theory

Let $n$ be a nonnegative integer, and let $p$ be a prime number that is congruent to $7$ modulo $8$. Prove that $$\sum_{k=1}^{p} \left\{ \frac{k^{2n}}{p} - \frac{1}{2} \right\} = \frac{p-1}{2}$$

2003 Austrian-Polish Competition, 8

Tags: inequalities , sum , algebra

Given reals $x_1 \ge x_2 \ge ... \ge x_{2003} \ge 0$, show that $$x_1^n - x_2^n + x_2^n - ... - x_{2002}^n + x_{2003}^n \ge (x_1 - x_2 + x_3 - x_4 + ... - x_{2002} + x_{2003})^n$$ for any positive integer $n$.

1991 All Soviet Union Mathematical Olympiad, 554

Tags: sum , vector , geometry

Do there exist $4$ vectors in the plane so that none is a multiple of another, but the sum of each pair is perpendicular to the sum of the other two? Do there exist $91$ non-zero vectors in the plane such that the sum of any $19$ is perpendicular to the sum of the others?

2015 Saudi Arabia IMO TST, 1

Tags: combinatorics , sum

Let $S$ be a positive integer divisible by all the integers $1, 2,...,2015$ and $a_1, a_2,..., a_k$ numbers in $\{1, 2,...,2015\}$ such that $2S \le a_1 + a_2 + ... + a_k$. Prove that we can select from $a_1, a_2,..., a_k$ some numbers so that the sum of these selected numbers is equal to $S$. Lê Anh Vinh

1985 Greece National Olympiad, 4

Tags: algebra , sum

Consider function $f:\mathbb{R}\to \mathbb{R}$ with $f(x)=\frac{4^x}{4^x+2},$ for any $x\in \mathbb{R}$ a) Prove that $f(x)+f(1-x)=1,$ b) Claculate the sum $$f\left(\frac{1}{1986} \right)+f\left(\frac{2}{1986} \right)+\cdots f\left(\frac{1986}{1986} \right).$$

2002 Silk Road, 3

Tags: board , number theory , combinatorics , sum

In each unit cell of a finite set of cells of an infinite checkered board, an integer is written so that the sum of the numbers in each row, as well as in each column, is divided by $2002$. Prove that every number $\alpha$ can be replaced by a certain number $\alpha'$ , divisible by $2002$ so that $|\alpha-\alpha'| <2002$ and the sum of the numbers in all rows, and in all columns will not change.

1999 Tournament Of Towns, 1

Tags: sum , algebra

In a row are written $1999$ numbers such that except the first and the last , each is equal to the sum of its neighbours. If the first number is $1$, find the last number. (V Senderov)

1991 Chile National Olympiad, 5

Tags: fibonacci , number theory , algebra , sum

The sequence $(a_k)$, $k> 0$ is Fibonacci, with $a_0 = a_1 = 1$. Calculate the value of $$\sum_{j = 0}^{\infty} \frac{a_j}{2^j}$$