ExamShortcut
high importance~2 Q in Tier 133 formulas⚡ 18 shortcuts6 subtopics

Remainders & remainder theorem

🔒 Log in to track

Division algorithm: N=dq+rN = dq + r with 0≤r<d0 \le r < d.

Remainder of sums/products = remainder of the sum/product of individual remainders. Reduce every number first, then multiply small numbers.

Negative remainders: 98≡−1(mod99)98 \equiv -1 \pmod{99}. Working with −1,−2-1, -2 keeps numbers tiny; add the divisor at the end if the result is negative.

Large powers: find a small power that gives remainder ±1\pm 1 (e.g. 23=8≡1(mod7)2^3 = 8 \equiv 1 \pmod 7, 24=16≡−1(mod17)2^4 = 16 \equiv -1 \pmod{17}), then split the exponent. For a prime pp not dividing aa: ap−1≡1(modp)a^{p-1} \equiv 1 \pmod p (Fermat).

Divisor-multiple rule: if NN leaves remainder rr with divisor DD and dd is a factor of DD, the remainder with dd is simply r mod dr \bmod d.

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

Dividend=Divisor×Quotient+Remainder\text{Dividend} = \text{Divisor} \times \text{Quotient} + \text{Remainder} 47=5×9+247 = 5 \times 9 + 2. Almost every "find the dividend / divisor" question is just this formula. Example: divisor 24, quotient 13, remainder 17 → dividend =24×13+17=329= 24 \times 13 + 17 = 329.

Rule 1: divisor-multiple rule

If NN leaves remainder rr when divided by DD, and dd is a factor of DD, then NN leaves r mod dr \bmod d when divided by dd. Example: N÷342N \div 342 leaves 47. Since 342=18×19342 = 18 \times 19, N÷18N \div 18 leaves 47 mod 18=1147 \bmod 18 = 11. If dd is not a factor of DD, 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: (1021×1023×1025)÷17(1021 \times 1023 \times 1025) \div 17: remainders 1, 3, 5 → 1×3×5=151 \times 3 \times 5 = 15 → 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. 67÷6867 \div 68 leaves 67, which is the same as −1-1. So 6767÷6867^{67} \div 68 leaves (−1)67=−1(-1)^{67} = -1, i.e. 68−1=6768 - 1 = 67. If your final answer is negative, add the divisor.

Rule 4: large powers

Look for a small power that gives remainder 11 or −1-1.

  • 23=82^3 = 8 leaves 1 with 7, so 2100=(23)33×22^{100} = (2^3)^{33} \times 2 leaves 1×2=21 \times 2 = 2.
  • 52=255^2 = 25 leaves −1-1 with 13, so 545^4 leaves 1.
  • Base one more than divisor: (d+1)n÷d(d+1)^n \div d always leaves 1.
  • Base one less than divisor: (d−1)n÷d(d-1)^n \div d leaves 1 if nn is even, d−1d - 1 if nn is odd.
  • Fermat's rule: if pp is prime and does not divide aa, then ap−1a^{p-1} leaves 1 with pp.

Rule 5: remainder of kNkN, N2N^2, N3N^3

If N÷dN \div d leaves rr, then kNkN leaves kr mod dkr \bmod d and N2N^2 leaves r2 mod dr^2 \bmod d. Just work with rr.

Rule 6: successive division

"Divided successively by 3 and 5 leaves remainders 2 and 3" means: divide NN 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: x=divisor×next+remainderx = \text{divisor} \times \text{next} + \text{remainder}.

Rule 7: sum of factorials

From 4!=244! = 24 onwards every factorial is a multiple of 12, and from 5!5! onwards a multiple of 10 and 120. So for 1!+2!+⋯+100!1! + 2! + \dots + 100! divided by 12, only 1!+2!+3!=91! + 2! + 3! = 9 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 ±1\pm 1 remainders for big powers; add the divisor to a negative answer.
  • (d+1)n→1(d+1)^n \to 1; (d−1)n→1(d-1)^n \to 1 or d−1d-1.
  • 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
How to spot it:

'A number divided by 527 leaves 64; what is the remainder when it is divided by 17?' — the new divisor divides the old one.

N=Dq+r, d∣D⇒N mod d=r mod dN = Dq + r,\ d \mid D \Rightarrow N \bmod d = r \bmod d
  1. Check that the new divisor dd is a factor of the old divisor DD.
  2. Answer =r mod d= r \bmod d (divide the old remainder by the new divisor).

Why: DqDq is a multiple of dd, so only rr decides the remainder.

Example: A number leaves remainder 29 when divided by 91. Find the remainder when it is divided by 13.

91=7×1391 = 7 \times 13, so 13 is a factor. 29 mod 13=329 \bmod 13 = 3. Answer 3.

Type 2: Remainder of a product or sum of numbersvery common2 practice Q
How to spot it:

'Find the remainder when 1021×1023×10251021 \times 1023 \times 1025 is divided by 17' or a sum of factorials divided by a small number.

