Olympiad problems

2009 Korea - Final Round, 3

2008 white stones and 1 black stone are in a row. An 'action' means the following: select one black stone and change the color of neighboring stone(s). Find all possible initial position of the black stone, to make all stones black by finite actions.

2006 ISI B.Stat Entrance Exam, 7

Tags: inequalities , induction , algebra

for any positive integer $n$ greater than $1$, show that \[2^n<\binom{2n}{n}<\frac{2^n}{\prod\limits_{i=0}^{n-1} \left(1-\frac{i}{n}\right)}\]

2001 District Olympiad, 1

Tags: induction , arithmetic sequence , algebra

Let $(a_n)_{n\ge 1}$ be a sequence of real numbers such that \[a_1\binom{n}{1}+a_2\binom{n}{2}+\ldots+a_n\binom{n}{n}=2^{n-1}a_n,\ (\forall)n\in \mathbb{N}^*\] Prove that $(a_n)_{n\ge 1}$ is an arithmetical progression. [i]Lucian Dragomir[/i]

2004 Turkey MO (2nd round), 4

Tags: function , induction , algebra

Find all functions $f:\mathbb{Z}\to \mathbb{Z}$ satisfying the condition $f(n)-f(n+f(m))=m$ for all $m,n\in \mathbb{Z}$

PEN K Problems, 20

Tags: function , induction , functional equation

Find all functions $f: \mathbb{Q}\to \mathbb{Q}$ such that for all $x,y \in \mathbb{Q}$: \[f(x+y)+f(x-y)=2(f(x)+f(y)).\]

2011 Serbia National Math Olympiad, 1

Tags: inequalities , induction , algebra

Let $n \ge 2$ be integer. Let $a_0$, $a_1$, ... $a_n$ be sequence of positive reals such that: $(a_{k-1}+a_k)(a_k+a_{k+1})=a_{k-1}-a_{k+1}$, for $k=1, 2, ..., n-1$. Prove $a_n< \frac{1}{n-1}$.

1995 Polish MO Finals, 3

Tags: induction , modular arithmetic , algebra , polynomial , number theory

Let $p$ be a prime number, and define a sequence by: $x_i=i$ for $i=,0,1,2...,p-1$ and $x_n=x_{n-1}+x_{n-p}$ for $n \geq p$ Find the remainder when $x_{p^3}$ is divided by $p$.