MathLabs

Problem 1

For each integer a0>1a_0>1, define the sequence a0,a1,a2,…a_0,a_1,a_2,\ldots for n≥0n\ge 0 by an+1={anif an is an integer,an+3otherwise.a_{n+1}=\begin{cases}\sqrt{a_n} & \text{if }\sqrt{a_n}\text{ is an integer},\\ a_n+3 & \text{otherwise}.\end{cases} Determine all values of a0a_0 for which there exists a number AA such that an=Aa_n=A for infinitely many values of nn.
Step 1 of 5: Determinism reduces the problem to boundedness
In plain words

The next term depends only on the current one, so a repeated value must repeat forever.

an+1=Φ(an)a_{n+1}=\Phi(a_n)
Detailed analysis

Since an+1a_{n+1} is completely determined by ana_n alone via a fixed function Φ\Phi (either an\sqrt{a_n} or an+3a_n+3), if two terms ever coincide, say ai=aja_i=a_j with i<ji<j, then ai+k=aj+ka_{i+k}=a_{j+k} for every k≥0k\ge 0: the sequence becomes exactly periodic with period j−ij-i from index ii onward, so aia_i recurs infinitely often. Conversely, if some number recurs infinitely often, two of the indices where it occurs give ai=aja_i=a_j with i<ji<j, which by the same reasoning forces periodicity, so the sequence takes only finitely many values, i.e. it is bounded. Hence some AA occurs infinitely often if and only if the sequence (an)(a_n) is bounded.