Highly Influenced

Let Ng(d) be the set of primes p such that the order of g modulo p, ordp(g), is divisible by a prescribed integer d. Wiertelak showed that this set has a natural density, δg(d), with δg(d) ∈ Q>0. Let Ng(d)(x) be the number of primes p ≤ x that are in Ng(d). A simple identity for Ng(d)(x) is established. It is used to derive a more compact expression for δg… (More)