Division theorem, Euclidean algorithm and Bezout's identityEdexcel A-Level Further Maths: Subtopic test
10 questions, 27 marks
Edexcel A-Level Further Maths
Division theorem, Euclidean algorithm and Bezout's identity
Total 27 marks
Name
Class
Date
- 1Consider the integers and .(a)Write with . Find .[1 mark]
- A
- B
- C
- D
(b)Use the Euclidean algorithm to find the highest common factor of and .[1 mark]- A
- B
- C
- D
(c)Find the lowest common multiple of and .[2 marks]Total for question 1: 4 marks
- 2A florist has 391 roses and 221 lilies. She makes identical bouquets, using every flower, with each bouquet containing the same number of roses and the same number of lilies.(a)Find the largest number of bouquets she can make.[1 mark]
- A
- B
- C
- D
(b)How many roses are in each bouquet when she makes the largest possible number of bouquets?[1 mark]- A
- B
- C
- D
(c)Explain why .[2 marks]Total for question 2: 4 marks
- 3Let and .(a)Use the Euclidean algorithm to find the highest common factor of and .[3 marks](b)Hence find integers and such that .[4 marks]
Total for question 3: 7 marks
- 4A rectangular patio measures 1547 cm by 504 cm. It is to be covered exactly with identical square tiles, with no tile cut.(a)Use the Euclidean algorithm to find the side length of the largest square tile that can be used. Find the number of tiles this needs.[6 marks](b)(i) Find integers and such that .[6 marks]
(ii) Explain why there are no integers and such that .Total for question 4: 12 marks
End of questions
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).