Olympiad problems

2018 Abels Math Contest (Norwegian MO) Final, 4

Find all polynomials $P$ such that $P(x) + \binom{2018}{2}P(x+2)+...+\binom{2018}{2106}P(x+2016)+P(x+2018)=$ $=\binom{2018}{1}P(x+1)+\binom{2018}{3}P(x+3)+...+\binom{2018}{2105}P(x+2015)+\binom{2018}{2107}P(x+2017)$ for all real numbers $x$.

2004 Estonia Team Selection Test, 4

Tags: trigonometry , sum , rational , algebra

Denote $f(m) =\sum_{k=1}^m (-1)^k cos \frac{k\pi}{2 m + 1}$ For which positive integers $m$ is $f(m)$ rational?

1984 Polish MO Finals, 1

Tags: function , algebra , sum , composition

Find the number of all real functions $f$ which map the sum of $n$ elements into the sum of their images, such that $f^{n-1}$ is a constant function and $f^{n-2}$ is not. Here $f^0(x) = x$ and $f^k = f \circ f^{k-1}$ for $k \ge 1$.

2013 Korea Junior Math Olympiad, 3

Tags: algebra , sequence , recurrence relation , sum , positive integer , diophantine equation

$\{a_n\}$ is a positive integer sequence such that $a_{i+2} = a_{i+1} +a_i$ (for all $i \ge 1$). For positive integer $n$, define as $$b_n=\frac{1}{a_{2n+1}}\Sigma_{i=1}^{4n-2}a_i$$ Prove that $b_n$ is positive integer.

1999 Cono Sur Olympiad, 3

Tags: combinatorics , sum , coloring

There are $1999$ balls in a row, some are red and some are blue (it could be all red or all blue). Under every ball we write a number equal to the sum of the amount of red balls in the right of this ball plus the sum of the amount of the blue balls that are in the left of this ball. In the sequence of numbers that we get with this balls we have exactly three numbers that appears an odd number of times, which numbers could these three be?

2009 Singapore Junior Math Olympiad, 4

Tags: sum , number theory

Let $S$ be the set of integers that can be written in the form $50m + 3n$ where $m$ and $n$ are non-negative integers. For example $3, 50, 53$ are all in $S$. Find the sum of all positive integers not in $S$.

1999 Croatia National Olympiad, Problem 3

Tags: sum , summation , fibonacci , fibonacci sequence , algebra

Let $(a_n)$ be defined by $a_1=a_2=1$ and $a_n=a_{n-1}+a_{n-2}$ for $n>2$. Compute the sum $\frac{a_1}2+\frac{a_2}{2^2}+\frac{a_3}{2^3}+\ldots$.

2018 Dutch IMO TST, 3

Tags: number theory , sum , floor function , perfect square

Let $n \ge 0$ be an integer. A sequence $a_0,a_1,a_2,...$ of integers is defined 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$.

1986 Tournament Of Towns, (119) 1

Tags: number theory , digit , 2-digit , sum , difference

We are given two two-digit numbers , $x$ and $y$. It is known that $x$ is twice as big as $y$. One of the digits of $y$ is the sum, while the other digit of $y$ is the difference, of the digits of $x$ . Find the values of $x$ and $y$, proving that there are no others.

2013 Czech-Polish-Slovak Junior Match, 2

Tags: coloring , combinatorics , sum

Each positive integer should be colored red or green in such a way that the following two conditions are met: - Let $n$ be any red number. The sum of any $n$ (not necessarily different) red numbers is red. - Let $m$ be any green number. The sum of any $m$ (not necessarily different) green numbers is green. Determine all such colorings.

2020 Paraguay Mathematical Olympiad, 5

Tags: algebra , sequence , sum

The general term of a sequence of numbers is defined as $a_n =\frac{1}{n^2 - n}$, for every integer $n \ge 3$. That is, $a_3 =\frac16$, $a_4 =\frac{1}{12}$, $a_5 =\frac{1}{20}$, and so on. Find a general expression for the sum $S_n$, which is the sum of all terms from $a_3$ until $a_n$.

2015 Dutch IMO TST, 4

