On Two Problems Related to Divisibility Properties of z(n)

Abstract

The order of appearance (in the Fibonacci sequence) function z: Z≥1 → Z≥1 is an arithmetic function defined for a positive integer n as z(n) = min{k ≥ 1: Fk ≡ 0 (mod n)}. A topic of great interest is to study the Diophantine properties of this function. In 1992, Sun and Sun showed that Fermat’s Last Theorem is related to the solubility of the functional equation z(n) = z(n2 ), where n is a prime number. In addition, in 2014, Luca and Pomerance proved that z(n) = z(n + 1) has infinitely many solutions. In this paper, we provide some results related to these facts. In particular, we prove that (Formula Presented), for all ɛ ∈ (0, 2).