Found problems: 1782
2002 Turkey MO (2nd round), 3
Let $n$ be a positive integer and let $T$ denote the collection of points $(x_1, x_2, \ldots, x_n) \in \mathbb R^n$ for which there exists a permutation $\sigma$ of $1, 2, \ldots , n$ such that $x_{\sigma(i)} - x_{\sigma(i+1) } \geq 1$ for each $i=1, 2, \ldots , n.$ Prove that there is a real number $d$ satisfying the following condition:
For every $(a_1, a_2, \ldots, a_n) \in \mathbb R^n$ there exist points $(b_1, \ldots, b_n)$ and $(c_1,\ldots, c_n)$ in $T$ such that, for each $i = 1, . . . , n,$
\[a_i=\frac 12 (b_i+c_i) , \quad |a_i - b_i| \leq d, \quad \text{and} \quad |a_i - c_i| \leq d.\]
2006 Baltic Way, 8
The director has found out that six conspiracies have been set up in his department, each of them involving exactly $3$ persons. Prove that the director can split the department in two laboratories so that none of the conspirative groups is entirely in the same laboratory.
2005 Georgia Team Selection Test, 1
1. The transformation $ n \to 2n \minus{} 1$ or $ n \to 3n \minus{} 1$, where $ n$ is a positive integer, is called the 'change' of $ n$. Numbers $ a$ and $ b$ are called 'similar', if there exists such positive integer, that can be got by finite number of 'changes' from both $ a$ and $ b$. Find all positive integers 'similar' to $ 2005$ and less than $ 2005$.
2011 Czech-Polish-Slovak Match, 2
Written on a blackboard are $n$ nonnegative integers whose greatest common divisor is $1$. A [i]move[/i] consists of erasing two numbers $x$ and $y$, where $x\ge y$, on the blackboard and replacing them with the numbers $x-y$ and $2y$. Determine for which original $n$-tuples of numbers on the blackboard is it possible to reach a point, after some number of moves, where $n-1$ of the numbers of the blackboard are zeroes.
2012 ELMO Shortlist, 6
Consider a directed graph $G$ with $n$ vertices, where $1$-cycles and $2$-cycles are permitted. For any set $S$ of vertices, let $N^{+}(S)$ denote the out-neighborhood of $S$ (i.e. set of successors of $S$), and define $(N^{+})^k(S)=N^{+}((N^{+})^{k-1}(S))$ for $k\ge2$.
For fixed $n$, let $f(n)$ denote the maximum possible number of distinct sets of vertices in $\{(N^{+})^k(X)\}_{k=1}^{\infty}$, where $X$ is some subset of $V(G)$. Show that there exists $n>2012$ such that $f(n)<1.0001^n$.
[i]Linus Hamilton.[/i]
2009 China Team Selection Test, 3
Let $ (a_{n})_{n\ge 1}$ be a sequence of positive integers satisfying $ (a_{m},a_{n}) = a_{(m,n)}$ (for all $ m,n\in N^ +$). Prove that for any $ n\in N^ + ,\prod_{d|n}{a_{d}^{\mu (\frac {n}{d})}}$ is an integer. where $ d|n$ denotes $ d$ take all positive divisors of $ n.$ Function $ \mu (n)$ is defined as follows: if $ n$ can be divided by square of certain prime number, then $ \mu (1) = 1;\mu (n) = 0$; if $ n$ can be expressed as product of $ k$ different prime numbers, then $ \mu (n) = ( - 1)^k.$
2017 Azerbaijan EGMO TST, 2
Let $(a_n)_n\geq 0$ and $a_{m+n}+a_{m-n}=\frac{1}{2}(a_{2m}+a_{2n})$ for every $m\geq n\geq0.$ If $a_1=1,$ then find the value of $a_{2007}.$
2006 ISI B.Math Entrance Exam, 4
Let $f:\mathbb{R} \to \mathbb{R}$ be a function that is a function that is differentiable $n+1$ times for some positive integer $n$ . The $i^{th}$ derivative of $f$ is denoted by $f^{(i)}$ . Suppose-
$f(1)=f(0)=f^{(1)}(0)=...=f^{(n)}(0)=0$.
Prove that $f^{(n+1)}(x)=0$ for some $x \in (0,1)$
2010 Canada National Olympiad, 1
For all natural $n$, an $n$-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second row, and so on, up to $n$ squares in the $n^{th}$ row, such that all the left-most squares in each row are aligned vertically.
Let $f(n)$ denote the minimum number of square tiles requires to tile the $n$-staircase, where the side lengths of the square tiles can be any natural number. e.g. $f(2)=3$ and $f(4)=7$.
(a) Find all $n$ such that $f(n)=n$.
(b) Find all $n$ such that $f(n) = n+1$.
2013 Romanian Masters In Mathematics, 2
Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation
\[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\]
that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$
2004 India IMO Training Camp, 2
Prove that for every positive integer $n$ there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.
2017 Azerbaijan EGMO TST, 4
Find all natural numbers a, b such that $ a^{n}\plus{} b^{n} \equal{} c^{n\plus{}1}$ where c and n are naturals.
2010 Indonesia TST, 3
Let $ \mathbb{Z}$ be the set of all integers. Define the set $ \mathbb{H}$ as follows:
(1). $ \dfrac{1}{2} \in \mathbb{H}$,
(2). if $ x \in \mathbb{H}$, then $ \dfrac{1}{1\plus{}x} \in \mathbb{H}$ and also $ \dfrac{x}{1\plus{}x} \in \mathbb{H}$.
Prove that there exists a bijective function $ f: \mathbb{Z} \rightarrow \mathbb{H}$.
2010 Contests, 2
Let $n$ be a positive integer number and let $a_1, a_2, \ldots, a_n$ be $n$ positive real numbers. Prove that $f : [0, \infty) \rightarrow \mathbb{R}$, defined by
\[f(x) = \dfrac{a_1 + x}{a_2 + x} + \dfrac{a_2 + x}{a_3 + x} + \cdots + \dfrac{a_{n-1} + x}{a_n + x} + \dfrac{a_n + x}{a_1 + x}, \]
is a decreasing function.
[i]Dan Marinescu et al.[/i]
2010 IMC, 2
Let $a_0,a_1,\dots,a_n$ be positive real numbers such that $a_{k+1}-a_k \geq 1$ for all $k=0,1,\dots,n-1.$ Prove that
\[1+\frac{1}{a_0} \left( 1+\frac1{a_1-a_0}\right)\cdots\left(1+\frac1{a_n-a_0}\right)\leq \left(1+\frac1{a_0}\right) \left(1+\frac1{a_1}\right)\cdots \left(1+\frac1{a_n}\right).\]
2002 Romania Team Selection Test, 1
Find all sets $A$ and $B$ that satisfy the following conditions:
a) $A \cup B= \mathbb{Z}$;
b) if $x \in A$ then $x-1 \in B$;
c) if $x,y \in B$ then $x+y \in A$.
[i]Laurentiu Panaitopol[/i]
2007 Romania Team Selection Test, 4
i) Find all infinite arithmetic progressions formed with positive integers such that there exists a number $N \in \mathbb{N}$, such that for any prime $p$, $p > N$,
the $p$-th term of the progression is also prime.
ii) Find all polynomials $f(X) \in \mathbb{Z}[X]$, such that there exist $N \in \mathbb{N}$, such that for any prime $p$, $p > N$, $| f(p) |$ is also prime.
[i]Dan Schwarz[/i]
2010 Contests, 4
Prove that for each positive integer n,the equation
$x^{2}+15y^{2}=4^{n}$
has at least $n$ integer solution $(x,y)$
2007 Polish MO Finals, 3
3. Plane is divided with horizontal and vertical lines into unit squares. Into each square we write a positive integer so that each positive integer appears exactly once. Determine whether it is possible to write numbers in such a way, that each written number is a divisor of a sum of its four neighbours.
2009 China Team Selection Test, 3
Let $ x_{1},x_{2},\cdots,x_{m},y_{1},y_{2},\cdots,y_{n}$ be positive real numbers. Denote by $ X \equal{} \sum_{i \equal{} 1}^{m}x,Y \equal{} \sum_{j \equal{} 1}^{n}y.$ Prove that $ 2XY\sum_{i \equal{} 1}^{m}\sum_{j \equal{} 1}^{n}|x_{i} \minus{} y_{j}|\ge X^2\sum_{j \equal{} 1}^{n}\sum_{l \equal{} 1}^{n}|y_{i} \minus{} y_{l}| \plus{} Y^2\sum_{i \equal{} 1}^{m}\sum_{k \equal{} 1}^{m}|x_{i} \minus{} x_{k}|$
1999 APMO, 2
Let $a_1, a_2, \dots$ be a sequence of real numbers satisfying $a_{i+j} \leq a_i+a_j$ for all $i,j=1,2,\dots$. Prove that
\[ a_1 + \frac{a_2}{2} + \frac{a_3}{3} + \cdots + \frac{a_n}{n} \geq a_n \]
for each positive integer $n$.
2006 China National Olympiad, 1
Let $a_1,a_2,\ldots,a_k$ be real numbers and $a_1+a_2+\ldots+a_k=0$. Prove that
\[ \max_{1\leq i \leq k} a_i^2 \leq \frac{k}{3} \left( (a_1-a_2)^2+(a_2-a_3)^2+\cdots +(a_{k-1}-a_k)^2\right). \]
2002 Putnam, 5
Define a sequence by $a_0=1$, together with the rules $a_{2n+1}=a_n$ and $a_{2n+2}=a_n+a_{n+1}$ for each integer $n\ge0$. Prove that every positive rational number appears in the set $ \left\{ \tfrac {a_{n-1}}{a_n}: n \ge 1 \right\} = \left\{ \tfrac {1}{1}, \tfrac {1}{2}, \tfrac {2}{1}, \tfrac {1}{3}, \tfrac {3}{2}, \cdots \right\} $.
2009 Hungary-Israel Binational, 3
(a) Do there exist 2009 distinct positive integers such that their sum is divisible by each of the given numbers?
(b) Do there exist 2009 distinct positive integers such that their sum is divisible by the sum of any two of the given numbers?
1981 IMO Shortlist, 10
Determine the smallest natural number $n$ having the following property: For every integer $p, p \geq n$, it is possible to subdivide (partition) a given square into $p$ squares (not necessarily equal).