Power Mod Calculator

Name: Power Mod Calculator
Author: Jitendra Kumar

Calculate a^e mod m with normalized residues, binary exponent steps, and fast square-and-multiply verification.

Last Updated: May 2026

Power Mod Result

Normalized Base

Exponent Bits

Operations

3 multiply, 3 square

Power Mod Inputs

Enter a base, nonnegative exponent, and modulus greater than 1. The calculator uses square-and-multiply so large powers stay manageable.

Base (a)

Exponent (e)

Modulus (m)

Result Check

Item	Calculation	Result
Expression	7^13 mod 19	7
Base normalization	7 mod 19	7
Binary exponent	1101	4 bits
Fast method	Square-and-multiply	4 loop steps

Modular Rules

Check	Rule	Value
Range check	0 <= result < 19	Pass
Negative base handling	Base is reduced before exponentiation	7
Zero exponent rule	a^0 mod m	Not used
Complexity	O(log exponent)	4 exponent bits

Square-and-Multiply Steps

Binary step	Multiply action	Running result	Next square
Bit 0 = 1	1 x 7 mod 19	7	7^2 mod 19 = 11
Bit 1 = 0	Skip multiply for this bit	7	11^2 mod 19 = 7
Bit 2 = 1	7 x 7 mod 19	11	7^2 mod 19 = 11
Bit 3 = 1	11 x 11 mod 19	7	11^2 mod 19 = 7

Number Theory Notice

This calculator is for integer modular arithmetic and educational number theory. For cryptographic production systems, use audited libraries and constant-time implementations rather than manual calculations.

Checked by Jitendra Kumar

Power Mod Calculator is checked for formula labels, source links, and result limits.

Jitendra Kumar, Founder & Editorial Standards Lead. Updated May 2026. Scope: math calculators.

Sources & methodology · Review standards

How to Use the Power Mod Calculator

Enter the base, exponent, and modulus. The exponent must be zero or positive, and the modulus must be greater than 1.

The calculator reduces the base modulo m, converts the exponent into binary, and uses square-and-multiply to calculate the final remainder without expanding the full power.

Step 1: Enter the base
Use any integer, including a negative value.
Step 2: Enter the exponent
Use a nonnegative integer exponent.
Step 3: Enter the modulus
Use an integer modulus greater than 1.
Step 4: Review the binary steps
Check how each exponent bit affects the running result and next square.

How This Power Mod Calculator Works

Modular exponentiation finds the remainder of a power without expanding the full power. The calculator first reduces the base into the standard remainder range from 0 through m - 1.

It then reads the exponent in binary. Each loop squares the current factor modulo m. If the current binary digit is 1, the calculator also multiplies that factor into the running result.

Because every intermediate value is reduced modulo m, the method works efficiently even when the exponent is much larger than you would want to expand by hand.

Power Mod Guide

Core Formulas

Concept	Formula	Use
Power mod	a^e mod m	The remainder after raising a to e and dividing by m.
Normalize base	a mod m	Reduce the base before repeated multiplication.
Square-and-multiply	read exponent bits	Multiply only when a binary exponent bit is 1.
Repeated squaring	a, a^2, a^4, a^8, ... mod m	Keeps every intermediate value bounded by m.
Zero exponent	a^0 mod m = 1 mod m	Valid for modulus greater than 1.

Examples

Problem	Result	Notes
7^13 mod 19	7	Small example with several binary exponent steps.
42^17 mod 3233	2557	RSA-style modular exponentiation example.
5^117 mod 97	77	Large exponent handled with repeated squaring.
(-12)^9 mod 35	8	Negative base is normalized before powering.

Why Binary Exponents Help

A power such as a^117 does not need 116 repeated multiplications. Since 117 can be represented in binary, the calculator builds the needed powers a, a^2, a^4, a^8, and so on, reducing each one modulo m.

This is why power mod calculations are practical in cryptography and number theory: the number of loop steps grows with the number of binary digits in the exponent, not with the exponent itself.

Keep the research moving with Modulo Calculator, Inverse Modulo Calculator, Multiplicative Inverse Modulo Calculator, and Integer Calculator.

Frequently Asked Questions

Power mod means calculating a base raised to an exponent, then taking the remainder modulo m. It is written as a^e mod m.

Full powers can become extremely large. Modular exponentiation reduces after each multiplication, keeping intermediate values manageable.

The exponent is written in binary. The calculator repeatedly squares the current factor and multiplies it into the result only when the current exponent bit is 1.

Yes. The calculator first normalizes the base into the standard range from 0 to modulus - 1, then runs modular exponentiation.

This calculator uses nonnegative exponents. Negative exponents in modular arithmetic require modular inverse rules, which only work when the inverse exists.

It is used in number theory, cryptography examples, RSA-style calculations, primality tests, hashing, and cyclic remainder problems.