Quadratic sequences with prime power discriminators

Abstract

The discriminator of an integer sequence s = (s(i))i ≥ 0, introduced by Arnold, Benkoski, and McCabe in 1985, is the function Ds (n) that sends n to the least integer m such that the numbers s(0), s(1), …, s(n - 1) are pairwise incongruent modulo m. In this note, we try to determine all quadratic sequences whose discriminator is given by p p n for prime p, i.e., the smallest power of p which is ≥ n. We determine all such sequences for p = 2, show that there are none for p ≥ 5, and provide some partial results for p = 3.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…