Found problems: 1782
2013 Vietnam National Olympiad, 4
Write down some numbers $a_1,a_2,\ldots, a_n$ from left to right on a line. Step 1, we write $a_1+a_2$ between $a_1,a_2$; $a_2+a_3$ between $a_2,a_3$, …, $a_{n-1}+a_n$ between $a_{n-1},a_n$, and then we have new sequence $b=(a_1, a_1+a_2,a_2,a_2+a_3,a_3, \ldots, a_{n-1}, a_{n-1}+a_n, a_n)$. Step 2, we do the same thing with sequence b to have the new sequence c again…. And so on. If we do 2013 steps, count the number of the number 2013 appear on the line if
a) $n=2$, $a_1=1, a_2=1000$
b) $n=1000$, $a_i=i, i=1,2\ldots, 1000$
Sorry for my bad English
[color=#008000]Moderator says: alternate phrasing here: https://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=516134[/color]
TNO 2008 Senior, 9
Let $f: \mathbb{N} \to \mathbb{N}$ be a function that satisfies:
\[
f(1) = 2008,
\]
\[
f(4n^2) = 4f(n^2),
\]
\[
f(4n^2 + 2) = 4f(n^2) + 3,
\]
\[
f(4n(n+1)) = 4f(n(n+1)) + 1,
\]
\[
f(4n(n+1) + 3) = 4f(n(n+1)) + 4.
\]
Determine whether there exists a natural number $m$ such that:
\[
1^2 + 2^2 + \dots + m^2 + f(1^2) + \dots + f(m^2) = 2008m + 251.
\]
2009 Putnam, B6
Prove that for every positive integer $ n,$ there is a sequence of integers $ a_0,a_1,\dots,a_{2009}$ with $ a_0\equal{}0$ and $ a_{2009}\equal{}n$ such that each term after $ a_0$ is either an earlier term plus $ 2^k$ for some nonnnegative integer $ k,$ or of the form $ b\mod{c}$ for some earlier positive terms $ b$ and $ c.$ [Here $ b\mod{c}$ denotes the remainder when $ b$ is divided by $ c,$ so $ 0\le(b\mod{c})<c.$]
2017 Baltic Way, 1
Let $a_0,a_1,a_2,...$ be an infinite sequence of real numbers satisfying $\frac{a_{n-1}+a_{n+1}}{2}\geq a_n$ for all positive integers $n$. Show that $$\frac{a_0+a_{n+1}}{2}\geq \frac{a_1+a_2+...+a_n}{n}$$ holds for all positive integers $n$.
1981 Miklós Schweitzer, 7
Let $ U$ be a real normed space such that, for an finite-dimensional, real normed space $ X,U$ contains a subspace isometrically isomorphic to $ X$. Prove that every (not necessarily closed) subspace $ V$ of $ U$ of finite codimension has the same property. (We call $ V$ of finite codimension if there exists a finite-dimensional subspace $ N$ of $ U$ such that $ V\plus{}N\equal{}U$.)
[i]A. Bosznay[/i]
2012 ELMO Shortlist, 9
Let $a,b,c$ be distinct positive real numbers, and let $k$ be a positive integer greater than $3$. Show that
\[\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c)\]
and
\[\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).\]
[i]Calvin Deng.[/i]
2012 ELMO Problems, 4
Let $a_0,b_0$ be positive integers, and define $a_{i+1}=a_i+\lfloor\sqrt{b_i}\rfloor$ and $b_{i+1}=b_i+\lfloor\sqrt{a_i}\rfloor$ for all $i\ge0$. Show that there exists a positive integer $n$ such that $a_n=b_n$.
[i]David Yang.[/i]
1995 Niels Henrik Abels Math Contest (Norwegian Math Olympiad) Round 2, 5
Let $ f(x) \equal{} \frac{x}{1 \minus{} x}$ and let $ a$ be a real number. If $ x_0 \equal{} a, x_1 \equal{} f(x_0), x_2 \equal{} f(x_1), ...., x_{1996} \equal{} f(x_{1995})$ and $ x_{1996} \equal{} 1,$ what is $ a$?
A. 0
B. 1/1997
C. 1995
D. 1995/1996
E. None of these
2002 All-Russian Olympiad, 2
We are given one red and $k>1$ blue cells, and a pack of $2n$ cards, enumerated by the numbers from $1$ to $2n$. Initially, the pack is situated on the red cell and arranged in an arbitrary order. In each move, we are allowed to take the top card from one of the cells and place it either onto the top of another cell on which the number on the top card is greater by $1$, or onto an empty cell. Given $k$, what is the maximal $n$ for which it is always possible to move all the cards onto a blue cell?
2012 Puerto Rico Team Selection Test, 7
Let $f$ be a function with the following properties:
1) $f(n)$ is defined for every positive integer $n$;
2) $f(n)$ is an integer;
3) $f(2)=2$;
4) $f(mn)=f(m)f(n)$ for all $m$ and $n$;
5) $f(m)>f(n)$ whenever $m>n$.
Prove that $f(n)=n$.
2020 Malaysia IMONST 2, 6
Consider the following one-person game: A player starts with score $0$ and writes the number $20$ on an
empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers
(call them $b$ and $c$) such that $b + c = a$. The player then adds $b\times c$ to her score. She repeats the step
several times until she ends up with all $1$'s on the whiteboard. Then the game is over, and the final score is
calculated. Let $M, m$ be the maximum and minimum final score that can be possibly obtained respectively.
Find $M-m$.
PEN G Problems, 30
Let $\alpha=0.d_{1}d_{2}d_{3} \cdots$ be a decimal representation of a real number between $0$ and $1$. Let $r$ be a real number with $\vert r \vert<1$. [list=a][*] If $\alpha$ and $r$ are rational, must $\sum_{i=1}^{\infty} d_{i}r^{i}$ be rational? [*] If $\sum_{i=1}^{\infty} d_{i}r^{i}$ and $r$ are rational, $\alpha$ must be rational? [/list]
1996 China Team Selection Test, 2
$S$ is the set of functions $f:\mathbb{N} \to \mathbb{R}$ that satisfy the following conditions:
[b]I.[/b] $f(1) = 2$
[b]II.[/b] $f(n+1) \geq f(n) \geq \frac{n}{n + 1} f(2n)$ for $n = 1, 2, \ldots$
Find the smallest $M \in \mathbb{N}$ such that for any $f \in S$ and any $n \in \mathbb{N}, f(n) < M$.
PEN K Problems, 22
Find all functions $f:\mathbb{Q}^{+} \to \mathbb{Q}^{+}$ such that for all $x\in \mathbb{Q}^+$: [list] [*] $f(x+1)=f(x)+1$, [*] $f(x^2)=f(x)^2$. [/list]
2001 Romania Team Selection Test, 3
Find the least $n\in N$ such that among any $n$ rays in space sharing a common origin there exist two which form an acute angle.
1995 All-Russian Olympiad Regional Round, 11.4
there are some identical squares with sides parallel, in a plane. Among any $k+1$ of them, there are two with a point in common. Prove they can be divided into $2k-1$ sets, such that all the squares in one set aint pairwise disjoint.
2008 Bulgaria Team Selection Test, 1
Let $n$ be a positive integer. There is a pawn in one of the cells of an $n\times n$ table. The pawn moves from an arbitrary cell of the $k$th column, $k \in \{1,2, \cdots, n \}$, to an arbitrary cell in the $k$th row. Prove that there exists a sequence of $n^{2}$ moves such that the pawn goes through every cell of the table and finishes in the starting cell.
1991 India National Olympiad, 6
(i) Determine the set of all positive integers $n$ for which $3^{n+1}$ divides $2^{3^n} + 1$;
(ii) Prove that $3^{n+2}$ does not divide $2^{3^n} + 1$ for any positive integer $n$.
1992 Polish MO Finals, 1
The functions $f_0, f_1, f_2, ...$ are defined on the reals by $f_0(x) = 8$ for all $x$, $f_{n+1}(x) = \sqrt{x^2 + 6f_n(x)}$. For all $n$ solve the equation $f_n(x) = 2x$.
2020 Peru IMO TST, 5
You are given a set of $n$ blocks, each weighing at least $1$; their total weight is $2n$. Prove that for every real number $r$ with $0 \leq r \leq 2n-2$ you can choose a subset of the blocks whose total weight is at least $r$ but at most $r + 2$.
2008 IMAR Test, 1
An array $ n\times n$ is given, consisting of $ n^2$ unit squares. A [i]pawn[/i] is placed arbitrarily on a unit square. The pawn can move from a square of the $ k$-th column to any square of the $ k$-th row. Show that there exists a sequence of $ n^2$ moves of the pawn so that all the unit squares of the array are visited once, the pawn returning to its original position.
[b]Dinu Serbanescu[/b]
2010 Argentina Team Selection Test, 6
Suppose $a_1, a_2, ..., a_r$ are integers with $a_i \geq 2$ for all $i$ such that $a_1 + a_2 + ... + a_r = 2010$.
Prove that the set $\{1,2,3,...,2010\}$ can be partitioned in $r$ subsets $A_1, A_2, ..., A_r$ each with $a_1, a_2, ..., a_r$ elements respectively, such that the sum of the numbers on each subset is divisible by $2011$.
Decide whether this property still holds if we replace $2010$ by $2011$ and $2011$ by $2012$ (that is, if the set to be partitioned is $\{1,2,3,...,2011\}$).
1992 Hungary-Israel Binational, 4
We examine the following two sequences: The Fibonacci sequence: $F_{0}= 0, F_{1}= 1, F_{n}= F_{n-1}+F_{n-2 }$ for $n \geq 2$; The Lucas sequence: $L_{0}= 2, L_{1}= 1, L_{n}= L_{n-1}+L_{n-2}$ for $n \geq 2$. It is known that for all $n \geq 0$ \[F_{n}=\frac{\alpha^{n}-\beta^{n}}{\sqrt{5}},L_{n}=\alpha^{n}+\beta^{n},\] where $\alpha=\frac{1+\sqrt{5}}{2},\beta=\frac{1-\sqrt{5}}{2}$. These formulae can be used without proof.
Prove that $F_{n-1}F_{n}F_{n+1}L_{n-1}L_{n}L_{n+1}(n \geq 2)$ is not a perfect square.
2005 Vietnam National Olympiad, 3
Let $\{x_n\}$ be a real sequence defined by:
\[x_1=a,x_{n+1}=3x_n^3-7x_n^2+5x_n\]
For all $n=1,2,3...$ and a is a real number.
Find all $a$ such that $\{x_n\}$ has finite limit when $n\to +\infty$ and find the finite limit in that cases.
2003 All-Russian Olympiad, 4
Ana and Bora are each given a sufficiently long paper strip, one with letter $A$ written , and the other with letter $B$. Every minute, one of them (not necessarily one after another) writes either on the left or on the right to the word on his/her strip the word written on the other strip. Prove that the day after, one will be able to cut word on Ana's strip into two words and exchange their places, obtaining a palindromic word.