Modulo Calculator

Q: What is modulo (mod) operation?

The modulo operation (often abbreviated as mod) finds the remainder after division of one number by another. For example, 17 mod 5 = 2 because 17 divided by 5 equals 3 with a remainder of 2. Mathematically: a mod n = r where a = n × q + r and 0 ≤ r < |n|.

Q: How do you calculate modulo?

To calculate a mod n: 1) Divide a by n and find the integer quotient q = floor(a/n). 2) Multiply q by n. 3) Subtract from a to get the remainder: r = a - n × q. For example, 17 mod 5: q = floor(17/5) = 3, r = 17 - 5 × 3 = 17 - 15 = 2.

Q: What is the difference between mod and remainder?

For positive numbers, modulo and remainder are identical. The difference appears with negative numbers. In mathematics, modulo always returns a non-negative result (0 ≤ r < |n|), while the remainder can be negative depending on the programming language. This calculator uses the mathematical definition.

Q: What are common uses of modulo operation?

Modulo is used in: 1) Checking if a number is even/odd (n mod 2), 2) Clock arithmetic (24-hour to 12-hour conversion), 3) Cyclic patterns and circular arrays, 4) Hash functions and cryptography, 5) Generating pseudo-random numbers, 6) Determining divisibility, 7) Calendar calculations.

Q: How does modulo work with negative numbers?

With negative numbers, different conventions exist. In mathematics and this calculator, the result is always non-negative: -17 mod 5 = 3 (not -2). This is because -17 = 5 × (-4) + 3. Some programming languages return -2 using truncated division. Understanding this difference is crucial for programming.

Q: Can modulo work with decimal numbers?

Yes, modulo can be extended to decimal (floating-point) numbers. For example, 7.5 mod 2.5 = 0 because 7.5 = 2.5 × 3 + 0. And 8.7 mod 2.5 = 1.2 because 8.7 = 2.5 × 3 + 1.2. This calculator supports decimal modulo calculations with high precision.

Calculate modulo (remainder) with step-by-step division process, interactive visual diagrams, and support for integers, decimals, negative numbers, and scientific notation.

Free to useNo sign-up requiredUpdated Jan 2026

Modulo CalculatorTry it now — free ▼

Embed Modulo Calculator Widget

About Modulo Calculator

Welcome to the Modulo Calculator, a comprehensive free online tool for calculating the modulo (remainder) of any two numbers. This calculator provides step-by-step division breakdowns, interactive visual diagrams, and supports integers, decimals, negative numbers, and scientific notation. Whether you are learning mathematics, programming, or solving cryptography problems, this tool makes modulo operations clear and easy to understand.

What is Modulo (Mod) Operation?

The modulo operation (often written as mod or %) finds the remainder after dividing one number (the dividend) by another (the divisor). It answers the question: "After dividing a by n, what is left over?"

Modulo Definition

$a \mod n = r$ where $a = n \times q + r$ and $0 \le r < |n|$

Here, $a$ is the dividend, $n$ is the divisor, $q$ is the quotient (integer part of division), and $r$ is the remainder (the modulo result).

Example: 17 mod 5

17 divided by 5 = 3 with remainder 2

Because: 17 = 5 × 3 + 2

Therefore: 17 mod 5 = 2

How to Calculate Modulo

Enter the dividend (a): Input the number you want to divide. This can be positive, negative, a decimal, or in scientific notation (e.g., 1.5e10).
Enter the divisor (n): Input the number you are dividing by. This cannot be zero, but can be positive, negative, or a decimal.
Click Calculate Modulo: Press the button to see your result with a complete step-by-step breakdown.
Review the results: See the remainder, quotient, verification equation, and (for simple positive integers) a visual diagram showing the grouping.

Manual Calculation Steps

To calculate $a \mod n$ manually:

Divide: Calculate $a \div n$
Floor: Take the floor (round toward negative infinity) to get quotient $q = \lfloor a/n \rfloor$
Multiply: Calculate $n \times q$
Subtract: Calculate remainder $r = a - n \times q$

