Browkin's discriminator conjecture
Abstract
Let be a prime and put . We consider the integer sequence with . No term in this sequence is repeated and thus for each there is a smallest integer such that are pairwise incongruent modulo . We write . The idea of considering the discriminator is due to Browkin (2015) who, in case is a primitive root modulo conjectured that the only values assumed by are powers of and of . We show that this is true for , but false for infinitely many in case . We also determine in case 3 is not a primitive root modulo . Browkin's inspiration for his conjecture came from earlier work of Moree and Zumalac\'arregui (2016), who determined for , thus establishing a conjecture of Salajan. For a fixed prime their approach is easily generalized, but requires some innovations in order to deal with all primes and all . Interestingly enough, Fermat and Mirimanoff primes play a special role in this.
Keywords
Cite
@article{arxiv.1707.02183,
title = {Browkin's discriminator conjecture},
author = {Alexandru Ciolan and Pieter Moree},
journal= {arXiv preprint arXiv:1707.02183},
year = {2020}
}
Comments
26 pages, 8 tables. The paper builds on an earlier paper [arXiv:1504.05718] by Moree and Zumalacarregui and for the convenience of the reader we give the complete proofs and logically this results in a considerable amount of text overlap with that paper. In the commentary in each section, we elaborate on what is similar and what is new