English

Complete Generalized Fibonacci Sequences Modulo Primes

Number Theory 2020-02-26 v1

Abstract

We study generalized Fibonacci sequences Fn+1=PFnQFn1F_{n+1}=PF_n-QF_{n-1} with initial values F0=0F_0=0 and F1=1F_1=1. Let P,QP,Q be nonzero integers such that P24QP^2-4Q is not a perfect square. We show that if Q=±1Q=\pm 1 then the sequence {Fn}n=0\{F_n\}_{n=0}^\infty misses a congruence class modulo every prime large enough. On the other hand, if Q±1Q \neq \pm 1, we prove that (under GRH) the sequence {Fn}n=0\{F_n\}_{n=0}^\infty hits every congruence class modulo infinitely many primes.

Keywords

Cite

@article{arxiv.1812.01048,
  title  = {Complete Generalized Fibonacci Sequences Modulo Primes},
  author = {Mohammad Javaheri and Nikolai Krylov},
  journal= {arXiv preprint arXiv:1812.01048},
  year   = {2020}
}

Comments

13 pages

R2 v1 2026-06-23T06:30:04.558Z