Re: multiplicative group mod M: I claim cyclic iff M=odd prime power or M<6.
- --- In email@example.com,
David Cleaver wrote:
> What I was trying to convey is that Pari/GP can alsoI imagine that GP returns an element of maximum order.
> return what looks like a valid answer, even though the
> input does not have a primitive root
Iff the group is cyclic this is a primitive root,
with order eulerphi(n). All of this is perfectly
consistent with the rubric:
znprimroot(n): returns a primitive root of n when it exists.
as we both agree.