How to Calculate Modulo of A Negative

What is Modulo?

The modulo operation finds the remainder after division of one number by another. For example, 10 divided by 3 is 3 with a remainder of 1, so 10 mod 3 equals 1. The modulo operation is represented by the percent sign (%) in many programming languages.

Modulo operations are widely used in computer science, mathematics, and engineering for tasks like:

• Finding even or odd numbers
• Implementing cyclic patterns
• Hashing algorithms
• Error detection
• Date calculations

Modulo with Negative Numbers

When working with negative numbers in modulo operations, the result can be negative depending on the programming language or mathematical convention being used. This is because the modulo operation is defined differently in different contexts.

In mathematics, the modulo operation is defined as the remainder after division, and it's always non-negative. However, in programming languages like C, C++, and Java, the modulo operation can return a negative result if the dividend is negative.

Formula

The general formula for modulo with negative numbers depends on the programming language or mathematical convention being used. Here are the two common approaches:

In most programming languages, the modulo operation follows the sign of the dividend. This means that if the dividend is negative, the result will also be negative.

Examples

Let's look at some examples to understand how modulo works with negative numbers.

Example 1: Positive Dividend

Calculate 10 mod 3:

• 10 divided by 3 is 3 with a remainder of 1.
• 10 mod 3 = 1

Example 2: Negative Dividend

Calculate -10 mod 3:

• -10 divided by 3 is -4 with a remainder of 2 (since -4 * 3 = -12 and -10 - (-12) = 2).
• -10 mod 3 = 2 (in mathematical convention)
• -10 mod 3 = -1 (in programming languages like C, C++, Java)

Example 3: Negative Divisor

Calculate 10 mod -3:

• 10 divided by -3 is -4 with a remainder of 2 (since -4 * -3 = 12 and 10 - 12 = -2, but we adjust to make the remainder positive).
• 10 mod -3 = 2 (in mathematical convention)
• 10 mod -3 = -1 (in programming languages like C, C++, Java)

Example 4: Both Negative

Calculate -10 mod -3:

• -10 divided by -3 is 3 with a remainder of 1 (since 3 * -3 = -9 and -10 - (-9) = -1, but we adjust to make the remainder positive).
• -10 mod -3 = 1 (in mathematical convention)
• -10 mod -3 = -1 (in programming languages like C, C++, Java)

Modulo in Programming

In most programming languages, the modulo operation follows the sign of the dividend. This means that if the dividend is negative, the result will also be negative.

Here's an example in Python:

# Python example
print(10 % 3)    # Output: 1
print(-10 % 3)  # Output: 2 (in Python 3)
print(10 % -3)  # Output: -2 (in Python 3)
print(-10 % -3) # Output: -1 (in Python 3)

In JavaScript, the modulo operation also follows the sign of the dividend:

// JavaScript example
console.log(10 % 3);    // Output: 1
console.log(-10 % 3);   // Output: 2 (in modern browsers)
console.log(10 % -3);   // Output: -2 (in modern browsers)
console.log(-10 % -3);  // Output: -1 (in modern browsers)