Modular Exponentiation

Calculate (base^exp) % mod efficiently using binary exponentiation.

Code

Algorithms

let result = 1n, b = BigInt(base), e = BigInt(exp), m = BigInt(mod);
b = b % m;
while (e > 0n) {
  if (e % 2n === 1n) result = (result * b) % m;
  e = e / 2n;
  b = (b * b) % m;
}
return Number(result);

Parameters

base(number)

Base number

exp(number)

Exponent

mod(number)

Modulus

Browser·fetch() may be limited by CORS

More JavaScript Snippets

Binary to Decimal

Convert a binary string representation to its decimal number equivalent.

Bytes to Human Readable

Convert bytes to human readable format (KB, MB, GB, etc.) for file sizes.

Calculate Median

Calculate the median value of an array of numbers.

Calculate Mode

Find the most frequent value(s) in an array.

Calculate Percentile

Calculate the nth percentile of an array using linear interpolation.

Celsius to Fahrenheit

Convert temperature from Celsius to Fahrenheit using the standard formula.