Tags: maximum value , maximum , combinatorics , sum , coloring

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.

2016 Thailand Mathematical Olympiad, 2

Tags: bijection , sum , inequalities

Let $M$ be a positive integer, and $A = \{1, 2,... , M + 1\}$. Show that if $f$ is a bijection from $A$ to $A$ then $\sum_{n=1}^{M} \frac{1}{f(n) + f(n + 1)} > \frac{M}{M + 3}$

2003 Greece JBMO TST, 2

Tags: sum , algebra

Calculate if $n\in N$ with $n>2$ the value of $$B=\sqrt{1+\frac{1}{2^2}+\frac{1}{3^2}}+\sqrt{1+\frac{1}{3^2}+\frac{1}{4^2}}+...+\sqrt{1+\frac{1}{(n-1)^2}+\frac{1}{n^2}} $$

1990 Mexico National Olympiad, 4

Tags: algebra , sum

Find $0/1 + 1/1 + 0/2 + 1/2 + 2/2 + 0/3 + 1/3 + 2/3 + 3/3 + 0/4 + 1/4 + 2/4 + 3/4 + 4/4 + 0/5 + 1/5 + 2/5 + 3/5 + 4/5 + 5/5 + 0/6 + 1/6 + 2/6 + 3/6 + 4/6 + 5/6 + 6/6$

2002 Swedish Mathematical Competition, 1

Tags: algebra , sum , combinatorics

$268$ numbers are written around a circle. The $17$th number is $3$, the $83$rd is $4$ and the $144$th is $9$. The sum of every $20$ consecutive numbers is $72$. Find the $210$th number.

1996 Bundeswettbewerb Mathematik, 2

Tags: combinatorics , sum , board

The cells of an $n \times n$ board are labelled with the numbers $1$ through $n^2$ in the usual way. Let $n$ of these cells be selected, no two of which are in the same row or column. Find all possible values of the sum of their labels.

1977 Bundeswettbewerb Mathematik, 1

Tags: algebra , number theory , sum , divisible , integer

Among $2000$ distinct positive integers, there are equally many even and odd ones. The sum of the numbers is less than $3000000.$ Show that at least one of the numbers is divisible by $3.$

2021 Abels Math Contest (Norwegian MO) Final, 2a

Tags: number theory , sum

Show that for all $n\ge 3$ there are $n$ different positive integers $x_1,x_2, ...,x_n$ such that $$\frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}= 1.$$

2004 Thailand Mathematical Olympiad, 9

Tags: algebra , sum , factorial

Compute the sum $$\sum_{k=0}^{n}\frac{(2n)!}{k!^2(n-k)!^2}.$$

2017 Dutch Mathematical Olympiad, 4

Tags: remainder , sum , number theory

If we divide the number $13$ by the three numbers $5, 7$, and $9$, then these divisions leave remainders: when dividing by $5$ the remainder is $3$, when dividing by $7$ the remainder is $6$, and when dividing by $9$ the remainder is 4. If we add these remainders, we obtain $3 + 6 + 4 = 13$, the original number. (a) Let $n$ be a positive integer and let $a$ and $b$ be two positive integers smaller than $n$. Prove: if you divide $n$ by $a$ and $b$, then the sum of the two remainders never equals $n$. (b) Determine all integers $n > 229$ having the property that if you divide $n$ by $99, 132$, and $229$, the sum of the three remainders is $n$.

1996 All-Russian Olympiad Regional Round, 9.5

Tags: number theory , sum , divisor

Find all natural numbers that have exactly six divisors whose sum is $3500$.

2018 Hanoi Open Mathematics Competitions, 9

Tags: sum , algebra

Each of the thirty squares in the diagram below contains a number $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$ of which each number is used exactly three times. The sum of three numbers in three squares on each of the thirteen line segments is equal to $S$. [img]https://cdn.artofproblemsolving.com/attachments/8/0/3e056ebc252aee9ade1f45fd337cc6a2f84302.png[/img]

2014 Gulf Math Olympiad, 4

Tags: combinatorics , sum , chessboard

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?

2000 Tournament Of Towns, 1

Tags: sum , combinatorics , table , square table

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)