FP2.5.3 Modular arithmetic. Understanding what is meant by two integers a…

Section
FP2.5 Number theory
Level
AS & A level
Statement
Modular arithmetic. Understanding what is meant by two integers a and b to be congruent modulo an integer n. Properties of congruences.
Guidance
The notation a ≡ b (mod n) is expected. Knowledge of the following properties: a ≡ a (mod n) if a ≡ b (mod n) then b ≡ a (mod n) if a≡ b (mod n) and b ≡ c (mod n) then a≡ c (mod n) Addition and subtraction laws for congruences. Multiplication and power laws.
Since 2018
24 parts, 79 marks · topic pages: Number theory: Euclid, Bezout, modular arithmetic and Fermat, Groups: axioms, Cayley tables, subgroups, Lagrange and isomorphism

Back to the checklist

June 2025 · AS Paper 2 (Further Pure 2) · Q1(ii) 2 marks
5 is divided by 11 (ii) Determine the remainder when 179 (2)
June 2025 · AS Paper 2 (Further Pure 2) · Q2(ii)(a) 3 marks
(ii) The group G = {1, 3, 7, 9, 11, 13, 17, 19} has multiplication modulo 20 as its operation. (a) Complete the following Cayley table for G x 20 A copy of this table is given on page 9 if you need to rewrite your Cayley table. (3)
June 2025 · Paper 4A (Further Pure 2) · Q1(a) 3 marks
1. The set S = {1, 3, 5, 9, 11, 13} forms the group G, under the operation multiplication modulo 14 (a) Complete the Cayley table below for the group G x 14 A spare table can be found on page 5 if you need to rewrite your Cayley table. (3)
June 2025 · Paper 4A (Further Pure 2) · Q5(ii) 3 marks
50 modulo 13 (ii) Use Fermat’s Little Theorem to determine the least positive residue of 4 (3)
June 2025 · Paper 4A (Further Pure 2) · Q7(ii) 4 marks
(ii) Use modular arithmetic to solve the congruence equation 36y ≡ 192(mod 40) (4)
June 2024 · AS Paper 2 (Further Pure 2) · Q2(a) 1 mark
2. Tiles are sold in boxes with 21 tiles in each box. The tiles are laid out in x rows of 5 tiles and y rows of 6 tiles. All the tiles from a box are used before the next box is opened. When all the rows of tiles have been laid, there are n tiles left in the last opened box. (a) Write down a congruence expression for n in the form ax + by(mod c) where a, b and c are integers. (1)
June 2024 · AS Paper 2 (Further Pure 2) · Q2(b) 5 marks
Given that • exactly 43 rows of tiles are laid • there are no tiles left in the last opened box (b) use your congruence expression to determine the minimum number of rows of 6 tiles laid. (5)
June 2024 · Paper 4A (Further Pure 2) · Q1 4 marks
1. In this question you must show detailed reasoning. Use Fermat’s Little Theorem to determine the least positive residue of 80 (mod 23) (4)
June 2023 · AS Paper 2 (Further Pure 2) · Q1(a) 2 marks
1. The operation * is defined on the set G = {0, 1, 2, 3} by x * y ≡ x + y – 2xy (mod 4) (a) Complete the Cayley table below. (2)
June 2023 · AS Paper 2 (Further Pure 2) · Q5(i) 3 marks
5. (i) Making your reasoning clear and using modulo arithmetic, show that 6 is divisible by 8 (3)
June 2023 · Paper 4A (Further Pure 2) · Q5(ii) 4 marks
(ii) A combination lock code consists of four distinct digits that can be read as a positive integer, N = abcd, satisfying • all the digits are odd • N is divisible by 9 • the digits appear in either ascending or descending order • N ≡ e (mod ab ) where ab is read as a two-digit number and e is the odd digit that is not used in the code (a) Use the first two properties to determine the four digits used in the code. (b) Hence determine the code on the lock. (4)
June 2022 · AS Paper 2 (Further Pure 2) · Q3(ii) 6 marks
(ii) (a) Complete the following Cayley table for the set X = {2,4,8,14,16,22,26,28} with the operation of multiplication modulo 30 x 30 A copy of this table is given on page 11 if you need to rewrite your Cayley table. (b) Hence determine whether the set X with the operation of multiplication modulo 30 forms a group. [You may assume multiplication modulo n is an associative operation.] (6)
June 2022 · AS Paper 2 (Further Pure 2) · Q4(i)(c) 2 marks
(c) Determine the value c in the set {0,1,2...,415} such that 23 x 72 º c (mod 416) (2)
June 2022 · AS Paper 2 (Further Pure 2) · Q4(ii) 3 marks
(ii) Evaluate 510 (mod 13) giving your answer as the smallest positive integer solution. (3)
June 2022 · Paper 4A (Further Pure 2) · Q7(ii)(a) 2 marks
(ii) A 3-digit positive integer N = abc has the following properties • N is divisible by 11 • the sum of the digits of N is even • N ≡ 8 mod 9 (a) Use the first two properties to show that a – b + c = 0 (2)
June 2022 · Paper 4A (Further Pure 2) · Q7(ii)(b) 4 marks
(b) Hence determine all possible integers N, showing all your working and reasoning. (4)
Nov 2021 · Paper 4A (Further Pure 2) · Q4 7 marks
4. Let G be a group of order 46 46 + 47 Using Fermat’s Little Theorem and explaining your reasoning, determine which of the following are possible orders for a subgroup of G (i) 11 (ii) 21 (7)
Oct 2020 · AS Paper 2 (Further Pure 2) · Q1(a) 3 marks
1. The set G = {1, 3, 7, 9, 11, 13, 17, 19} under the binary operation of multiplication modulo 20 forms a group. (a) Find the inverse of each element of G. (3)
Oct 2020 · Paper 4A (Further Pure 2) · Q8(a) 2 marks
8. The four digit number n = abcd satisfies the following properties: (1) n ≡ 3 (mod 7) (2) n is divisible by 9 (3) the first two digits have the same sum as the last two digits (4) the digit b is smaller than any other digit (5) the digit c is even (a) Use property (1) to explain why 6a + 2b + 3c + d ≡ 3 (mod 7) (2)
Oct 2020 · Paper 4A (Further Pure 2) · Q8(c) 2 marks
(c) Deduce that c ≡ 5(a – 1) (mod 7) (2)
Oct 2020 · Paper 4A (Further Pure 2) · Q8(d) 4 marks
(d) Hence determine the number n, verifying that it is unique. You must make your reasoning clear. (4)
June 2019 · AS Paper 2 (Further Pure 2) · Q2(i) 2 marks
2. (i) Determine all the possible integers a, where a ! 3, such that { mod a (2)
June 2019 · AS Paper 2 (Further Pure 2) · Q2(ii) 3 marks
{ mod then either (ii) Show that if p is prime, x is an integer and x p { 1mod or x x p ≡-1mod p (3)
June 2019 · Paper 4A (Further Pure 2) · Q4(i) 5 marks
4. (i) Use Fermat’s Little Theorem to find the least positive residue of 6542 modulo 13 (5)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.