On primes p for which d divides ordp(g)
Abstract
Let Ng(d) be the set of primes p such that the order of g modulo p is divisible by a prescribed integer d. Wiertelak showed that this set has a natural density and gave a rather involved explicit expression for it. 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 the natural density than known hitherto. A numerical demonstration, using a program of Y. Gallot, is presented.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.