Solves x^{n} mod p using the following methods:

* Modular Exponentiation

* Successive Squaring

This calculator has 1 input.

* Modular Exponentiation

* Successive Squaring

This calculator has 1 input.

- Successive Squaring I = number of digits in binary form of n. Run this many loops of a
^{2}mod p

For more math formulas, check out our Formula Dossier

- exponent
- The power to raise a number
- integer
- a whole number; a number that is not a fraction

...,-5,-4,-3,-2,-1,0,1,2,3,4,5,... - modular exponentiation
- the remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus)
- modulus
- the remainder of a division, after one number is divided by another.

a mod b - remainder
- The portion of a division operation leftover after dividing two integers
- successive squaring
- an algorithm to compute in a finite field