About the Project
NIST

primitive roots

AdvancedHelp

(0.001 seconds)

3 matching pages

1: 27.2 Functions
27.2.1 n = r = 1 ν ( n ) p r a r ,
27.2.8 a ϕ ( n ) 1 ( mod n ) ,
and if ϕ ( n ) is the smallest positive integer f such that a f 1 ( mod n ) , then a is a primitive root mod n . …
27.2.12 μ ( n ) = { 1 , n = 1 , ( - 1 ) ν ( n ) , a 1 = a 2 = = a ν ( n ) = 1 , 0 , otherwise .
27.2.13 λ ( n ) = { 1 , n = 1 , ( - 1 ) a 1 + + a ν ( n ) , n > 1 .
2: 27.21 Tables
8 gives examples of primitive roots of all primes 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. …