Question 90
Suppose $(a_n)$ is a sequence of integers such that $a_1$ and $a_2$ are two distinct digits of the number $2014$, and $a_n = a_{n-1}^{10} + a_{n-2}^{10}$ for all $n \gt 2$.
Let $m = 20142014\ldots2014$ be the number given by the string $2014$ repeated $2014$ times. Show that $m$ cannot be $a_n$ for any positive integer $n$.
Let $m = 20142014\ldots2014$ be the number given by the string $2014$ repeated $2014$ times. Show that $m$ cannot be $a_n$ for any positive integer $n$.