For an odd prime $p$, the Conrey generator is defined as the smallest positive integer $g_{p}$
that generates the multiplicative group of order ${p}^{e}$
for every $e \ge 1$.

Definitions:

Fungrim symbol | Notation | Short description |
---|---|---|

ConreyGenerator | $g_{p}$ | Conrey generator |

Pow | ${a}^{b}$ | Power |

Source code for this entry:

Entry(ID("166a87"), SymbolDefinition(ConreyGenerator, ConreyGenerator(p), "Conrey generator"), Description("For an odd prime", p, ", the Conrey generator is defined as the smallest positive integer", ConreyGenerator(p), "that generates the multiplicative group of order", Pow(p, e), "for every", GreaterEqual(e, 1), "."))