Andere Kunden interessierten sich auch für
![Primitive Root Modulo N]( "Primitive Root Modulo N")
Primitive Root Modulo N19,99 €![Primitive Recursive Arithmetic]( "Primitive Recursive Arithmetic")
Primitive Recursive Arithmetic25,99 €![Primitive Recursive Arithmetic]( "Primitive Recursive Arithmetic")
Primitive Recursive Arithmetic25,99 €![Primitive Recursive Function]( "Primitive Recursive Function")
Primitive Recursive Function29,99 €![Primitive Recursive Function]( "Primitive Recursive Function")
Primitive Recursive Function25,99 €![Primitive Equations]( "Primitive Equations")
Primitive Equations25,99 €![Primitive Equations]( "Primitive Equations")
Primitive Equations25,99 €
High Quality Content by WIKIPEDIA articles! In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n). That is, if g is a primitive root (mod n), then for every integer a that has gcd(a, n) = 1, there is an integer k such that gk a (mod n). k is called the index of a. That is, g is a generator of the multiplicative group of integers modulo n.