Complete generalized Fibonacci sequences modulo primes

Abstract: We study generalized Fibonacci sequences

F_{n + 1} = P F_{n} - Q F_{n - 1}

with initial values

F_{0} = 0

and

F_{1} = 1

. Let

P, Q

be nonzero integers such that

P^{2} - 4 Q

is not a perfect square. We show that if

Q = p m 1

then the sequence

{F_{n}}_{n = 0}^{i} n f t y

misses a congruence class modulo every prime large enough. On the other hand, if

Q e q p m 1

, we prove that (under GRH) the sequence

{F_{n}}_{n = 0}^{i} n f t y

hits every congruence class modulo infinitely many primes.

Recommendations

Cites Work

Cited In (7)

This page was built for publication: Complete generalized Fibonacci sequences modulo primes