Statistical Evidence for Small Generating Sets
- 1 July 1993
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 61 (203) , 69-82
- https://doi.org/10.2307/2152936
Abstract
For an integer n, let denote the smallest x such that the primes generate the multiplicative group modulo n. We offer heuristic arguments and numerical data supporting the idea thatKeywords
This publication has 24 references indexed in Scilit:
- Explicit Bounds for Primality Testing and Related ProblemsMathematics of Computation, 1990
- A Rigorous Subexponential Algorithm For Computation of Class GroupsJournal of the American Mathematical Society, 1989
- The Least r-Free Number in an Arithmetic ProgressionTransactions of the American Mathematical Society, 1986
- Lucas PseudoprimesMathematics of Computation, 1980
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Greatest of the Least Primes in Arithmetic Progressions Having a Given ModulusMathematics of Computation, 1979
- On the First Occurrence of Values of a CharacterTransactions of the American Mathematical Society, 1978
- Integer Sequence having Prescribed Quadratic CharacterMathematics of Computation, 1970
- The Distribution of Primitive RootsCanadian Journal of Mathematics, 1969
- On the Distribution of Additive Number-Theoretic Functions (III)Journal of the London Mathematical Society, 1956