All revision notes topics

Modular arithmetic and divisibility testsEdexcel A-Level Further Maths: Revision notes

Section 1

Congruence and its properties

Two integers aa and bb are congruent modulo nn, written a≡b(modn)a\equiv b\pmod n, when nn divides a−ba-b; equivalently aa and bb leave the same remainder on division by nn. Every integer is congruent to exactly one value in {0,1,…,n−1}\{0,1,\dots,n-1\}, its least non-negative residue. Congruence is an equivalence relation:

  • a≡a(modn)a\equiv a\pmod n (reflexive);
  • if a≡ba\equiv b then b≡ab\equiv a (symmetric);
  • if a≡ba\equiv b and b≡cb\equiv c then a≡ca\equiv c (transitive).
Key termscongruentresidue
Common mistake

Confusing a≡b(modn)a\equiv b\pmod n with a=ba=b. The numbers are equal only after taking remainders.

Section 2

Laws of congruences

If a≡ba\equiv b and c≡d(modn)c\equiv d\pmod n, then

  • addition and subtraction: a±c≡b±da\pm c\equiv b\pm d;
  • multiplication: ac≡bdac\equiv bd;
  • powers: ak≡bka^k\equiv b^k for any positive integer kk. Example: a≡4a\equiv4, b≡7(mod9)b\equiv7\pmod9. Then a+b≡11≡2a+b\equiv11\equiv2, ab≡28≡1ab\equiv28\equiv1 and a2−3b≡16−21=−5≡4a^2-3b\equiv16-21=-5\equiv4. Reduce at each stage to keep numbers small. For repeated powers, find a power that is ≡1\equiv1: 35=243≡1(mod11)3^5=243\equiv1\pmod{11}, so 3102=(35)2032≡93^{102}=(3^5)^{20}3^2\equiv9.
Key termspower law
Exam tip

Replace large numbers by small residues (including negative ones, such as 10≡−1(mod11)10\equiv-1\pmod{11}) before multiplying.

Section 3

Divisibility tests by 2, 5 and 10, and by 4

Because 10≡0(mod2)10\equiv0\pmod{2}, (mod5)\pmod5 and (mod10)\pmod{10}, only the last digit matters: divisible by 22 if it is even, by 55 if it is 00 or 55, by 1010 if it is 00. Because 100≡0(mod4)100\equiv0\pmod4, a number is divisible by 44 if its last two digits form a multiple of 44: 372 416372\,416 ends in 1616, so it is divisible by 4.

Key termsdivisibility test
Common mistake

Testing only the last digit for divisibility by 44. The last two digits matter.

Section 4

Divisibility tests by 3, 9 and 6

Because 10≡1(mod3)10\equiv1\pmod3 and (mod9)\pmod9, a number is congruent to its digit sum modulo 3 and modulo 9. So it is divisible by 33 if the digit sum is, and by 99 if the digit sum is a multiple of 9. A number is divisible by 66 if it is divisible by both 2 and 3. Example: 372 416372\,416 has digit sum 2323, so it is divisible by neither 33 nor 99, and so not by 66.

Key termsdigit sum
Exam tip

To make a number divisible by 9 with one unknown digit, subtract the other digits' sum from the next multiple of 9.

Section 5

Divisibility test by 11 and unknown digits

Because 10≡−1(mod11)10\equiv-1\pmod{11}, a number is divisible by 1111 if its alternating digit sum is a multiple of 1111 (including 00). Alternate signs starting from the units digit: for 372 416372\,416, 6−1+4−2+7−3=116-1+4-2+7-3=11. For numbers with unknown digits, write each test as an equation or condition, solve each, then combine. Coprime divisors combine: a number divisible by 44, 99 and 1111 is divisible by 396396.

Key termsalternating sum
Common mistake

Testing for 11 by the digit sum. It is the alternating sum that is used.

That's the notes covered.

Carry on to the next subtopic.

Exam questions on Modular arithmetic and divisibility tests

  1. The integers aa and bb satisfy a≡4(mod9)a\equiv4\pmod9 and b≡7(mod9)b\equiv7\pmod9.
    Find the least positive residue of a2−3ba^2-3b modulo 99.2 marks
  2. The six-digit number N=372 416N=372\,416.
    Use a divisibility test to show that NN is divisible by 1111.2 marks
  3. Work modulo 1111.
    Show that 35≡1(mod11)3^5\equiv1\pmod{11}.3 marks
See the full worksheet

Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).