Browkin's discriminator conjecture

Abstract

Let q 5 be a prime and put q*=(-1)(q-1)/2· q. We consider the integer sequence uq(1),uq(2),…, with uq(j)=(3j-q*(-1)j)/4. No term in this sequence is repeated and thus for each n there is a smallest integer m such that uq(1),…,uq(n) are pairwise incongruent modulo m. We write Dq(n)=m. The idea of considering the discriminator Dq(n) is due to Browkin (2015) who, in case 3 is a primitive root modulo q, conjectured that the only values assumed by Dq(n) are powers of 2 and of q. We show that this is true for n≠ 5, but false for infinitely many q in case n=5. We also determine Dq(n) in case 3 is not a primitive root modulo q. Browkin's inspiration for his conjecture came from earlier work of Moree and Zumalac\'arregui (2016), who determined D5(n) for n 1, thus establishing a conjecture of Salajan. For a fixed prime q their approach is easily generalized, but requires some innovations in order to deal with all primes q 7 and all n 1. Interestingly enough, Fermat and Mirimanoff primes play a special role in this.

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…