On the local behavior of the order of appearance in the Fibonacci sequence
Authors:
- 21 May 2014
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Number Theory
- Vol. 10 (04) , 915-933
Abstract
Let z(N) be the order of appearance of N in the Fibonacci sequence. This is the smallest positive integer k such that N divides the k th Fibonacci number. We show that each of the six total possible orderings among z(N), z(N + 1), z(N + 2) appears infinitely often. We also show that for each nonzero even integer c and many odd integers c the equation z(N) = z(N + c) has infinitely many solutions N, but the set of solutions has asymptotic density zero. The proofs use a result of Corvaja and Zannier on the height of a rational function at 𝒮-unit points as well as sieve methods.Keywords
This publication has 7 references indexed in Scilit:
- The Order of Appearance of Integers at Most One Away From Fibonacci NumbersThe Fibonacci Quarterly, 2012
- On Integer Numbers with Locally Smallest Order of Appearance in the Fibonacci SequenceInternational Journal of Mathematics and Mathematical Sciences, 2011
- THE FIBONACCI-NORM OF A POSITIVE INTEGER: OBSERVATIONS AND CONJECTURESInternational Journal of Number Theory, 2010
- A Lower Bound for the Height of a Rational Function at S-unit PointsMonatshefte für Mathematik, 2004
- On the solutions to φ(n) = φ(n + k)1999
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- On the Numerical Factors of the Arithmetic Forms α n ± β nAnnals of Mathematics, 1913