What is the remainder in division?

The remainder is the amount left over after dividing one number (the dividend) by another (the divisor) as many whole times as possible. For example, 17 divided by 5 goes 3 whole times (3 × 5 = 15), leaving 17 − 15 = 2 left over — so the remainder is 2. The remainder is always less than the divisor (if it were equal to or greater, you could divide one more time). When the remainder is 0, the division is exact and the divisor divides the dividend evenly.

How do you find the remainder without a calculator?

To find the remainder by hand: (1) Divide the dividend by the divisor using long division. (2) Multiply the quotient (rounded down to the nearest whole number) by the divisor. (3) Subtract that product from the dividend. The result is the remainder. For 23 ÷ 7: quotient = floor(23/7) = 3, product = 3 × 7 = 21, remainder = 23 − 21 = 2. You can verify: 23 = 7 × 3 + 2.

What is modulo (mod)?

Modulo (written as a mod b or a % b in programming) is the operation that returns the remainder after dividing a by b. For positive integers, modulo and remainder are identical: 17 mod 5 = 2. The modulo operation is fundamental in computer science — it is used to check if a number is even or odd (n mod 2), to cycle through array indices, to implement hash tables, and in cryptographic algorithms like RSA. In mathematics, modular arithmetic forms an entire branch of number theory.

What is the difference between remainder and modulo for negative numbers?

For positive numbers, remainder and modulo give the same result. For negative numbers, they can differ. The "truncated" remainder (used in languages like C, Java, and JavaScript's % operator) has the same sign as the dividend: −7 % 3 = −1 in JavaScript. The "floored" modulo (used in Python and mathematics) always returns a non-negative result when the divisor is positive: −7 mod 3 = 2, because floor(−7/3) = −3 and −7 − 3 × (−3) = 2. Most mathematical contexts use the floored definition.

How do you write the division equation with a remainder?

The standard form of a division equation with a remainder is: a = b × q + r, where a is the dividend, b is the divisor, q is the quotient (integer part), and r is the remainder. For 29 ÷ 6: q = floor(29/6) = 4, r = 29 − 6 × 4 = 5, so the equation is 29 = 6 × 4 + 5. This is also written as 29 ÷ 6 = 4 remainder 5, or "4 R 5." The remainder must satisfy 0 ≤ r < b.

Where is the modulo operation used in programming?

The modulo operator (%) appears constantly in programming. Common uses include: checking if a number is even or odd (if n % 2 === 0), wrapping array or list indices to create circular behavior (index = (current + 1) % length), generating hash values for hash tables, implementing clocks (hours = total_hours % 12), grouping items into buckets (which bucket = item_id % num_buckets), and generating repeating patterns. In cryptography, modular exponentiation is the core of RSA encryption and Diffie-Hellman key exchange.

What is modular arithmetic and where is it used?

Modular arithmetic is arithmetic "with wraparound" — you count up to a modulus and then start over. Clock arithmetic is the most familiar example: 11 + 3 = 2 (mod 12) because after 12 the clock resets. Calendar arithmetic works similarly: days of the week cycle modulo 7. Cryptography relies heavily on modular arithmetic — RSA encryption uses modular exponentiation to create trapdoor functions that are easy to compute in one direction but hard to reverse without the key.

What does 17 mod 5 equal and how do you verify it?

17 mod 5 = 2. To verify: 17 ÷ 5 = 3 with remainder 2, so 17 = 5 × 3 + 2. The remainder (2) must be non-negative and less than the divisor (5). You can also verify by subtraction: 17 − 5 = 12 − 5 = 7 − 5 = 2 (subtract 5 three times until the result is less than 5). Modular arithmetic statements are written as "17 ≡ 2 (mod 5)" and read as "17 is congruent to 2 modulo 5."

Remainder Calculator — Find the Remainder of Division

Calculates the remainder, quotient, and full division equation for any two numbers.

How to Use the Remainder Calculator

This remainder calculator finds the remainder, quotient, and full division equation for any two numbers — enter the dividend (the number being divided) and the divisor (the number to divide by) and it instantly returns the remainder, quotient, full decimal result, and the complete division equation in the form a = b × q + r. Negative numbers are fully supported. Division by zero shows a clear error message.

Use the Share button to copy a link with your inputs pre-filled. For converting division results to decimals and fractions, see our decimal calculator.

The Remainder Formula

The division algorithm guarantees that for any integers a and b (with b ≠ 0), there exist unique integers q (quotient) and r (remainder) such that:

a = b × q + r, where 0 ≤ r < |b|

To find q and r:

Quotient (q) = floor(a / b) — the largest integer not exceeding a / b
Remainder (r) = a − b × q

Example: a = 29, b = 6 → q = floor(29/6) = 4, r = 29 − 6 × 4 = 5. Division equation: 29 = 6 × 4 + 5.

AdvertisementResponsive Ad

Modulo in Programming

In programming, the modulo operator (written as % in most languages) returns the remainder of division. It is one of the most-used operators in software development:

Even/odd check: n % 2 === 0 is true when n is even
Circular indexing: (i + 1) % length wraps around to 0 after the last element
Clock arithmetic: total_minutes % 60 gives the remaining minutes after whole hours
Grouping into buckets: id % numBuckets assigns items to groups evenly
Cryptography: modular exponentiation powers RSA encryption

Note that JavaScript's % operator uses truncated division for negative numbers, while Python uses floored division. For most practical purposes with positive numbers, the difference does not matter.

Remainder vs. Decimal Division

When you divide 17 by 5, you can express the result two ways:

With remainder: 17 = 5 × 3 + 2 (quotient 3, remainder 2)
As a decimal: 17 / 5 = 3.40

Both are correct — they just express the same information differently. The decimal form (3.40) embeds the remainder as a fractional part: 2/5 = 0.40. Integer (whole-number) contexts require the remainder form — for example, if you have 17 apples to distribute equally to 5 people, each person gets 3 apples and there are 2 left over, which you cannot split further without cutting the apples.

Step-by-Step Example

Problem: Find the quotient and remainder when dividing 43 by 7.

Divide: 43 / 7 = 6.142...
Quotient = floor(43 / 7) = 6
Product = 7 × 6 = 42
Remainder = 43 − 42 = 1
Division equation: 43 = 7 × 6 + 1

Verification: 7 × 6 + 1 = 42 + 1 = 43 ✓. The remainder (1) is less than the divisor (7) ✓.

AdvertisementResponsive Ad

Divisibility Rules and Remainders

Divisibility rules let you quickly determine the remainder from division by small numbers without actually dividing:

Divisible by 2: last digit is even → remainder = 0
Divisible by 3: sum of digits divisible by 3 → remainder = 0
Divisible by 5: last digit is 0 or 5 → remainder = 0
Divisible by 9: sum of digits divisible by 9 → remainder = 0
Divisible by 10: last digit is 0 → remainder = 0

These rules are special cases of modular arithmetic. For example, the rule for divisibility by 9 works because 10 ≡ 1 (mod 9), so 10ⁿ ≡ 1 (mod 9) for any n — meaning each digit contributes its face value to the remainder when dividing by 9. For proportion and ratio problems, our proportion calculator can help you work with ratios and scaling.

Sources & References

Division and Remainders — Khan Academy
Modular Arithmetic — Math Is Fun

Remainder Calculator