On the number of residues of certain second-order linear recurrences
Abstract
For every monic polynomial f ∈ Z[X] with deg(f) ≥ 1, let L(f) be the set of all linear recurrences with values in Z and characteristic polynomial f, and let equation* R(f) := \(x; m) : x ∈ L(f), \, m ∈ Z+ \ , equation* where (x; m) is the number of distinct residues of x modulo m. Dubickas and Novikas proved that R(X2 - X - 1) = Z+. We generalize this result by showing that R(X2 - a1 X - 1) = Z+ for every nonzero integer a1. As a corollary, we deduce that for all integers a1 ≥ 1 and k ≥ 4 there exists ∈ R such that the sequence of fractional parts (\!frac( αn))n ≥ 0, where α := (a1 + a12 + 4\,) / 2, has exactly k limit points. Our proofs are constructive and employ some results on the existence of special primitive divisors of certain Lehmer sequences.
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.