Found problems: 34
PEN M Problems, 18
Given is an integer sequence $\{a_n\}_{n \ge 0}$ such that $a_{0}=2$, $a_{1}=3$ and, for all positive integers $n \ge 1$, $a_{n+1}=2a_{n-1}$ or $a_{n+1}= 3a_{n} - 2a_{n-1}$. Does there exist a positive integer $k$ such that $1600 < a_{k} < 2000$?
PEN M Problems, 17
A sequence of integers, $\{a_{n}\}_{n \ge 1}$ with $a_{1}>0$, is defined by \[a_{n+1}=\frac{a_{n}}{2}\;\;\; \text{if}\;\; n \equiv 0 \;\; \pmod{4},\] \[a_{n+1}=3 a_{n}+1 \;\;\; \text{if}\;\; n \equiv 1 \; \pmod{4},\] \[a_{n+1}=2 a_{n}-1 \;\;\; \text{if}\;\; n \equiv 2 \; \pmod{4},\] \[a_{n+1}=\frac{a_{n}+1}{4}\;\;\; \text{if}\;\; n \equiv 3 \; \pmod{4}.\] Prove that there is an integer $m$ such that $a_{m}=1$.
PEN M Problems, 7
Prove that the sequence $ \{y_{n}\}_{n \ge 1}$ defined by
\[ y_{0}=1, \; y_{n+1}= \frac{1}{2}\left( 3y_{n}+\sqrt{5y_{n}^{2}-4}\right) \]
consists only of integers.
PEN M Problems, 13
The sequence $\{x_{n}\}$ is defined by \[x_{0}\in [0, 1], \; x_{n+1}=1-\vert 1-2 x_{n}\vert.\] Prove that the sequence is periodic if and only if $x_{0}$ is irrational.
PEN M Problems, 31
Each term of an infinite sequence of natural numbers is obtained from the previous term by adding to it one of its nonzero digits. Prove that this sequence contains an even number.
PEN M Problems, 6
The sequence $\{a_{n}\}_{n \ge 1}$ is defined by \[a_{1}=1, \; a_{n+1}=2a_{n}+\sqrt{3a_{n}^{2}+1}.\] Show that $a_{n}$ is an integer for every $n$.
PEN M Problems, 10
An integer sequence satisfies $a_{n+1}={a_n}^3 +1999$. Show that it contains at most one square.
PEN M Problems, 35
The first four terms of an infinite sequence $S$ of decimal digits are $1$, $9$, $8$, $2$, and succeeding terms are given by the final digit in the sum of the four immediately preceding terms. Thus $S$ begins $1$, $9$, $8$, $2$, $0$, $9$, $9$, $0$, $8$, $6$, $3$, $7$, $4$, $\cdots$. Do the digits $3$, $0$, $4$, $4$ ever come up consecutively in $S$?
PEN M Problems, 24
Let $k$ be a given positive integer. The sequence $x_n$ is defined as follows: $x_1 =1$ and $x_{n+1}$ is the least positive integer which is not in $\{x_{1}, x_{2},..., x_{n}, x_{1}+k, x_{2}+2k,..., x_{n}+nk \}$. Show that there exist real number $a$ such that $x_n = \lfloor an\rfloor$ for all positive integer $n$.