(a×b) mod d=[(a mod d)(b mod d)] mod d(a \times b) \bmod d = [(a \bmod d)(b \bmod d)] \bmod d
  1. Replace each number by its remainder (negative remainders are allowed).
  2. Multiply/add the small remainders, reducing again when needed.
  3. If the final value is negative, add the divisor.

Why: every number is (multiple of dd) + remainder, and the multiples of dd never affect the remainder.

Example: Find the remainder when 98×97×9698 \times 97 \times 96 is divided by 99.

Remainders −1,−2,−3-1, -2, -3. Product =−6= -6 → add 99 → 93.

Type 3: Remainder of a large powervery common3 practice Q
How to spot it:

A power like 5705^{70}, 31013^{101} or 6767+6767^{67} + 67 divided by a small number.

ap−1≡1(modp),(d−1)n≡(−1)n(modd)a^{p-1} \equiv 1 \pmod p,\quad (d-1)^n \equiv (-1)^n \pmod d
  1. Reduce the base with respect to the divisor.
  2. Find the smallest power that gives remainder 1 or −1.
  3. 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 21002^{100} is divided by 7.

23=8≡12^3 = 8 \equiv 1. 2100=(23)33×2≡1×22^{100} = (2^3)^{33} \times 2 \equiv 1 \times 2. Remainder 2.

Type 4: Division formula: find dividend, divisor or a new remaindercommon2 practice Q
How to spot it:

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'.

Dividend=Divisor×Quotient+Remainder\text{Dividend} = \text{Divisor} \times \text{Quotient} + \text{Remainder}
  1. Write the unknowns in terms of the one given value (usually the remainder).
  2. Find divisor and quotient, then use the formula.
  3. 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 =21= 21. Dividend =21×12+7=259= 21 \times 12 + 7 = 259.

Type 5: Remainder of $kN$, $N^2$ or a combination, given $N \bmod d$common2 practice Q
How to spot it:

'When N is divided by 7 the remainder is 3. Find the remainder when N3+2NN^3 + 2N is divided by 7.' Or two numbers' remainders are given and their sum/product is asked.

N≡r⇒kN≡kr, N2≡r2(modd)N \equiv r \Rightarrow kN \equiv kr,\ N^2 \equiv r^2 \pmod d
  1. Replace NN by its remainder rr everywhere.
  2. Simplify and reduce by dd.
  3. Quick check: take the smallest such NN (e.g. N=rN = r) and divide directly.

Why: N=dq+rN = dq + r, and every term containing dqdq is a multiple of dd.

Example: N leaves remainder 5 when divided by 9. What remainder does 4N leave?

4×5=204 \times 5 = 20, 20 mod 9=220 \bmod 9 = 2. Answer 2.

Type 6: Successive divisionoccasional2 practice Q
How to spot it:

'A number is divided successively by 3, 5 and 7 leaving remainders 2, 3, 4' — each divisor acts on the previous quotient.

x=d1y+r1, y=d2z+r2, …x = d_1 y + r_1,\ y = d_2 z + r_2,\ \dots
  1. Start from the last divisor: take its quotient as 0 (smallest number) unless told otherwise.
  2. Rebuild backwards: number = divisor × (next number) + remainder.
  3. 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 =2= 2. First number =4×2+1=9= 4 \times 2 + 1 = 9. Check: 9÷4=29 \div 4 = 2 r 1, 2÷5=02 \div 5 = 0 r 2 ✓.

Formulas

Division algorithm
N=d×q+r,0≤r<dN = d \times q + r,\quad 0 \le r < d
Product rule
Rem(a×bd)=Rem(Ra×Rbd)\text{Rem}\left(\frac{a \times b}{d}\right) = \text{Rem}\left(\frac{R_a \times R_b}{d}\right)
Fermat's little theorem
ap−1≡1(modp),p prime, gcd⁡(a,p)=1a^{p-1} \equiv 1 \pmod{p},\quad p \text{ prime},\ \gcd(a,p)=1
Divisor-multiple rule
N≡r(modD), d∣D ⇒ N≡r(modd)N \equiv r \pmod{D},\ d \mid D \ \Rightarrow\ N \equiv r \pmod{d}
Base one more than divisor
(ad+1)n≡1(modd)(ad+1)^n \equiv 1 \pmod{d}
Base one less than divisor
(ad−1)n≡(−1)n(modd)(ad-1)^n \equiv (-1)^n \pmod{d}

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 ±1\pm 1.

Example: Find the remainder when 154715^{47} is divided by 16.

15≡−1(mod16)15 \equiv -1 \pmod{16}, so 1547≡(−1)47=−1≡16−1=1515^{47} \equiv (-1)^{47} = -1 \equiv 16 - 1 = 15.

⚡ Negative remainders for products

When the numbers are just below the divisor, use small negative remainders.

Example: Find the remainder when 98×97×9698 \times 97 \times 96 is divided by 99.

(−1)(−2)(−3)=−6≡99−6=93(-1)(-2)(-3) = -6 \equiv 99 - 6 = 93.

⚡ 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?

56=8×756 = 8 \times 7, so remainder =29 mod 8=5= 29 \bmod 8 = 5.

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.