On Periodic Points of the Order of Appearance in the Fibonacci Sequence

: Let ( F n ) n ≥ 0 be the Fibonacci sequence. The order of appearance z ( n ) of an integer n ≥ 1 is deﬁned by z ( n ) = min { k ≥ 1 : n | F k } . Marques, and Somer and Kˇrížek proved that all ﬁxed points of the function z ( n ) have the form n = 5 k or 12 · 5 k . In this paper, we shall prove that z ( n ) does not have any k -periodic points, for k ≥ 2.


Introduction
The Fibonacci sequence (F n ) n is presumably the most classical example of a recursion sequence. This sequence is defined by the recurrence F n = F n−1 + F n−2 , for n ≥ 2, with initial terms F 0 = 0 and F 1 = 1 (see [1][2][3][4] for many surprising properties of (F n ) n and some generalizations of them, e.g., in [5][6][7][8][9]). The study of this sequence embraces a number of interesting aspects in Diophantine problems. For example, the "ingenuous" (and yet unproved) problem of the existence of infinitely many prime Fibonacci numbers is related to the powerful Zaremba's conjecture in Diophantine approximation.
We point out that the function z : Z >0 → Z >0 (known as the order of appearance in the Fibonacci sequence) plays a pivotal role in the characterization of divisibility relations involving Fibonacci numbers. This arithmetical function is defined as Table 1. Values of z(n) for n from 1 to 50. n z(n) n z(n) n z(n) n z(n) n z(n) The order of appearance in the Fibonacci sequence became an object of much interest in 1992, when Z. H. Sun and Z. W. Sun [13] found a very close connection between the equation z(n) = z(n 2 ) and Fermat's Last Theorem (which was an open problem in that time). Since z(Z >0 ) ⊆ Z >0 , one may realise the order of appearance z as a discrete dynamical system on Z >0 and ask about the periodic orbits of z for some fixed periods. Recall, that n is called a periodic point of z, if z k (n) = n, for some k ≥ 0 (Here z j is the jth iterate of z). The smallest positive integer k with this property is defined as the period of n (under z) and n is named as a k-period point of z (i.e., if z k (n) = n and z j (n) = n, for all j ∈ [1, k − 1]. Here, we utilize the usual notation [a, b] = {a, a + 1, . . . , b}, for integers a < b). For k = 1, a 1-periodic point is usually denoted as a fixed point.
Marques [14] and Somer and Křížek [15] (independently) found all fixed points of z(n). More precisely, they proved that z(n) = n if and only if n = 5 k or 12 · 5 k , for k ≥ 0.
Recently, two extensions of this result were proved. The first one by Trojovský [16] (who dealt with the equation z(n) = n + , for ∈ [− 9,9]) and another by Trojovská [17] (who studied the behavior of z(n) "near" its sharpest upper bound, i.e., solutions of the Diophantine equation z(n) = 2n − n/k, where n, k are any positive integers). We refer the reader to these two papers (and references therein) to more problems involving the z-function.
A positive integer n is called a pre-periodic point (of z) if z k (n) is a periodic point. In other words, n is pre-periodic if its orbit Orb z (n) under the order of appearance z (i.e., Orb z (n) := {z k (n) : k ≥ 0}) is finite.  With the help of Wolfram Mathematica we searched the lengths of orbits Orb z (n) for every n from 1 to 50,000. This experiment showed that the maximal length of the orbit was 10 and Table 2 summarizes how many times each length of the orbit from 1 to 10 was realized (we have included their percentage distribution in the last row). Table 2. Total number of n's from 1 to 50,000, which have the same value of #Orb z (n) = k. Color of points in Figure 1 red  3 show graphically the relationship between n, z(n) and the length of the orbit #Orb z (n) for each natural number less than or equal to 50,000. In Figure 1 we have drawn the points of the coordinates [n, z(n)] and to show the corresponding length of orbits we have colored these points by the colors listed in Table 2, e.g., the red color corresponds to the length of the orbit equal to 1 (i.e., they are fixed points). In Figure 3 we plotted an analogous graph to Figure 1, but we used a 3D-graph to plot a set of all points of coordinates [n, z(n), Orb z (n)], for n from 1 to 50,000.

