isPrimroot

Determine whether <code>g</code> generates the multiplicative group
 modulo p.

Provides number-theoretic functions for factorization, prime
numbers, twin primes, primitive roots, modular logarithm and
inverses, extended GCD, Farey series and continued fractions.
Includes Legendre and Jacobi symbols, some divisor functions,
Euler's Phi function, etc.

numbers

Number-Theoretic Functions

isPrimroot function

<dl> <dt>g</dt>
<dd>integer greater 2 (and smaller than p).</dd> <dt>p</dt>
<dd>prime number.</dd></dl>

Arguments

Primitive Root Test — isPrimroot

<dl>

 <dt>g</dt>
<dd>integer greater 2 (and smaller than p).</dd>

 <dt>p</dt>
<dd>prime number.</dd>

</dl>

isPrimroot: Primitive Root Test

Description

Usage

Value

Arguments

Details

Examples