Modular Exponentiation Calculator
Compute base^exponent modulo a positive integer using repeated squaring and BigInt intermediates; handles negative bases without floating-point overflow.
Description
Compute base^exponent modulo a positive integer using repeated squaring and BigInt intermediates; handles negative bases without floating-point overflow.
Compute base^exponent modulo a positive integer using repeated squaring and BigInt intermediates; handles negative bases without floating-point overflow.
When to use Modular Exponentiation Calculator
Use this tool to test or transform exact integers according to the named number-theory definition, for education, validation, or algorithm checks.
- base
- An integer input.
- exponent
- An integer input greater than or equal to 0.
- modulus
- An integer input greater than or equal to 1.
How the calculation works
Limitations and assumptions
This tool applies an exact integer definition within JavaScript's safe-integer range. It is not an arbitrary-precision factorization or proof system, so do not use rounded measurements or integers beyond the accepted domain as though they were exact.
Alternative or Complementary approaches
Complement a number-property result with its factorization, divisors, digit representation, or a second independent predicate. A true result establishes only the named property and does not imply other properties such as primality.
References
-
Modular exponentiation — Wikipedia contributors
Similar or alternative tools
- Chinese Remainder Theorem Solver
Solve a list of integer congruences, including non-coprime moduli when consistent; return the smallest nonnegative solution and its period as exact decimal strings.
- Coprime Number Checker
Check whether two nonzero safe integers share no factor greater than one.
- Coprime Count Calculator
Count the positive integers up to a positive integer that are coprime to it (Euler totient).