Remark 1.
We now turn to a brief discussion of another concept which can be helpful to the understanding of the special points (periodic and pre-periodic) in discrete dynamics. A sequence (a n ) n≥0 is called periodic if it satisfies a n+p = a n , for all n ≥ 0 (for a smallest integer p > 0 which is known as the period of the sequence). A sequence (a n ) n≥0 is called eventually periodic if it can be made periodic by deleting some finite number of terms from the beginning, i.e., if (a n ) n≥n 0 is periodic, for an n 0 ≥ 0. Let us denote by P and P e the sets of the periodic and eventually periodic sequences, respectively (clearly, P e ⊆ P). Since the orbit of a point (as a multiset) may be identified as an infinite sequence, then we can say that n is a periodic point (resp., pre-periodic point) if and only if Orb z (n) ∈ P (resp., Orb z (n) ∈ P e ).
Actually, Luca and Tron [18] (see the proof of their Theorem 2.2) proved that every positive integer is a pre-periodic point of z. Actually, they proved that for any positive integer n, there exists a k ≥ 1, such that z k (n) is a fixed point of z. Another proof for this fact is the following: if π(n) is the Pisano period of n (π(n) is the smallest period of the Fibonacci sequence modulo n), then π(n)/z(n) ∈ {1, 2, 4} (see Theorem 7 of [19]) and so, π k (n)/z k (n) ∈ {2, 24}, if n > 1 and k ≥ 4. Thus, by Iteration Theorem of [20], there exists an integer k ≥ 4, such that π k (n) > 1 is a fixed point of π, i.e., π k (n) = 24 · 5 a , for some a ≥ 0 (see Fixed Point Theorem] of [20]). Since π k (n)/z k (n) ∈ {2, 24}, then z k (n) is either 5 a or 12 · 5 a , as desired.
Since all pre-periodic points of z close their orbit in a fixed point, the following question arises: has the function z(n) some k-periodic point, for k > 1?
In this paper, we shall completely answer this question by proving that Theorem 1. All periodic points of z are fixed points. In other words, if z k (n) = n, for some k ≥ 1, then z(n) = n.

Remark 2.
We remark that the sets P and P e can be written as P = p≥1 P(p) and P e = p≥1 P e (p), where P(p) and P e (p) denote, respectively, the sets of the periodic and eventually periodic sequences with period exactly p. Now, observe that (according to Remark 1) Luca and Tron result (in [18]) can be rephrased as: if Orb z (n) ∈ P e , then Orb z (n) ∈ P e (1). However, Theorem 1 is equivalent to the fact that: if Orb z (n) ∈ P, then Orb z (n) ∈ P(1).
In brief outline, the main idea of the proof is to use a variant of the fact that z(lcm(m, n)) = lcm(z(m), z(n)) (where lcm(·) denotes the least common multiple) together with some properties of z(p k ) (for a prime p). Mathematica software was very useful when performing some calculations (for remaining cases).

