The Proof of a Conjecture on the Density of Sets Related to Divisibility Properties of z ( n )

: Let ( F n ) n be the sequence of Fibonacci numbers. The order of appearance (in the Fibonacci sequence) of a positive integer n is deﬁned as z ( n ) = min { k ≥ 1 : n | F k } . Very recently, Trojovská and Venkatachalam proved that, for any k ≥ 1, the number z ( n ) is divisible by 2 k , for almost all integers n ≥ 1 (in the sense of natural density). Moreover, they posed a conjecture that implies that the same is true upon replacing 2 k by any integer m ≥ 1. In this paper, in particular, we prove this conjecture.


Introduction
Let (F n ) n be the sequence of Fibonacci numbers that is defined by the second-order recurrence F n+2 = F n+1 + F n , with F i = i, for i ∈ {0, 1}. A standard application of the Pigeonhole principle yields that for any n ≥ 1, there exist infinitely many positive integers m such that n divides F m . Thus, the arithmetic function z(n) := min{k ≥ 1 : n | F k } is well-defined (see also ([1], p. 300) and [2] for the sharpest upper bound for z(n), namely, z(n) ≤ 2n). This function is known as the order of appearance in the Fibonacci sequence. The first 20 values of z(n) are (see sequence A001177 in OEIS [3]): 1, 3, 4, 6, 5, 12, 8, 6, 12, 15, 10, 12, 7, 24, 20, 12, 9, 12, 18, 30. We remark that the natural density of a set A ⊆ Z ≥1 is defined as the following limit (if it exists): x] for x ≥ 1 and #A denotes the cardinality of the set A ⊂ R. Recently, Trojovský [4] proved that {n ≥ 1 : z(n) < n} is a set with natural density that equals to 1, for all > 0, previously fixed (this generalizes the fact that lim inf n→∞ z(n)/n, see [5]).
Here, we are interested in some Diophantine properties of z(n) (this topic has been dealt with by many authors; see, for instance, [6][7][8][9][10][11][12]). For any integer m ≥ 2, we denote E Conjecture 1. For all positive integers m, there exist positive constants A m and β m < 1 such that: for all sufficiently large x. In particular, δ(E (m) z ) = 1, for all m ≥ 1.
In this paper, we confirm the Trojovská and Venkatachalam conjecture. For the sake of preciseness, we state it as a theorem. Theorem 1. Conjecture 1 is true.
Although z(n) ≤ 2n is the sharpest upper bound for the z-function (indeed, the equality holds whenever n = 6 · 5 k , k ≥ 0), Marques [5], in 2013, showed that this bound can be substantially improved depending on the number of distinct prime factors of n. By using Marques' result, in 2020, Trojovský [15] proved that as x tends to infinity, where α = (1 + √ 5)/2.
The proof of the theorem combines Diophantine properties of z(n) with analytical tools concerning the average growth rate of multiplicative functions.

Auxiliary Results
In this section, we shall present some results that will be essential tools in the proof. Throughout this work, we employ the usual Landau "Big Oh" and "Small Oh" notations O and o, respectively, as well as the associated Vinogradov symbols and . We also reserve the letter p for prime numbers.
The first ingredient is a type of "closed formula" for z(n) depending on z(p a ) for all prime factor p of n. The proof of this fact may be found in [16].
For a positive integer m, we defined P m as: In 2014, Cubre and Rouse [17] proved that #P m (x) = (ρ m + o(1))x/ log x for some positive constant ρ m , as x → ∞. Our next tool is a recent result due to Sanna [18] who improved the previous fact by providing the error term of that estimate (furthermore, Sanna dealt with the more general context of Lucas sequences). To avoid unnecessary technicalities, we shall state here a consequence of Theorem 1.1 of [18], which is enough for our purposes.
for all x > c m .
The next three auxiliary results come from the analytic number theory. The first one is the well-known Prime Number Theorem with error estimate.

Lemma 3.
Let π(x) be the prime counting function. Then: We now recall the theoretical result of Spearman and Williams [19], which is very useful for estimating the order of counting functions (here, as usual, the summatories ∑ p≤x and ∑ n≤x run over the set of prime numbers and positive integers ≤ x, respectively). Again, we shall state only the sufficient version for this work. Lemma 4 (Proposition 5.5 of [19]). Let f : Z ≥1 → R be a multiplicative function with 0 ≤ f (n) ≤ 1, for all n ∈ Z ≥1 . Suppose that there are constants τ and β with τ > 0 and as x → ∞. Then, there exists a positive computable constant E such that Our last auxiliary result is a useful formula due to Abel, which makes an interplay between a discrete (summatory) and a continuous (integral) sum.

Lemma 5.
(Abel's Summation Formula) Let (a n ) n be a sequence of real numbers and denote its partial sum A(x) := ∑ n≤x a n . For a real number x > 1, let f be a continuously differentiable function on [1, x]. Then: The proofs of Lemmas 3 and 5 can be found in any good text on analytic number theory (in particular, we refer to [20]).
We are now ready to proceed with the proof of theorems.

The Proof of Theorem 1
We start by defining F z (x), then, in order to prove (1) it suffices to show that #F (m) where P m is defined right before Lemma 2. Indeed, if p is a prime factor of n ∈ F (m) z , then (by Lemma 1), z(p) divides z(n). Thus, m z(p) (otherwise m would divide z(n) contradicting the fact that n ∈ F (m) z ) and so p ∈ P m . In particular, (3) for all x ≥ 1. Now, we need to find an upper bound for the right-hand side of (4). For that, we shall apply Lemma 4 for f : Z ≥1 → R being the characteristic function of Z ≥1 \P m , namely, Since 0 ≤ f (n) ≤ 1 and by combining Lemmas 2 and 3, we deduce the existence of real constants β m , b m ∈ (0, 1) such that Therefore, the hypotheses of Lemma 4 are fulfilled and so, by that lemma, there exists a positive constant E m such that for some constant A m > 0 and all sufficiently large x. Hence, by (4), one has E (m) for all sufficiently large x, as desired. Note that, by the previous inequality, one has and thus the natural density of E (m) z is equal to 1. The proof is then complete.

The Proof of Theorem 2
By definition, one has that n divides F z(n) and so n ≤ F z(n) < α z(n) . Thus, z(n) > log n/ log α, and therefore: for all x large enough. By integrating the previous inequality and after a straightforward calculation, we obtain that where we evaluate the (convergent) improper integral since (log ) 1−β m tends to 0 as → 1 + (because 1 − β m > 0). Now, by combining (5), (7) and (8), we arrive at as x → ∞, which finishes the proof.

Conclusions
In this paper, we proved a conjecture related to the order of appearance in the Fibonacci sequence function z : Z ≥1 → Z ≥1 , defined as z(n) := min{k ≥ 1 : n | F k }. Recently, Trojovská and Venkatachalam [14] showed that the natural density of {n ≥ 1 : z(n) ≡ 0 (mod 2 k )} is equal to 1, for any k ≥ 1 previously fixed. Furthermore, they conjectured that the same holds for the set of positive integers n for which m | z(n) (for any given integer m ≥ 1). In this work, we confirmed this conjecture: for any m ≥ 1, the natural density of the set {n ≥ 1 : z(n) ≡ 0 (mod m)} is equal to 1. Moreover, we provided a lower bound for ∑ n≤x z(n)/n, where n runs over the set {n ≥ 1 : m | z(n)}. The proofs combine arithmetical and analytic tools in number theory.
There are some natural future developments of this work, as, for example, the study of the order of appearance in related number sequences, such as generalized Fibonacci numbers and Pell-Lucas numbers might lead to interesting results as well.