Browkin's discriminator conjecture

preprint2017arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.