The remainder, or modulus, is a fundamental concept in arithmetic, representing the amount left over after division. Whether you’re solving simple division problems or tackling complex modular arithmetic, understanding remainders is essential. This guide will help you understand how to calculate remainders, apply the Remainder Theorem, and handle special cases like negative remainders and common factors.
The remainder is the leftover part when one number (the dividend) is divided by another number (the divisor) and the result isn’t a whole number. For example:
The Remainder Theorem states that when a polynomial f(x)f(x) is divided by a linear polynomial x−ax – a, the remainder is simply f(a)f(a).
The remainder theorem follows from polynomial long division, where the equation f(x)=q(x)⋅g(x)+r(x)f(x) = q(x) \cdot g(x) + r(x) holds. If g(x)=x−ag(x) = x – a, then by substituting x=ax = a, we find f(a)=rf(a) = r, where rr is the remainder.
When dividing a sum of numbers by a divisor, the remainder can be calculated by finding the remainder of each term individually.
Example: Find the remainder when 18 × 27 is divided by 13.
If both the dividend (N) and the divisor (D) share a common factor, the calculation of the remainder becomes slightly more complex. Here’s the approach:
When a remainder is negative, it’s common practice to adjust it by adding the divisor to make it positive.
Example: When dividing 13 × 15 by 7, the normal remainder is 6, but using negative remainders, it becomes -1. Adjusting it by adding 7 gives a final remainder of 6.
Euler’s theorem is useful for calculating remainders when working with numbers that are co-prime (i.e., their greatest common divisor is 1). If M and N are co-prime, the remainder when Mϕ(N)M^{\phi(N)} is divided by N is 1, where ϕ(N)\phi(N) is Euler’s totient function.
Fermat’s Little Theorem states that if P is a prime number and N is not divisible by P, then NP−NN^P – N is divisible by P. This is very useful for calculating large powers and remainders in modular arithmetic.
Problem: What is the remainder when (13100 + 17100) is divided by 25?
Solution:
Given the nature of powers of 5, terms with powers of 5 higher than 525^2 will be divisible by 25. Therefore, we focus only on the smaller powers of 5.
After applying the simplification, the remainder is 2.
Problem: A number when divided by 18 leaves a remainder of 7. The same number when divided by 12 leaves a remainder of n. How many values can n take?
Solution:
The possible values of n when divided by 12 are 7 and 1.
Problem: What is the remainder when 1720017200 is divided by 18?
Solution:
Using the concept of negative remainders, reduce the number to a simpler equivalent, resulting in the remainder 1.
Mastering remainder calculations is crucial for many areas of mathematics, from basic arithmetic to advanced number theory. By understanding key concepts like the Remainder Theorem, negative remainders, and Euler’s and Fermat’s theorems, you can approach problems more effectively.