( x, m )
return result
Return the order of x in the multiplicative group mod m.
Return the order of x in the multiplicative group mod m.
Return the order of x in the multiplicative group mod m .
def order_mod( x, m ):
  """Return the order of x in the multiplicative group mod m.
  """

  # Warning: this implementation is not very clever, and will
  # take a long time if m is very large.

  if m <= 1: return 0

  assert gcd( x, m ) == 1

  z = x
  result = 1
  while z != 1:
    z = ( z * x ) % m
    result = result + 1
  return result
def order_mod ( x , m ) : # Warning: this implementation is not very clever, and will # take a long time if m is very large. if m <= 1 : return 0 assert gcd ( x , m ) == 1 z = x result = 1 while z != 1 : z = ( z * x ) % m result = result + 1 return result