MultiplicativeOrder

The smallest positive k such that a^k ≡ 1 (mod n).

WikipediaMultiplicative orderMathWorldMultiplicativeOrderWikidataQ282723Wolfram LanguageMultiplicativeOrder✓

MultiplicativeOrder(a, n)smallest positive with .

Domain: Number theory

Details

Also called the modulo order; defined only when , since otherwise no power of can reach 1 mod .
Always divides , by Lagrange's theorem applied to the group of units mod . See Totient.
compute-engine leaves the call unevaluated when no order exists.
compute-engine doesn't support it.

Examples

See also: PowerMod