Found problems: 1782
2000 All-Russian Olympiad, 5
The sequence $a_1 = 1$, $a_2, a_3, \cdots$ is defined as follows: if $a_n - 2$ is a natural number not already occurring on the board, then $a_{n+1} = a_n-2$; otherwise, $a_{n+1} = a_n + 3$. Prove that every nonzero perfect square occurs in the sequence as the previous term increased by $3$.
2014 PUMaC Algebra B, 2
$f$ is a function whose domain is the set of nonnegative integers and whose range is contained in the set of nonnegative integers. $f$ satisfies the condition that $f(f(n))+f(n)=2n+3$ for all nonnegative integers $n$. Find $f(2014)$.
1993 USAMO, 5
Let $ \, a_{0}, a_{1}, a_{2},\ldots\,$ be a sequence of positive real numbers satisfying $ \, a_{i\minus{}1}a_{i\plus{}1}\leq a_{i}^{2}\,$ for $ i \equal{} 1,2,3,\ldots\; .$ (Such a sequence is said to be [i]log concave[/i].) Show that for each $ \, n > 1,$
\[ \frac{a_{0}\plus{}\cdots\plus{}a_{n}}{n\plus{}1}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n\minus{}1}}{n\minus{}1}\geq\frac{a_{0}\plus{}\cdots\plus{}a_{n\minus{}1}}{n}\cdot\frac{a_{1}\plus{}\cdots\plus{}a_{n}}{n}.\]
2013 Turkey Team Selection Test, 1
Let $\phi(n)$ be the number of positive integers less than $n$ that are relatively prime to $n$, where $n$ is a positive integer. Find all pairs of positive integers $(m,n)$ such that \[2^n + (n-\phi(n)-1)! = n^m+1.\]
PEN O Problems, 4
The set of positive integers is partitioned into finitely many subsets. Show that some subset $S$ has the following property: for every positive integer $n$, $S$ contains infinitely many multiples of $n$.
2007 Baltic Way, 6
Freddy writes down numbers $1, 2,\ldots ,n$ in some order. Then he makes a list of all pairs $(i, j)$ such that $1\le i<j\le n$ and the $i$-th number is bigger than the $j$-th number in his permutation. After that, Freddy repeats the following action while possible: choose a pair $(i, j)$ from the current list, interchange the $i$-th and the $j$-th number in the current permutation, and delete $(i, j)$ from the list. Prove that Freddy can choose pairs in such an order that, after the process finishes, the numbers in the permutation are in ascending order.
2004 Romania Team Selection Test, 12
Let $n\geq 2$ be an integer and let $a_1,a_2,\ldots,a_n$ be real numbers. Prove that for any non-empty subset $S\subset \{1,2,3,\ldots, n\}$ we have
\[ \left( \sum_{i \in S} a_i \right)^2 \leq \sum_{1\leq i \leq j \leq n } (a_i + \cdots + a_j ) ^2 . \]
[i]Gabriel Dospinescu[/i]
1986 IMO Longlists, 49
Let $C_1, C_2$ be circles of radius $1/2$ tangent to each other and both tangent internally to a circle $C$ of radius $1$. The circles $C_1$ and $C_2$ are the first two terms of an infinite sequence of distinct circles $C_n$ defined as follows:
$C_{n+2}$ is tangent externally to $C_n$ and $C_{n+1}$ and internally to $C$. Show that the radius of each $C_n$ is the reciprocal of an integer.
2014 Contests, 2
The $100$ vertices of a prism, whose base is a $50$-gon, are labeled with numbers $1, 2, 3, \ldots, 100$ in any order. Prove that there are two vertices, which are connected by an edge of the prism, with labels differing by not more than $48$.
Note: In all the triangles the three vertices do not lie on a straight line.
1968 IMO Shortlist, 12
If $a$ and $b$ are arbitrary positive real numbers and $m$ an integer, prove that
\[\Bigr( 1+\frac ab \Bigl)^m +\Bigr( 1+\frac ba \Bigl)^m \geq 2^{m+1}.\]
2010 Mexico National Olympiad, 2
In each cell of an $n\times n$ board is a lightbulb. Initially, all of the lights are off. Each move consists of changing the state of all of the lights in a row or of all of the lights in a column (off lights are turned on and on lights are turned off).
Show that if after a certain number of moves, at least one light is on, then at this moment at least $n$ lights are on.
2012 China Team Selection Test, 1
In a simple graph $G$, we call $t$ pairwise adjacent vertices a $t$[i]-clique[/i]. If a vertex is connected with all other vertices in the graph, we call it a [i]central[/i] vertex. Given are two integers $n,k$ such that $\dfrac {3}{2} \leq \dfrac{1}{2} n < k < n$. Let $G$ be a graph on $n$ vertices such that
[b](1)[/b] $G$ does not contain a $(k+1)$-[i]clique[/i];
[b](2)[/b] if we add an arbitrary edge to $G$, that creates a $(k+1)$-[i]clique[/i].
Find the least possible number of [i]central[/i] vertices in $G$.
2022 Bulgaria JBMO TST, 4
There are $n\leq 99$ people around a circular table. At every moment everyone can either be truthful (always says the truth) or a liar (always lies). Initially some of people (possibly none) are truthful and the rest are liars. At every minute everyone answers at the same time the question "Is your left neighbour truthful or a liar?" and then becomes the same type of person as his answer. Determine the largest $n$ for which, no matter who are the truthful people in the beginning, at some point everyone will become truthful forever.
2000 CentroAmerican, 3
Let's say we have a [i]nice[/i] representation of the positive integer $ n$ if we write it as a sum of powers of 2 in such a way that there are at most two equal powers in the sum (representations differing only in the order of their summands are considered to be the same).
a) Write down the 5 nice representations of 10.
b) Find all positive integers with an even number of nice representations.
2014 Saudi Arabia IMO TST, 3
Show that it is possible to write a $n \times n$ array of non-negative numbers (not necessarily distinct) such that the sums of entries on each row and each column are pairwise distinct perfect squares.
2013 Bosnia Herzegovina Team Selection Test, 3
Prove that in the set consisting of $\binom{2n}{n}$ people we can find a group of $n+1$ people in which everyone knows everyone or noone knows noone.
2011 ELMO Shortlist, 4
In terms of $n\ge2$, find the largest constant $c$ such that for all nonnegative $a_1,a_2,\ldots,a_n$ satisfying $a_1+a_2+\cdots+a_n=n$, the following inequality holds:
\[\frac1{n+ca_1^2}+\frac1{n+ca_2^2}+\cdots+\frac1{n+ca_n^2}\le \frac{n}{n+c}.\]
[i]Calvin Deng.[/i]
2006 Cezar Ivănescu, 2
[b]a)[/b] Let be a nonnegative integer $ n. $ Solve in the complex numbers the equation $ z^n\cdot\Re z=\bar z^n\cdot\Im z. $
[b]b)[/b] Let be two complex numbers $ v,d $ satisfying $ v+1/v=d/\bar d +\bar d/d. $ Show that
$$ v^n+1/v^n=d^n/\bar d^n + \bar d^n/d^n, $$
for any nonnegative integer $ n. $
2005 QEDMO 1st, 1 (Z4)
Prove that every integer can be written as sum of $5$ third powers of integers.
2002 Polish MO Finals, 3
$k$ is a positive integer. The sequence $a_1, a_2, a_3, ...$ is defined by $a_1 = k+1$, $a_{n+1} = a_n ^2 - ka_n + k$. Show that $a_m$ and $a_n$ are coprime (for $m \not = n$).
2013 Saint Petersburg Mathematical Olympiad, 5
Let $x_1$, ... , $x_{n+1} \in [0,1] $ and $x_1=x_{n+1} $. Prove that \[ \prod_{i=1}^{n} (1-x_ix_{i+1}+x_i^2)\ge 1. \]
A. Khrabrov, F. Petrov
2010 Contests, 2
Let $\mathbb{N}_0$ and $\mathbb{Z}$ be the set of all non-negative integers and the set of all integers, respectively. Let $f:\mathbb{N}_0\rightarrow\mathbb{Z}$ be a function defined as
\[f(n)=-f\left(\left\lfloor\frac{n}{3}\right\rfloor \right)-3\left\{\frac{n}{3}\right\} \]
where $\lfloor x \rfloor$ is the greatest integer smaller than or equal to $x$ and $\{ x\}=x-\lfloor x \rfloor$. Find the smallest integer $n$ such that $f(n)=2010$.
2012 Philippine MO, 4
Let $\star$ be an operation defined in the set of nonnegative integers with the following properties: for any nonnegative integers $x$ and $y$,
(i) $(x + 1)\star 0 = (0\star x) + 1$
(ii) $0\star (y + 1) = (y\star 0) + 1$
(iii) $(x + 1)\star (y + 1) = (x\star y) + 1$.
If $123\star 456 = 789$, find $246\star 135$.
2007 Indonesia TST, 3
Find all pairs of function $ f: \mathbb{N} \rightarrow \mathbb{N}$ and polynomial with integer coefficients $ p$ such that:
(i) $ p(mn) \equal{} p(m)p(n)$ for all positive integers $ m,n > 1$ with $ \gcd(m,n) \equal{} 1$, and
(ii) $ \sum_{d|n}f(d) \equal{} p(n)$ for all positive integers $ n$.
2006 USA Team Selection Test, 4
Let $n$ be a positive integer. Find, with proof, the least positive integer $d_{n}$ which cannot be expressed in the form \[\sum_{i=1}^{n}(-1)^{a_{i}}2^{b_{i}},\]
where $a_{i}$ and $b_{i}$ are nonnegative integers for each $i.$