Consider the rabbit Fibonacci problem.
We start with one young rabbit couple. At each step, young rabbit couple grows to adult rabbits and adult rabbit couples give birth a young couple. If we denote A for an adult couple and y for a young couple, we do iteratively A$\to$Ay, y$\to$A and the sequence is :
y
A
Ay
AyA
AyAAy
AyAAyAyA
AyAAyAyAAyAAy
AyAAyAyAAyAAyAyAAyAyA
AyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAy
AyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAyA
AyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAy
AyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAAyAyAAyAyAAyAAyAyAAyAyA
Quite funnily, except for the first, y, if the $k$th couple is adult (resp. young), is will stay adult (resp. young) forever (despise the shift due to A$\to$Ay ).
For now, having this fact empirically is enough for me. My question is : is there a simple way to know whether the $k$th couple of the sequence, if it exists, is an adult couple or a young couple, without iterating back the whole sequence ?
Thank you.
Aory, it will never change, rather than that the $k$th word will always begin with the $(k-1)$th word). – Arthur Sep 25 '17 at 11:15