Power Mod Calculator

Omni's power mod calculator is here to help whenever you need to compute powers in modular arithmetic. It uses one of the fast modular exponentiation algorithms, so there's no risk of facing the problem of overflow. Should you ever need to perform exponentiation modulo n by hand, we discuss several helpful methods you can use at home, including Fermat's little theorem.

Have you already checked the rest of our exponentiation calculators?

• Multiplying exponents calculator;
• Dividing exponents calculator;
• Fraction exponent calculator;
• Exponential regression calculator; and
• Exponential growth calculator.

Modular exponentiation means that we perform exponentiation over a modulo, i.e., for the given integers a,b,n we want to find c such that

$c = a^b \operatorname{mod}n$

and $0 \leq c < n$. Computing power in modular arithmetic is linked to modular inverses, which you can discover with the help of our inverse modulo calculator.

You can perform this calculation manually, but it can be very time-consuming. Alternatively, some mathematical theorems allow you to simplify the problem at hand – see below. There are also fast algorithms, which will give you the result almost immediately. We use one of these algorithms in this power mod calculator.

This power mod calculator is very user-friendly, so you'll have no trouble using it. You just need to:

1. Input the data for computing the power of xʸ in modular arithmetic:
   • Base x;
   • Exponent y; and
   • Modulus n.
2. Your data will be summarized at the bottom of the calc. Verify if everything is all right.
3. The result of modular exponentiation will appear there as well. That's it!

Our power mod calculator will be your best friend if you're frequently faced with the problem of computing powers in modular arithmetic. Read on if you need to know how to calculate exponentiation modulo n by hand.

Here we will go through several examples of performing exponentiation modulo by hand using different methods.

Example 1. Direct method

Let's calculate 5⁴ mod 3.

We know that 5⁴ = 625, so our problem is in fact 625 mod 3.

Clearly, 625 is not divisible by 3, but 624 is (this is because the sum of its digits is 6+2+4 = 12, which is divisible by 3).

So 625 - 1 is divisible by 3, which means that 5⁴ mod 3 = 625 mod 3 = 1.

Example 2. Smart method

Let's calculate 5⁴⁴ mod 2.

It's gonna be very hard to compute 5⁴⁴, because this number is very, very big. So, we need to be smart. Recall that mod 2 means that we're asking if the number at hand is even or odd: if it is even, then it's equal to 0 mod 2. If it's odd, it's equal to 1 mod 2.

When we're computing consecutive powers of 5, we get 5, 25, 625,.... As you can see, we always have 5 as the last digit. Indeed, if you have a number with the last digit equal to 5, and you multiply this number by 5, then you're bound to get 5 at the last place again. To see this, imagine performing the long multiplication algorithm – you start by multiplying 5 × 5, and so you get 25. So 5 goes to the result row, and 2 gets transferred to the next column. No matter what happens next, you have 5 as the last digit.

A number that has 5 as its last digit is odd. So 5⁴⁴ mod 2 = 1.

Example 3. Last digit

Let's calculate 5⁴⁴⁴ mod 10.

First, you need to realize that computing mod 10 is the same as computing the number's last digit. We've already established that raising 5 to any positive integer power gives a number that ends with 5 (see above). Hence, 5⁴⁴⁴ ends with 5 as well, so 5⁴⁴⁴ mod 10 = 5.

Example 4. Fermat's little theorem

Let's calculate 162⁶⁰ mod 61.

Fermat's little theorem states that if n is a prime number, then for any integer a, we have:

$a^n \operatorname{mod} n = a$

If additionally a is not divisible by n, then

$a^{n-1} \operatorname{mod} n = 1$

Hence, since in our case we have n = 61, which is a prime number, and a = 162, which is not divisible by 61, we obtain

162⁶⁰ mod 61 = 1.