On the discriminator of Lucas sequences
Abstract
We consider the family of Lucas sequences uniquely determined by Un+2(k)=(4k+2)Un+1(k) -Un(k), with initial values U0(k)=0 and U1(k)=1 and k 1 an arbitrary integer. For any integer n 1 the discriminator function Dk(n) of Un(k) is defined as the smallest integer m such that U0(k),U1(k),…,Un-1(k) are pairwise incongruent modulo m. Numerical work of Shallit on Dk(n) suggests that it has a relatively simple characterization. In this paper we will prove that this is indeed the case by showing that for every k 1 there is a constant nk such that Dk(n) has a simple characterization for every n nk. The case k=1 turns out to be fundamentally different from the case k>1.
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.