Complete Generalized Fibonacci Sequences Modulo Primes
Abstract
We study generalized Fibonacci sequences Fn+1=PFn-QFn-1 with initial values F0=0 and F1=1. Let P,Q be nonzero integers such that P2-4Q is not a perfect square. We show that if Q= 1 then the sequence \Fn\n=0∞ misses a congruence class modulo every prime large enough. On the other hand, if Q ≠ 1, we prove that (under GRH) the sequence \Fn\n=0∞ hits every congruence class modulo infinitely many primes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.