Number System
🔒 Log in to trackRemainders & remainder theorem
🔒 Log in to trackDivision algorithm: with .
Remainder of sums/products = remainder of the sum/product of individual remainders. Reduce every number first, then multiply small numbers.
Negative remainders: . Working with keeps numbers tiny; add the divisor at the end if the result is negative.
Large powers: find a small power that gives remainder (e.g. , ), then split the exponent. For a prime not dividing : (Fermat).
Divisor-multiple rule: if leaves remainder with divisor and is a factor of , the remainder with is simply .
Detailed notes
What is a remainder?
When you share 47 sweets among 5 children equally, each gets 9 and 2 are left over. Here 47 is the dividend, 5 the divisor, 9 the quotient and 2 the remainder. The remainder is always smaller than the divisor.
The division formula
. Almost every "find the dividend / divisor" question is just this formula. Example: divisor 24, quotient 13, remainder 17 → dividend .
Rule 1: divisor-multiple rule
If leaves remainder when divided by , and is a factor of , then leaves when divided by . Example: leaves 47. Since , leaves . If is not a factor of , the remainder cannot be fixed.
Rule 2: remainders of sums and products
The remainder of a sum (or product) = remainder of the sum (or product) of the individual remainders. Example: : remainders 1, 3, 5 → → remainder 15. This lets you replace huge numbers by tiny ones before multiplying.
Rule 3: negative remainders
A remainder can be written as a negative number to keep things small. leaves 67, which is the same as . So leaves , i.e. . If your final answer is negative, add the divisor.
Rule 4: large powers
Look for a small power that gives remainder or .
- leaves 1 with 7, so leaves .
- leaves with 13, so leaves 1.
- Base one more than divisor: always leaves 1.
- Base one less than divisor: leaves 1 if is even, if is odd.
- Fermat's rule: if is prime and does not divide , then leaves 1 with .
Rule 5: remainder of , ,
If leaves , then leaves and leaves . Just work with .
Rule 6: successive division
"Divided successively by 3 and 5 leaves remainders 2 and 3" means: divide by 3 (remainder 2), then divide that quotient by 5 (remainder 3). Work backwards from the last step: start with the smallest quotient 0 (or 1 if asked), and rebuild: .
Rule 7: sum of factorials
From onwards every factorial is a multiple of 12, and from onwards a multiple of 10 and 120. So for divided by 12, only matters.
Quick revision
- Dividend = divisor × quotient + remainder; remainder < divisor.
- New divisor is a factor of the old → answer = old remainder mod new divisor.
- Reduce each number first, then add/multiply the remainders.
- Use remainders for big powers; add the divisor to a negative answer.
- ; or .
- Successive division: rebuild from the last divisor backwards.
Types of questions asked
Every way this subtopic shows up in exams — how to recognise it, the formula or logic to use, and a solved example.
Type 1: Remainder with a factor of the old divisorvery common3 practice Q
'A number divided by 527 leaves 64; what is the remainder when it is divided by 17?' — the new divisor divides the old one.
- Check that the new divisor is a factor of the old divisor .
- Answer (divide the old remainder by the new divisor).
Why: is a multiple of , so only decides the remainder.
Example: A number leaves remainder 29 when divided by 91. Find the remainder when it is divided by 13.
, so 13 is a factor. . Answer 3.
Type 2: Remainder of a product or sum of numbersvery common2 practice Q
'Find the remainder when is divided by 17' or a sum of factorials divided by a small number.
- Replace each number by its remainder (negative remainders are allowed).
- Multiply/add the small remainders, reducing again when needed.
- If the final value is negative, add the divisor.
Why: every number is (multiple of ) + remainder, and the multiples of never affect the remainder.
Example: Find the remainder when is divided by 99.
Remainders . Product → add 99 → 93.
Type 3: Remainder of a large powervery common3 practice Q
A power like , or divided by a small number.
- Reduce the base with respect to the divisor.
- Find the smallest power that gives remainder 1 or −1.
- Split the exponent using that power; handle the leftover part.
Why: once some power gives 1, the remainders repeat in a cycle.
Example: Find the remainder when is divided by 7.
. . Remainder 2.
Type 4: Division formula: find dividend, divisor or a new remaindercommon2 practice Q
Relations like 'divisor is 5 times the quotient and 3 times the remainder', or 'a number divided by 68 gives quotient 269 and remainder 0; find the remainder with 67'.
- Write the unknowns in terms of the one given value (usually the remainder).
- Find divisor and quotient, then use the formula.
- For a changed divisor, compute the number first, then divide again.
Why: the formula is the definition of division; everything else is substitution.
Example: In a division, the divisor is 3 times the remainder and the quotient is 12. If the remainder is 7, find the dividend.
Divisor . Dividend .
Type 5: Remainder of $kN$, $N^2$ or a combination, given $N \bmod d$common2 practice Q
'When N is divided by 7 the remainder is 3. Find the remainder when is divided by 7.' Or two numbers' remainders are given and their sum/product is asked.
- Replace by its remainder everywhere.
- Simplify and reduce by .
- Quick check: take the smallest such (e.g. ) and divide directly.
Why: , and every term containing is a multiple of .
Example: N leaves remainder 5 when divided by 9. What remainder does 4N leave?
, . Answer 2.
Type 6: Successive divisionoccasional2 practice Q
'A number is divided successively by 3, 5 and 7 leaving remainders 2, 3, 4' — each divisor acts on the previous quotient.
- Start from the last divisor: take its quotient as 0 (smallest number) unless told otherwise.
- Rebuild backwards: number = divisor × (next number) + remainder.
- For the remainder with the product of divisors, the smallest number itself is the answer.
Why: successive division is just the division formula applied again and again.
Example: Find the smallest number that leaves remainders 1 and 2 when divided successively by 4 and 5.
Last step: quotient 0, so the second number . First number . Check: r 1, r 2 ✓.
Formulas
remainder 1 if n even, d − 1 if n odd
Shortcut tricks
⚡ Make the base ±1
Write the base as (multiple of divisor) ± 1. Then the power collapses to .
Example: Find the remainder when is divided by 16.
, so .
⚡ Negative remainders for products
When the numbers are just below the divisor, use small negative remainders.
Example: Find the remainder when is divided by 99.
.
⚡ Divisor is a multiple — just reduce
If the second divisor is a factor of the first, divide the old remainder by the new divisor. If it is NOT a factor, the answer cannot be found this way.
Example: A number leaves remainder 29 when divided by 56. What is the remainder when it is divided by 8?
, so remainder .
Where students lose marks
Leaving a negative remainder as the final answer — add the divisor.
Using the divisor-multiple rule in reverse: knowing N mod 8 does NOT give N mod 56.
Applying Fermat when the divisor is not prime or divides the base.
Multiplying the big numbers before reducing — wastes time and invites errors.
Practice sets — 17 questions
Sets of 10, mixed across the question types above. Each answer comes with a step-by-step explanation.
Topic test · 10 questions
Suggested time 6 min · wrong answers go to your mistake notebook automatically.