Found problems: 1782
1995 USAMO, 1
Let $\, p \,$ be an odd prime. The sequence $(a_n)_{n \geq 0}$ is defined as follows: $\, a_0 = 0,$ $a_1 = 1, \, \ldots, \, a_{p-2} = p-2 \,$ and, for all $\, n \geq p-1, \,$ $\, a_n \,$ is the least positive integer that does not form an arithmetic sequence of length $\, p \,$ with any of the preceding terms. Prove that, for all $\, n, \,$ $\, a_n \,$ is the number obtained by writing $\, n \,$ in base $\, p-1 \,$ and reading the result in base $\, p$.
2004 China Western Mathematical Olympiad, 1
The sequence $\{a_n\}_{n}$ satisfies the relations $a_1=a_2=1$ and for all positive integers $n$,
\[ a_{n+2} = \frac 1{a_{n+1}} + a_n . \]
Find $a_{2004}$.
2009 Germany Team Selection Test, 2
Let $ \left(a_n \right)_{n \in \mathbb{N}}$ defined by $ a_1 \equal{} 1,$ and $ a_{n \plus{} 1} \equal{} a^4_n \minus{} a^3_n \plus{} 2a^2_n \plus{} 1$ for $ n \geq 1.$ Show that there is an infinite number of primes $ p$ such that none of the $ a_n$ is divisible by $ p.$
1992 National High School Mathematics League, 15
$n$ is a natural number, $f_n(x)=\frac{x^{n+1}-x^{-n-1}}{x-x^{-1}}(x\neq0,\pm1)$, let $y=x+\frac{1}{x}$.
[b](a)[/b] Prove that $f_{n+1}(x)=yf_n(x)-f_{n-1}(x)$
[b](b)[/b] Prove with mathematical induction:
$f_n(x)=\begin{cases}
y^n-\text{C}_{n-1}^{1}y^{n-2}+\cdots+(-1)^i\text{C}_{n-i}^{i}y^{n-2i}+\cdots+(-1)^{\frac{n}{2}}(i=1,2,\cdots,\frac{n}{2},n\text{ is even})\\
y^n-\text{C}_{n-1}^{1}y^{n-2}+\cdots+(-1)^i\text{C}_{n-i}^{i}y^{n-2i}+\cdots+(-1)^{\frac{n-1}{2}}\text{C}_{\frac{n+1}{2}}^{\frac{n-1}{2}}y(i=1,2,\cdots,\frac{n-1}{2},n\text{ is odd})
\end{cases}$.
2011 Pre - Vietnam Mathematical Olympiad, 3
There are $n$ students. Denoted the number of the selections to select two students (with their weights are $a$ and $b$) such that $\left| {a - b} \right| \le 1$ (kg) and $\left| {a - b} \right| \le 2$ (kg) by $A_1$ and $A_2$, respectively. Prove that $A_2<3A_1+n$.
2006 APMO, 2
Prove that every positive integer can be written as a finite sum of distinct integral powers of the golden ratio.
PEN M Problems, 29
The sequence $\{a_{n}\}_{n \ge 1}$ is defined by $a_{1}=1$ and \[a_{n+1}= \frac{a_{n}}{2}+\frac{1}{4a_{n}}\; (n \in \mathbb{N}).\] Prove that $\sqrt{\frac{2}{2a_{n}^{2}-1}}$ is a positive integer for $n>1$.
2011 India IMO Training Camp, 3
Consider a $ n\times n $ square grid which is divided into $ n^2 $ unit squares(think of a chess-board). The set of all unit squares intersecting the main diagonal of the square or lying under it is called an $n$-staircase. Find the number of ways in which an $n$-stair case can be partitioned into several rectangles, with sides along the grid lines, having mutually distinct areas.
2011 Serbia National Math Olympiad, 1
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}$.
2006 Italy TST, 3
Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that for all integers $m,n$,
\[f(m - n + f(n)) = f(m) + f(n).\]
2013 ELMO Shortlist, 5
There is a $2012\times 2012$ grid with rows numbered $1,2,\dots 2012$ and columns numbered $1,2,\dots, 2012$, and we place some rectangular napkins on it such that the sides of the napkins all lie on grid lines. Each napkin has a positive integer thickness. (in micrometers!)
(a) Show that there exist $2012^2$ unique integers $a_{i,j}$ where $i,j \in [1,2012]$ such that for all $x,y\in [1,2012]$, the sum \[ \sum _{i=1}^{x} \sum_{j=1}^{y} a_{i,j} \] is equal to the sum of the thicknesses of all the napkins that cover the grid square in row $x$ and column $y$.
(b) Show that if we use at most $500,000$ napkins, at least half of the $a_{i,j}$ will be $0$.
[i]Proposed by Ray Li[/i]
2014 ELMO Shortlist, 2
A $2^{2014} + 1$ by $2^{2014} + 1$ grid has some black squares filled. The filled black squares form one or more snakes on the plane, each of whose heads splits at some points but never comes back together. In other words, for every positive integer $n$ greater than $2$, there do not exist pairwise distinct black squares $s_1$, $s_2$, \dots, $s_n$ such that $s_i$ and $s_{i+1}$ share an edge for $i=1,2, \dots, n$ (here $s_{n+1}=s_1$).
What is the maximum possible number of filled black squares?
[i]Proposed by David Yang[/i]
1990 IMO Shortlist, 15
Determine for which positive integers $ k$ the set \[ X \equal{} \{1990, 1990 \plus{} 1, 1990 \plus{} 2, \ldots, 1990 \plus{} k\}\] can be partitioned into two disjoint subsets $ A$ and $ B$ such that the sum of the elements of $ A$ is equal to the sum of the elements of $ B.$
2011 All-Russian Olympiad, 1
Given are $10$ distinct real numbers. Kyle wrote down the square of the difference for each pair of those numbers in his notebook, while Peter wrote in his notebook the absolute value of the differences of the squares of these numbers. Is it possible for the two boys to have the same set of $45$ numbers in their notebooks?
2007 Romania Team Selection Test, 3
The problem is about real polynomial functions, denoted by $f$, of degree $\deg f$.
a) Prove that a polynomial function $f$ can`t be wrriten as sum of at most $\deg f$ periodic functions.
b) Show that if a polynomial function of degree $1$ is written as sum of two periodic functions, then they are unbounded on every interval (thus, they are "wild").
c) Show that every polynomial function of degree $1$ can be written as sum of two periodic functions.
d) Show that every polynomial function $f$ can be written as sum of $\deg f+1$ periodic functions.
e) Give an example of a function that can`t be written as a finite sum of periodic functions.
[i]Dan Schwarz[/i]
2013 Serbia National Math Olympiad, 4
Determine all natural numbers $n$ for which there is a partition of $\{1,2,...,3n\}$ in $n$ pairwise disjoint subsets of the form $\{a,b,c\}$, such that numbers $b-a$ and $c-b$ are different numbers from the set $\{n-1, n, n+1\}$.
2005 USA Team Selection Test, 3
We choose random a unitary polynomial of degree $n$ and coefficients in the set $1,2,...,n!$. Prove that the probability for this polynomial to be special is between $0.71$ and $0.75$, where a polynomial $g$ is called special if for every $k>1$ in the sequence $f(1), f(2), f(3),...$ there are infinitely many numbers relatively prime with $k$.
2005 Korea - Final Round, 6
A set $P$ consists of $2005$ distinct prime numbers. Let $A$ be the set of all possible products of $1002$ elements of $P$ , and $B$ be the set of all products of $1003$ elements of $P$ . Find a one-to-one correspondance $f$ from $A$ to $B$ with the property that $a$ divides $f (a)$ for all $a \in A.$
2002 USAMO, 1
Let $S$ be a set with 2002 elements, and let $N$ be an integer with $0 \leq N \leq 2^{2002}$. Prove that it is possible to color every subset of $S$ either black or white so that the following conditions hold:
(a) the union of any two white subsets is white;
(b) the union of any two black subsets is black;
(c) there are exactly $N$ white subsets.
2014 Brazil National Olympiad, 4
The infinite sequence $P_0(x),P_1(x),P_2(x),\ldots,P_n(x),\ldots$ is defined as
\[P_0(x)=x,\quad P_n(x) = P_{n-1}(x-1)\cdot P_{n-1}(x+1),\quad n\ge 1.\]
Find the largest $k$ such that $P_{2014}(x)$ is divisible by $x^k$.
2012 Iran MO (3rd Round), 1
Suppose $0<m_1<...<m_n$ and $m_i \equiv i (\mod 2)$. Prove that the following polynomial has at most $n$ real roots. ($\forall 1\le i \le n: a_i \in \mathbb R$).
\[a_0+a_1x^{m_1}+a_2x^{m_2}+...+a_nx^{m_n}.\]
2016 Switzerland Team Selection Test, Problem 6
Prove that for every nonnegative integer $n$, the number $7^{7^{n}}+1$ is the product of at least $2n+3$ (not necessarily distinct) primes.
2011 IMC, 5
Let $F=A_0A_1...A_n$ be a convex polygon in the plane. Define for all $1 \leq k \leq n-1$ the operation $f_k$ which replaces $F$ with a new polygon $f_k(F)=A_0A_1..A_{k-1}A_k^\prime A_{k+1}...A_n$ where $A_k^\prime$ is the symmetric of $A_k$ with respect to the perpendicular bisector of $A_{k-1}A_{k+1}$. Prove that $(f_1\circ f_2 \circ f_3 \circ...\circ f_{n-1})^n(F)=F$.
2005 China Team Selection Test, 3
Let $n$ be a positive integer, and $a_j$, for $j=1,2,\ldots,n$ are complex numbers. Suppose $I$ is an arbitrary nonempty subset of $\{1,2,\ldots,n\}$, the inequality $\left|-1+ \prod_{j\in I} (1+a_j) \right| \leq \frac 12$ always holds.
Prove that $\sum_{j=1}^n |a_j| \leq 3$.
1989 Iran MO (2nd round), 3
Let $\{a_n\}_{n \geq 1}$ be a sequence in which $a_1=1$ and $a_2=2$ and
\[a_{n+1}=1+a_1a_2a_3 \cdots a_{n-1}+(a_1a_2a_3 \cdots a_{n-1} )^2 \qquad \forall n \geq 2.\]
Prove that
\[\lim_{n \to \infty} \biggl( \frac{1}{a_1}+\frac{1}{a_2}+\frac{1}{a_3}+\cdots + \frac{1}{a_n} \biggr) =2\]