Modulo Calculator

What does modulo mean?

Modulo is an arithmetic operation that returns the remainder after dividing one number by another. When you write "A mod M," you're asking for whatever is left over once M has been subtracted from A as many whole times as possible. 17 mod 5 equals 2, because 5 goes into 17 three full times (making 15), leaving 2 behind. The result of a modulo operation is always non-negative and always smaller than the divisor (when using the mathematical, positive convention this calculator follows).

Modulo vs. remainder — are they the same thing?

In everyday use, "modulo" and "remainder" mean the same thing for positive numbers. They diverge only with negative inputs: some programming languages' built-in "%" operator returns a result with the same sign as the dividend (a true "remainder" operator), while the mathematical modulo operation always returns a non-negative result between 0 and M−1. This calculator implements true positive modulo, which is why −13 mod 5 correctly returns 2, not −3.

The division algorithm

Every modulo calculation rests on one identity from basic number theory: Dividend = Divisor × Quotient + Remainder. Given 17 and 5, the quotient is 3 and the remainder is 2, and indeed 5 × 3 + 2 = 17. This equation is exactly the verification shown alongside every Basic Modulo result — if it doesn't balance, the calculation is wrong.

Quotients and remainders

The quotient is how many whole times the divisor fits into the dividend; the remainder is what's left afterward. For positive numbers this matches ordinary long division. The quotient used in this calculator's positive-modulo convention is the floor of the division — rounded down toward negative infinity — which is what guarantees the remainder always comes out non-negative, even when the dividend is negative.

Positive modulo

When both the dividend and divisor are positive, modulo behaves exactly like ordinary remainder-after-division: 10 mod 3 = 1, 18 mod 5 = 3, 21 mod 7 = 0. These are the cases most people learn first, and they form the baseline for understanding the trickier negative case below.

Negative modulo

Negative numbers are where modulo conventions diverge and where most confusion happens. Under the mathematical (positive) convention, −13 mod 5 = 2, not −3. The reasoning: −13 = 5 × (−3) + 2, so the quotient is −3 and the remainder is 2 — a valid, non-negative remainder smaller than the divisor. This calculator always applies that positive convention, using the formula ((A % M) + M) % M to correct for any negative intermediate result.

Congruence relations

Two integers are said to be "congruent modulo M" if they leave the same remainder when divided by M — written A ≡ B (mod M). For example, 17 and 2 are congruent modulo 5, because both leave a remainder of 2. Congruence is the foundation of modular arithmetic as a formal system, letting mathematicians treat entire families of numbers as equivalent for a given modulus.

Modular arithmetic

Modular arithmetic performs addition, subtraction, and multiplication as usual, then reduces the result modulo M at the end — (A + B) mod M, (A − B) mod M, and (A × B) mod M. This is exactly how a 12-hour clock works: 9 + 5 = 14, but on a clock that reads as 2, because 14 mod 12 = 2. The same wraparound logic governs array indexing, circular buffers, and cyclic scheduling in software.

Modular inverse

A modular inverse of a number A, with respect to modulus M, is a number B such that (A × B) mod M = 1 — essentially, "division" within modular arithmetic. Modular inverses exist only when A and M share no common factors, and finding them is a key step in several cryptographic algorithms, including parts of RSA key generation.

Modular exponentiation and the fast exponentiation algorithm

Modular exponentiation computes A^B mod M — but computing A^B directly first and then reducing it modulo M becomes impossibly slow for large exponents, since A^B can have thousands of digits. Fast modular exponentiation (also called exponentiation by squaring) avoids this by repeatedly squaring the base and reducing modulo M at every step, using the exponent's binary representation to decide when to multiply the running result. This turns an operation that would otherwise take exponential time into one that takes only about log₂(B) multiplications — the exact technique this calculator uses under the hood.

Clock arithmetic

A standard clock is the most intuitive real-world example of modular arithmetic: hours wrap around every 12 (or 24), which is precisely addition modulo 12 (or modulo 24). Days of the week wrap around modulo 7. Any cyclic counting system — including compass headings modulo 360 — is a direct application of the same modulo operation this calculator performs.

Number theory and prime numbers

Modular arithmetic is central to number theory, particularly in studying prime numbers. Fermat's Little Theorem and related results, which underpin much of modern cryptography, are statements about how numbers behave modulo a prime. Modular exponentiation is the computational engine that makes these theorems practically useful rather than purely theoretical.

Applications in programming

Programmers use modulo constantly: wrapping an array index back into range with index mod length, alternating behavior every Nth iteration with i mod N === 0, converting between units (seconds mod 60 for a clock display), and detecting even or odd numbers with n mod 2. It's one of the most frequently used operators in everyday software development.

Cryptography and encryption

Public-key cryptography systems like RSA rely entirely on modular exponentiation: encrypting and decrypting a message both involve raising a number to a power modulo a large composite number. The security of the whole system depends on modular exponentiation being fast to compute in one direction but effectively impossible to reverse without the private key — which is exactly why efficient fast exponentiation matters both for legitimate encryption and for understanding its security properties.

Hash functions and random number generators

Many hash functions reduce a large intermediate number down to a fixed-size bucket using modulo, spreading values evenly across a hash table. Classic pseudorandom number generators, such as the linear congruential generator, are built directly on modular arithmetic — each new "random" number is generated by multiplying, adding, and then reducing the previous one modulo some fixed value.

Circular buffers, calendars, and scheduling

Circular buffers — a common data structure in networking and audio/video streaming — use modulo to wrap a write position back to the start once it reaches the end of the buffer. Calendar systems use modulo to compute the day of the week for any date, and scheduling systems use it to cycle staff through repeating shift patterns.

Competitive programming

Competitive programming problems frequently ask for an answer "modulo 10^9 + 7" specifically because the true answer would otherwise overflow standard integer types. Fast modular exponentiation and modular arithmetic identities are essential tools for solving these problems efficiently within strict time limits.

Common mistakes when working with modulo

The most frequent errors are confusing modulo with plain division (they return different things — a remainder, not a quotient), confusing the mod operator with a percentage sign, mishandling negative dividends by expecting a negative result instead of the correct positive remainder, dividing by a zero modulus, forgetting to reduce intermediate results in a multi-step modular calculation, and letting numbers overflow before an exponentiation is reduced by fast exponentiation. Careful, step-by-step reduction — exactly what this calculator displays — avoids all of these.