Division theorem, Euclidean algorithm and Bezout's identityEdexcel A-Level Further Maths: Mind map
Division theorem
Euclidean algorithm
Back substitution
Euclid and Bezout
hcf and integer combinations
hcfBezout
Bezout's identity
Solvability
Uses
Exam questions on Division theorem, Euclidean algorithm and Bezout's identity
- Consider the integers and .Find the lowest common multiple of and .2 marks
- A 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.Explain why .2 marks
- Let and .Use the Euclidean algorithm to find the highest common factor of and .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).