Mathematica 9 is now available
THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.
Mathematica > Mathematics and Algorithms > Mathematical Functions > Number Theoretic Functions >

MultiplicativeOrder

MultiplicativeOrder[k, n]
gives the multiplicative order of k modulo n, defined as the smallest integer m such that k^m=1mod n.
MultiplicativeOrder[k, n, {r1, r2, ...}]
gives the generalized multiplicative order of k modulo n, defined as the smallest integer m such that k^m=r_imod n for some i.
  • Integer mathematical function, suitable for both symbolic and numerical manipulation.
  • MultiplicativeOrder returns unevaluated if there is no integer m satisfying the necessary conditions.
The multiplicative order of 7 modulo 108:
The multiplicative order of 7 modulo 108:
In[1]:=
Click for copyable input
Out[1]=
Evaluate for large arguments:
MultiplicativeOrder works for negative first arguments:
TraditionalForm formatting:
Generalized multiplicative order:
Find all primitive roots modulo 43:
Find a solution to Mod[5^k, 7]=2:
The function digitCycleLength gives the digit period for any rational number r in base b:
This shows that the decimal representation of in base 10 repeats every 3 digits.
The digits of in base 4 repeat with period 6:
The repetition period in Rule 90 for odd n divides q[n]:
EulerPhi is a multiple of the multiplicative order:
The multiplicative order of a primitive root modulo n is EulerPhi[n]:
New in 4
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team