PowerMod

Modular exponentiation: a^b mod m, computed without forming a^b directly.

WikipediaModular exponentiationWikidataQ1228841Wolfram LanguagePowerMod✓Rosetta CodeModular exponentiation

PowerMod(a, b, m)modular exponentiation, .

Domain: Number theory

Details

Computed by repeated squaring, without ever forming directly -- efficient even for huge .
A negative gives the modular inverse of raised to , when it exists.
The inverse is undefined whenever ; compute-engine leaves such calls unevaluated.
Equal to for positive , just far more efficient. See Mod.
compute-engine's PowerMod requires an integer exponent.

Examples

See also: Mod