Primitive Root Modulo N
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... Viac o knihe
Produkt je dočasne nedostupný
36.09 €
bežná cena: 40.10 €
O knihe
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.
- Vydavateľstvo: Betascript Publishers
- Formát: Paperback
- Jazyk:
- ISBN: 9786130347031
Anglický jazyk 
