can anybody explain me what is primitiveroot?
+1
A:
From here:
A primitive root of a prime p is an integer g such that g (mod p) has modulo order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively prime) and g is of modulo order phi(n) modulo n where phi(n) is the totient function, then g is a primitive root of n (Burton 1989, p. 187). The first definition is a special case of the second since phi(p)=p-1 for p a prime.
Eric Petroelje
2010-06-22 18:30:17