Remainders describe cyclic behavior. A large integer may be difficult to calculate exactly but easy to understand after all complete groups of a divisor are removed.
The division equation controls the remainder
For an integer and positive integer , write with integer and This convention gives one possible remainder. For example, so the nonnegative remainder upon division by 5 is 2, not
For positive integers, the equation also prevents a common mistake: a remainder cannot equal or exceed the divisor. If a calculation gives a leftover of 17 when dividing by 6, remove two more groups and report remainder 5.
The notation means that a and have the same remainder when divided by . Equivalently, is divisible by . You can use the reasoning without memorizing the notation.
Why divisibility tests work
Complete tens are divisible by 2 and 5, so the final digit controls those tests. Complete hundreds are divisible by 4, so only the last two digits matter for 4. Complete thousands are divisible by 8, so only the last three digits matter for 8.
For 9, each power of ten leaves remainder 1. Therefore a number and its digit sum have the same remainder upon division by 9. The same argument works for 3. Thus 7,452 has remainder 0 for both because its digit sum is 18.
To test divisibility by 6, require divisibility by 2 and 3. Do not generalize carelessly: divisibility by 4 and 6 guarantees divisibility by their LCM, 12, but not necessarily by their product, 24. The number 12 is a counterexample.
Example: compute with remainders
Suppose a leaves remainder 5 upon division by 7, and leaves remainder 4. The expression has the same remainder as Removing three groups of 7 leaves 2.
Why is substitution legitimate? Write and Then The first part is a multiple of 7 and does not affect the remainder.
The same argument justifies multiplying remainders. But ordinary division cannot be used freely: from two even numbers you cannot infer their quotient's remainder by dividing two zeros. Division changes the information available.
Example: find a last digit with a cycle
The last digits of powers of 3 repeat: ends in 3, in 9, in 7, and in 1. Multiplying by 3 begins the cycle again.
To find the last digit of divide 202 by 4. Since use the second position of the cycle: the last digit is 9. A remainder of zero would mean the fourth position, not a nonexistent zeroth position in the displayed list.
This method finds the remainder modulo 10, not the entire power. It is useful precisely because the question only asks for that information.
Combine a remainder condition with a range
Find an integer between 50 and 80 that leaves remainder 2 upon division by 5 and remainder 1 upon division by 3. The first condition produces candidates 52, 57, 62, 67, 72, and 77. Testing division by 3 leaves 52 and 67. The conditions do not identify a unique number.
These two solutions differ by 15, the LCM of the divisors 5 and 3. Adding 15 preserves both remainders because it adds a complete number of groups for each divisor. If the question also requires to be odd, 67 becomes the unique candidate in the stated range.
This example separates finding a candidate from finding all candidates. A single successful number does not prove uniqueness. Use an organized list, a periodicity argument, or both to account for the entire allowed interval. Also verify what “between” means when endpoints could satisfy the conditions; inclusive or strict bounds can change a count.
Try it yourself
A number leaves remainder 6 when divided by 8. Find the remainder of upon division by 8. Then find the last digit of
Answer: Substitute 6: leaving remainder 6. Powers of 7 have last digits 7, 9, 3, 1; 15 leaves remainder 3 upon division by 4, so the last digit is 3.
What to remember
Replace numbers by their remainders for sums and products, then reduce again. Explain cycles and their positions carefully, and do not treat division as an automatically valid remainder operation.