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

Number-Theoretic Functions

package-ubuntu-20.04-r-4.0.5#cran#numbers-0.8-1

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

<table summary="R argblock">
<tr valign="top">
<td><code>g</code></td>
<td>
<p>integer greater 2 (and smaller than p).</p>
</td>
</tr>
<tr valign="top">
<td><code>p</code></td>
<td>
<p>prime number.</p>
</td>
</tr>
</table>

<p>Test is done by determining the order of <code>g</code> modulo <code>p</code>.
</p>

isPrimroot(2, 7)
isPrimroot(2, 71)
isPrimroot(7, 71)

package-ubuntu-20.04-r-4.0.5#cran#numbers-0.8-1#docs#isPrimroot

isPrimroot

Description

Usage

Arguments

Details

Value

Examples

numbers

We don't support your browser anymore

`g`	integer greater 2 (and smaller than p).
`p`	prime number.