Modular arithmetic and divisibility testsEdexcel A-Level Further Maths: Revision notes
Section 1
Congruence and its properties
Two integers and are congruent modulo , written , when divides ; equivalently and leave the same remainder on division by . Every integer is congruent to exactly one value in , its least non-negative residue. Congruence is an equivalence relation:
- (reflexive);
- if then (symmetric);
- if and then (transitive).
Confusing with . The numbers are equal only after taking remainders.
Section 2
Laws of congruences
If and , then
- addition and subtraction: ;
- multiplication: ;
- powers: for any positive integer . Example: , . Then , and . Reduce at each stage to keep numbers small. For repeated powers, find a power that is : , so .
Replace large numbers by small residues (including negative ones, such as ) before multiplying.
Section 3
Divisibility tests by 2, 5 and 10, and by 4
Because , and , only the last digit matters: divisible by if it is even, by if it is or , by if it is . Because , a number is divisible by if its last two digits form a multiple of : ends in , so it is divisible by 4.
Testing only the last digit for divisibility by . The last two digits matter.
Section 4
Divisibility tests by 3, 9 and 6
Because and , a number is congruent to its digit sum modulo 3 and modulo 9. So it is divisible by if the digit sum is, and by if the digit sum is a multiple of 9. A number is divisible by if it is divisible by both 2 and 3. Example: has digit sum , so it is divisible by neither nor , and so not by .
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 , a number is divisible by if its alternating digit sum is a multiple of (including ). Alternate signs starting from the units digit: for , . For numbers with unknown digits, write each test as an equation or condition, solve each, then combine. Coprime divisors combine: a number divisible by , and is divisible by .
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
- The integers and satisfy and .Find the least positive residue of modulo .2 marks
- The six-digit number .Use a divisibility test to show that is divisible by .2 marks
- Work modulo .Show that .3 marks
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).