primitive roots

SearchAdvancedHelp

(0.000 seconds)

3 matching pages

1: 27.2 Functions

… ►

27.2.1 $$n=\prod _{r=1}^{\nu \left(n\right)}{p}_r^{a_r},$$

ⓘ

Symbols:

$\nu \left(n\right)$: number of distinct primes dividing a number, $n$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers and $a$: primitive root

Referenced by:

§27.2(i), §27.3

Permalink:

http://dlmf.nist.gov/27.2.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §27.2(i), §27.2 and Ch.27

… ►

27.2.8 $$a^{\varphi \left(n\right)}\equiv 1(modn),$$

ⓘ

Symbols:

$\varphi \left(n\right)$: Euler’s totient, $\equiv$: modular equivalence, $n$: positive integer and $a$: primitive root

A&S Ref:

24.3.2 II.B

Referenced by:

§27.16, §27.8

Permalink:

http://dlmf.nist.gov/27.2.E8

Encodings:

pMML, png, TeX

See also:

Annotations for §27.2(i), §27.2 and Ch.27

►and if $\varphi \left(n\right)$ is the smallest positive integer $f$ such that $a^f\equiv 1(modn)$, then $a$ is a primitive root mod $n$. … ►

27.2.12

ⓘ

Defines:

$\mu \left(n\right)$: Möbius function

Symbols:

$\nu \left(n\right)$: number of distinct primes dividing a number, $n$: positive integer and $a$: primitive root

A&S Ref:

24.3.1 I.A

Permalink:

http://dlmf.nist.gov/27.2.E12

Encodings:

pMML, png, TeX

See also:

Annotations for §27.2(i), §27.2 and Ch.27

… ►

27.2.13

ⓘ

Defines:

$\lambda \left(n\right)$: Liouville’s function

Symbols:

$\nu \left(n\right)$: number of distinct primes dividing a number, $n$: positive integer and $a$: primitive root

Permalink:

http://dlmf.nist.gov/27.2.E13

Encodings:

pMML, png, TeX

See also:

Annotations for §27.2(i), §27.2 and Ch.27

…

2: 27.21 Tables

… ►8 gives examples of primitive roots of all primes $\le 9973$; Table 24. …

3: 27.10 Periodic Number-Theoretic Functions

… ►This is the sum of the $n$th powers of the primitive $k$th roots of unity. …