Example: Calculate 23 mod 7

Step 1: 23 ÷ 7 = 3.2857...

Step 2: q = floor(3.2857) = 3

Step 3: 7 × 3 = 21

Step 4: r = 23 - 21 = 2

Common Uses of Modulo

🔢

Even/Odd Check

n mod 2 = 0 means n is even; n mod 2 = 1 means n is odd. This is the most common modulo use in programming.

🕐

Clock Arithmetic

Convert 24-hour to 12-hour format: 14 mod 12 = 2 (2:00 PM). Calculate time wrapping around midnight.

🔄

Cyclic Patterns

Create repeating sequences, circular arrays, and round-robin scheduling. Index i mod n ensures staying within bounds.

🔐

Cryptography

RSA encryption, Diffie-Hellman key exchange, and hash functions all rely heavily on modular arithmetic.

📊

Hash Functions

hash(key) mod table_size determines where to store data in hash tables, ensuring indices stay within array bounds.

📅

Calendar Calculations

Determine day of week, leap years, and date arithmetic. Days repeat every 7, so day mod 7 gives the weekday.

Modulo with Different Number Types

Positive Integers

For positive integers, modulo is straightforward: the remainder is always between 0 and n-1.

10 mod 3 = 1 (because 10 = 3 × 3 + 1)
15 mod 5 = 0 (because 15 = 5 × 3 + 0, exact division)
7 mod 10 = 7 (because 7 = 10 × 0 + 7, dividend smaller than divisor)

Negative Numbers

Negative numbers can be tricky because different systems define modulo differently. This calculator uses the mathematical definition where the remainder is always non-negative (0 to |n|-1):

-17 mod 5 = 3 (not -2), because -17 = 5 × (-4) + 3
-7 mod 3 = 2 (not -1), because -7 = 3 × (-3) + 2
17 mod -5 = 2 (because 17 = -5 × (-3) + 2)

Programming vs Math Convention

Programming languages vary in handling negative modulo:

Python: -17 % 5 = 3 (floored division - matches math)

JavaScript/C/Java: -17 % 5 = -2 (truncated division)

Decimal Numbers

Modulo extends to decimal (floating-point) numbers using the same principle:

7.5 mod 2.5 = 0 (because 7.5 = 2.5 × 3 + 0)
8.7 mod 2.5 = 1.2 (because 8.7 = 2.5 × 3 + 1.2)
10.5 mod 3 = 1.5 (because 10.5 = 3 × 3 + 1.5)

Scientific Notation

This calculator supports scientific notation for very large or small numbers:

1.5e10 mod 7 = 1 (15,000,000,000 mod 7)
1e6 mod 999 = 1 (1,000,000 mod 999)

Modulo Properties and Rules

Fundamental Properties

Identity: a mod n = a when 0 ≤ a < n
Zero dividend: 0 mod n = 0 (for any n ≠ 0)
Self modulo: n mod n = 0
Multiples: (k × n) mod n = 0 for any integer k

Arithmetic with Modulo

Modular Arithmetic Rules

$(a + b) \mod n = ((a \mod n) + (b \mod n)) \mod n$

$(a - b) \mod n = ((a \mod n) - (b \mod n) + n) \mod n$

$(a \times b) \mod n = ((a \mod n) \times (b \mod n)) \mod n$

These properties are essential in cryptography and computer science, allowing calculations with very large numbers without overflow.

Modulo vs Division vs Remainder

Division (÷ or /)

Division gives the quotient, which can be a decimal: 17 ÷ 5 = 3.4

Integer Division (// or div)

Integer division gives only the whole number part: 17 // 5 = 3

Modulo (mod or %)

Modulo gives only the remainder: 17 mod 5 = 2

Relationship

The Division Identity

$a = n \times (a \div n) + (a \mod n)$

For 17 and 5: 17 = 5 × 3 + 2 ✓

Frequently Asked Questions

What is modulo (mod) operation?