Divisibility tests can replace long division when you only need to know whether division is exact. Remainder reasoning goes further: it describes every integer with the same leftover amount.
Use tests that match the divisor
Divisibility by 2 depends on an even last digit; by 5 on a last digit of 0 or 5; and by 10 on a last digit of 0. For 4, examine the last two digits. For 8, examine the last three.
Why can earlier digits be ignored for 4? Everything before the last two digits is a multiple of 100, and 100 is divisible by 4. Thus 3,516 is divisible by 4 because 16 is. Similarly, 1,000 is divisible by 8, so the last three digits determine divisibility by 8.
For 3 or 9, add all the digits and test the sum. For 6, check both 2 and 3. Being divisible by only one is insufficient: 15 is divisible by 3 but not 6, while 14 is divisible by 2 but not 6.
Example: a missing digit
The three-digit number is divisible by 9. Which digit belongs in the box?
The digit sum is Since is a digit from 0 through 9, the sum lies from 6 through 15. The only multiple of 9 in that interval is 9, so and The number is 432, and confirms it.
A missing-digit question may have multiple answers. For divisibility by 3 instead, could be 6, 9, 12, or 15, giving digits 0, 3, 6, or 9. Check the stated divisor carefully.
Write the division relationship
For a nonnegative whole number and positive whole divisor , division gives
Here is the whole-number quotient and is the remainder. For example, The remainder is less than the divisor because otherwise another full group could be removed.
Numbers leaving remainder 2 when divided by 5 have the form 2, 7, 12, 17, and so on. Each step of 5 adds a complete group and leaves the leftover unchanged.
Example: combine remainders
One number leaves remainder 4 when divided by 7, and another leaves remainder 5. Their sum leaves the same remainder as because the complete groups of 7 contribute no leftovers. Nine contains another full group of 7, leaving remainder 2.
The answer is not remainder 9: a remainder must be smaller than 7. For a concrete check, use 18 and 26. Their sum is 44, and
For a product, you can multiply the remainders and then reduce again. The product above has the remainder of which is 6 when divided by 7.
Remainders can identify a set of possible numbers
Suppose a whole number leaves remainder 1 when divided by 4 and lies between 20 and 40. List the multiples of 4 in that interval, then add 1: 21, 25, 29, 33, and 37. If it is also divisible by 3, only 21 and 33 remain. An extra condition may narrow the answer, but it need not determine one unique number.
Keep the interval's endpoints clear. “Between 20 and 40” in this example does not create ambiguity because neither endpoint has the required remainder. When an endpoint could qualify, look for wording such as inclusive, at least, or less than.
You can verify each candidate with the division equation. For 33, and This approach is often easier than trying to invent an equation with two unknown quotients. A short, organized list exploits the repeating spacing while checking every stated condition.
Try it yourself
Is 2,736 divisible by 4, 8, and 9? If a number leaves remainder 3 upon division by 5, what remainder does twice that number leave?
Answer: The last two digits, 36, are divisible by 4. The last three, 736, equal The digit sum is 18, so 9 also divides the number. Twice a remainder of 3 produces 6, which leaves remainder 1 after removing a group of 5.
What to remember
Choose the right divisibility test, distinguish a test from a quotient, and always reduce a remainder into the range from zero up to one less than the divisor.