Primes Having an Incomplete System of Residues for a Class of Second-Order Recurrences

@inproceedings{Somer1988PrimesHA,
  title={Primes Having an Incomplete System of Residues for a Class of Second-Order Recurrences},
  author={L. Somer},
  year={1988}
}
Shah [4] and Bruckner [1] showed that if p is a prime and p > 7, then the Fibonacci sequence {Fn} has an incomplete system of residues modulo p. Shah established this result for the cases in which p = 1, 9, 11, or 19 modulo 20, while Bruckner proved the result true for the re ma ini n g c ases in which p = 3 or 7 modulo 10. Burr [2] extended these results by dete rmining all the positive integers m for which the Fibonacci sequence has an incomplete system of residues modulo m. 
DISTRIBUTION OF TWO-TERM RECURRENCE SEQUENCES MOD P
Sums of primes and quadratic linear recurrence sequences
Nondefective Integers With Respect to Certain Lucas Sequences of the Second Kind
Complete Generalized Fibonacci Sequences Modulo Primes.
Three term recurrence and residue completeness
...
1
2
...