All mind maps topics

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

a=bq+ra=bq+rhcfBezout
Bezout's identity
Solvability
Uses

Exam questions on Division theorem, Euclidean algorithm and Bezout's identity

  1. Consider the integers 252252 and 198198.
    Find the lowest common multiple of 252252 and 198198.2 marks
  2. 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 hcf(391,221)=hcf(221,170)\text{hcf}(391,221)=\text{hcf}(221,170).2 marks
  3. Let a=240a=240 and b=46b=46.
    Use the Euclidean algorithm to find the highest common factor of aa and bb.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).