On the discriminator of Lucas sequences. II
Abstract
The family of Shallit sequences consists of the Lucas sequences satisfying the recurrence Un+2(k)=(4k+2)Un+1(k) -Un(k), with initial values U0(k)=0 and U1(k)=1 and with k 1 arbitrary. For every fixed k the integers \Un(k)\n 0 are distinct, and hence for every n 1 there exists a smallest integer Dk(n), called discriminator, such that U0(k),U1(k),…,Un-1(k) are pairwise incongruent modulo Dk(n). In part I it was proved that there exists a constant nk such that Dk(n) has a simple characterization for every n nk. Here, we study the values not following this characterization and provide an upper bound for nk using Matveev's theorem and the Koksma-Erdos-Tur\'an inequality. We completely determine the discriminator Dk(n) for every n 1 and a set of integers k of natural density 68/75. We also correct an omission in the statement of Theorem 3 in part I.
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.