Loading ...
Sorry, an error occurred while loading the content.

Re: multiplicative group mod M: I claim cyclic iff M=odd prime power or M<6.

Expand Messages
  • djbroadhurst
    ... I imagine that GP returns an element of maximum order. Iff the group is cyclic this is a primitive root, with order eulerphi(n). All of this is perfectly
    Message 1 of 6 , Jan 8, 2013
    View Source
    • 0 Attachment
      --- In primenumbers@yahoogroups.com,
      David Cleaver wrote:

      > What I was trying to convey is that Pari/GP can also
      > return what looks like a valid answer, even though the
      > input does not have a primitive root

      I imagine that GP returns an element of maximum order.
      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.

      David
    Your message has been successfully submitted and would be delivered to recipients shortly.