Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T10:51:35.318Z Has data issue: false hasContentIssue false

On Minimal Sets of Generators for Primitive Roots

Published online by Cambridge University Press:  20 November 2018

Francesco Pappalardi*
Affiliation:
Dipartimento di Matematica, Terza Università degli Studi di Roma, Via Corrado Segre, 4, Roma 00146-Italia, e-mail: pappa@mat.uniroma3.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A conjecture of Brown and Zassenhaus (see [2]) states that the first log/? primes generate a primitive root (mod p) for almost all primes p. As a consequence of a Theorem of Burgess and Elliott (see [3]) it is easy to see that the first log2p log log4+∊p primes generate a primitive root (mod p) for almost all primes p. We improve this showing that the first log2 p/ log log p primes generate a primitive root (mod p) for almost all primes p.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1995