Modulo Calculator

Compute the remainder of a divided by n using the Euclidean definition (0 ≤ remainder < n). Understand modular arithmetic, congruence, and real‑world applications like clock arithmetic, hashing, and cryptography.

Result: a mod n = remainder r where 0 ≤ r < |n| and a = n·q + r.
? 47 mod 9
? -47 mod 9
⭐ 23 mod 5
⚡ -23 mod 5
⏰ 100 mod 12 (clock)
? 0 mod 13
? 144 mod 12 (exact)
Privacy first: All calculations are performed locally. No data is sent to any server.

Modular Arithmetic: The Mathematics of Remainders

In mathematics, the expression a mod n (read "a modulo n") returns the remainder after Euclidean division of a by n. Formally, for integers a and n with n ≠ 0, there exist unique integers q (quotient) and r (remainder) such that:

a = n·q + r with 0 ≤ r < |n|

The remainder r is the value of a mod n. Two numbers are said to be congruent modulo n if they have the same remainder: a ≡ b (mod n). This simple idea is the cornerstone of number theory, cryptography, computer science, and even everyday life (clock arithmetic).

Why Use This Modulo Calculator?

  • ✔️ Handles negative numbers correctly – uses the Euclidean remainder (non‑negative), unlike many programming languages' `%` operator.
  • ✔️ Step‑by‑step breakdown – shows the exact division, quotient, and remainder derivation.
  • ✔️ Visual grouping – illustrates how many full groups of modulus fit into the number.
  • ✔️ Educational & practical – essential for learning modular arithmetic, verifying hash functions, or solving congruences.

How the Euclidean Modulo is Computed (Algorithm)

Given integer a and modulus n (n ≠ 0):

  1. Take the absolute value of modulus: m = |n|.
  2. Compute the standard remainder: r_raw = a % m (using truncating division, may be negative).
  3. Adjust to Euclidean remainder: r = (r_raw + m) % m.
  4. The quotient q = (a - r) / n (exact integer division).
  5. Verification: a = n·q + r and 0 ≤ r < m.

Example: a = -23, n = 5 → m = 5, r_raw = -23 % 5 = -3, r = (-3 + 5) % 5 = 2, q = (-23-2)/5 = -5. Check: 5·(-5) + 2 = -25+2 = -23 ✓.

Real‑World Applications of Modulo

Domain Application Example
Cryptography RSA, Diffie‑Hellman, ElGamal c = m^e mod n (encryption)
Computer Science Hash tables, circular buffers, checksums index = hash(key) % table_size
Everyday Life Clock arithmetic (12‑hour / 24‑hour) 14:00 mod 12 = 2 → 2:00 PM
Number Theory GCD, modular inverses, Chinese Remainder Theorem Find x such that x ≡ 2 (mod 3) and x ≡ 3 (mod 5)
Programming Cyclic scheduling, random number generation Linear congruential generator: X_{n+1} = (a·X_n + c) mod m
Case Study: Modular Arithmetic in RSA Encryption

RSA relies on the difficulty of factoring large primes. The encryption and decryption are modular exponentiation operations: ciphertext = plaintext^e mod n. The modulo operation ensures the result fits within a fixed range (0 to n-1). Without modular arithmetic, the numbers would grow astronomically. This calculator helps you understand the core operation that underpins secure online transactions, digital signatures, and SSL/TLS.

Properties of Modulo Operation

  • Additivity: (a + b) mod n = ((a mod n) + (b mod n)) mod n.
  • Multiplicativity: (a × b) mod n = ((a mod n) × (b mod n)) mod n.
  • Periodicity: a mod n repeats every n: (a + k·n) mod n = a mod n for any integer k.
  • Reduction: For any integer a, a mod n is the unique residue in {0, 1, …, n-1} representing the congruence class of a.

Deep Dive: Why Mathematics Prefers the Euclidean Remainder

While programming languages differ in their remainder operators, mathematics consistently uses the Euclidean definition (non‑negative remainder) for fundamental reasons that create elegant mathematical structures:

  • Canonical Complete Residue System: The set {0, 1, ..., n-1} forms a standard complete residue system modulo n. Every integer is congruent to exactly one element in this set. This provides a unique representative for each congruence class, which is essential for well‑defined operations in the ring ℤ/nℤ.
  • Simplifies Proofs and Algorithms: Many number theory theorems and algorithms (like the Extended Euclidean Algorithm) rely on the condition 0 ≤ r < |n|. This invariant ensures termination and correctness in recursive algorithms.
  • Foundation for Finite Fields: In cryptography, operations occur in finite fields ℤp where elements are represented as {0, 1, ..., p-1}. The Euclidean remainder guarantees that any integer maps to exactly one field element, which is crucial for cryptographic security and correctness.
  • Historical Consistency: This definition traces back to Euclid's algorithm (circa 300 BCE) and is used in foundational texts like Concrete Mathematics by Graham, Knuth, and Patashnik, and Knuth's The Art of Computer Programming.

Our calculator implements this mathematically standard definition, ensuring consistency with academic literature and cryptographic standards.

Modulo vs. Remainder: Crucial Distinction

Many programming languages (C, Java, JavaScript) define `%` as the remainder operator, which can return negative values. However, in mathematics and number theory, modulo is defined to give a result in [0, n-1] (Euclidean modulus). This calculator follows the mathematical definition. The table below contrasts typical language behavior with true modulo:

Expression Language `%` (JS) Mathematical a mod n (this tool)
-23 mod 5 -3 2
23 mod -5 3 3 (since |n|=5, remainder 3)
-23 mod -5 -3 2

This consistency is essential for cryptographic applications and number theory proofs.

Frequently Asked Questions

Modulo (in mathematics) always returns a non‑negative result in [0, n-1]. Remainder operators in programming may return negative values depending on the sign of the dividend. Our calculator uses the mathematical definition.

Yes, but the remainder is defined using the absolute value of the modulus. So -23 mod 5 = 2, and 23 mod -5 = 3 (because |−5|=5). The result is always non‑negative.

Division by zero is undefined. The calculator will display a clear error message and prevent the operation.

The hash function returns a large integer; taking modulo by the table size maps it to a valid index (0 to size-1). This ensures uniform distribution if the modulus is prime.

a ≡ b (mod n) means that a and b have the same remainder when divided by n, i.e., n divides (a−b). Congruence is an equivalence relation.
References: Wolfram MathWorld – Modular Arithmetic, Wikipedia: Modular arithmetic, Graham, Knuth, & Patashnik, Concrete Mathematics (Addison‑Wesley, 1994), Knuth, D. E., The Art of Computer Programming, Vol. 1 (Addison‑Wesley, 1997), C. D. Meyer, Matrix Analysis and Applied Linear Algebra (SIAM, 2000), GetZenQuery Tech Team – verified April 2026.