Abstract
Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk≡0(modn). In this paper, we shall find all positive solutions of the Diophantine equation z(φ(n))=n, where φ is the Euler totient function.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference15 articles.
1. The Fibonacci numbers–Exposed more discretely;Benjamin;Math. Mag.,2003
2. The Fibonacci Numbers–Exposed;Kalman;Math. Mag.,2003
3. Fibonacci and Lucas Numbers with Applications;Koshy,2001
4. The On-Line Encyclopedia of Integer Sequenceshttps://oeis.org/
5. On Diophantine Equations Related to Order of Appearance in Fibonacci Sequence