Auxiliary Results
In this section, we shall present two results which will be very important tools in our proofs. Firstly, we have to recall that the p-adic valuation (the exponent of the highest power of a prime number p which divides n is called the p-adic order of n and it is denoted by ν p (n), thus ν p (n) = max{s ≥ 0 : p s | n}) of Fibonacci numbers was fully characterized by Halton [21] and Lengyel [22] (see generalizations and applications in [23][24][25]).
The first essential ingredients are related to the behavior of z(n) at prime powers arguments.
We point out the Wall's conjecture which states that z(p a ) = p a−1 z(p), when p > 2 is a prime and a a positive integer (see [27]).
The second tool is a kind of "formula" for z(n) depending on z(p a ) for all primes p dividing n. The proof of this fact can be found in [28]. Now we are ready to deal with the proof of the theorem.
Since for n = 2 and n = 3, the orbits do not return to 2 or 3, we can consider only integers in the set A\{2, 3}. For such an integer, we have that z j (n) is a fixed point, for all j ≥ 3 (by using some simple Mathematica routine). So, we can consider only k = 2. However, z 2 (n) = n, for n ∈ A\{2, 3}, only if n = 1 or 12 which are fixed points. Thus, we may suppose that a ≥ 6 and b ≥ 3. In this case, we have, by Lemmas 1 and 2, z(n) = lcm(z(2 a ), z(3 b )) = lcm(3 · 2 a−2 , 4 · 3 b−1 ) = 2 a−2 · 3 b−1 and so where we used that a ≥ 6 and b ≥ 3. Note that if we proceed with this chain, we will have that ν 2 (z j (n)) will decrease, by Lemma 1 (ii), (in the form a − 2 ) if a is large. However, since z k (n) = n, then, in particular, it holds that ν 2 (z k (n)) = ν 2 (n) = a. So, we must have a ∈ [0, 5]. The same is valid for b (by using ν 3 ) and so b ∈ [0, 2] which contradicts our assumption on a and b (i.e., a ≥ 6 and b ≥ 3).
If k = 1, then, by (2), we have that p k | (p k − δ k ) and so p k | δ k ∈ {−1, 0, 1}. This implies that 0 = δ k = ( 5 p k ) which, by definition of the Legendre symbol, yields that p k | 5 and then p k = 5. For the case in which k > 1, we have (since p k > 3) that p k > p i + 1 ≥ p i − δ i (for all i ∈ [1, k − 1]) and again, by the relation in (2), we infer that p k divides p k − δ k and so p k = 5 (as previously deduced).
In conclusion, the largest prime factor of n is 5. Therefore, we can write n = 2 a · 3 b · 5 c . Let us suppose that a ≥ 6 and b ≥ 3. Then, by Lemmas 1 and 2, we have where we used that a ≥ 6 and b ≥ 3. Observe that as before, by continuing this process, we will infer that ν 2 (z j (n)) decreases, by Lemma 1 (ii), for large values of a. Since z k (n) = n, then ν 2 (z k (n)) = ν 2 (n) = a which yields that a ∈ [0, 5]. This also holds for b (again by applying ν 3 ). So, the possible solutions are in the range a ∈ [0, 5] and b ∈ [0, 2]. Hence, the possible k-periodic points must belong to the set {2 a · 3 b · 5 c : a ∈ [0, 5], b ∈ [0, 2], c ≥ 0}.
Since we are interested in iterations of z and z(5 c ) = 5 c (for all c ≥ 0), then it is enough to search for periodic points of z belonging to A\{2, 3} and after, multiply them by 5 c . In this case, the proof proceeds along the same lines as in the previous case. That is, only 1 and 12 are invariant. Now, by multiplying them by 5 c , we obtain that n = 5 c or 12 · 5 c (that is, the fixed points of z). This completes the proof of Theorem 1.

Conclusions
In this paper, we study the dynamics of the order of appearance function z(n) = min{k ≥ 1 : n | F k }. It is known that the orbit (under z) of all positive integer is finite. A recent result classifies all orbits with length 1 (loops), i.e., fixed points of z(n). Namely, all the numbers with this property are of the form 5 k or 12 · 5 k , for some integer k ≥ 0. Thus, in this work, we study the existence of positive integers with larger closed orbits (i.e., k-periodic points of z, for k > 1). In particular, we close the problem of the arithmetic dynamics of z, by proving that if z k (n) = n, for some positive integers n and k (where z k is the kth iteration of z), then z(n) = n. In particular, the function z does not admit k-periodic points, for all k > 1.