This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 2

Let $n \geq 2, n \in \mathbb{N}$ and $A_0 = (a_{01},a_{02}, \ldots, a_{0n})$ be any $n-$tuple of natural numbers, such that $0 \leq a_{0i} \leq i-1,$ for $i = 1, \ldots, n.$ $n-$tuples $A_1= (a_{11},a_{12}, \ldots, a_{1n}), A_2 = (a_{21},a_{22}, \ldots, a_{2n}), \ldots$ are defined by: $a_{i+1,j} = Card \{a_{i,l}| 1 \leq l \leq j-1, a_{i,l} \geq a_{i,j}\},$ for $i \in \mathbb{N}$ and $j = 1, \ldots, n.$ Prove that there exists $k \in \mathbb{N},$ such that $A_{k+2} = A_{k}.$
A tuple of real numbers $(a_1, a_2, \dots, a_m)$ is called [i]stable [/i]if for each $k \in \{1, 2, \cdots, m-1\}$, $$ \left \vert \frac{a_1+ a_2 + \cdots + a_k}{k} - a_{k+1} \right \vert < 1. $$ Does there exist a stable $n$-tuple $(x_1, x_2, \dots, x_n)$ such that for any real number $x$, the $(n+1)$-tuple $(x, x_1, x_2, \dots, x_n)$ is not stable?