Three term recurrence and residue completeness

2013/07/29 by Lang, Cheng Lien, Lang, Mong Lung
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1307.7463

Abstract

We study the three term recurrence modulo m. In particular, we prove that Pell numbers modulo m is residue complete if and only m is 2, a power of 3, or a power of 5. Pell-Lucas numbers modulo m is residue complete if and only if m is a power of 3.

Related

• Fibonacci system and residue completeness
• A method for deterining the mod-3^k behaviour of recursive sequences
• Pell and Pell-Lucas numbers as sums of three repdigits
• Residues of Terms of Lucas Sequences Modulo 3^k
• Divisors and specializations of Lucas polynomials