Asymptotically exact heuristics for (near) primitive roots. II
| dc.creator | Moree, Pieter | |
| dc.date | 2001-04-13 | |
| dc.date | 2003-10-13 | |
| dc.date.accessioned | 2026-07-07T04:41:18Z | |
| dc.date.available | 2026-07-07T04:41:18Z | |
| dc.description | Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I, which is published in J. Number Theory 83 (2000), 155-181, a heuristic for N_{g,t}(x) was set up, under the assumption of the Generalized Riemann Hypothesis (GRH), and shown to be asymptotically exact. In this preprint we provide an alternative and rather shorter proof of this result. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/math/0104148 | |
| dc.identifier | http://arxiv.org/abs/math/0104148 | |
| dc.identifier | Japan J. Math. 29 (2003), 143-157 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61303 | |
| dc.subject | Number Theory | |
| dc.subject | 11R45 (Primary), 11B37 (Secondary) | |
| dc.title | Asymptotically exact heuristics for (near) primitive roots. II | |
| dc.type | text |