Mathematics — first biennium · Lesson
The GCD can be found with successive divisions; the LCM follows quickly from the GCD.
In this lesson: Compute GCD and LCM while understanding Euclid's successive-division method.
How to proceed: For Euclid, divide the larger number by the smaller and replace the pair with divisor and remainder. When the remainder is 0, the last divisor is the GCD.
You can already assume: Divisibility and prime numbers.
Completed exercises: 0/5 · Correct on first attempt: 0
For Euclid, divide the larger number by the smaller and replace the pair with divisor and remainder. When the remainder is 0, the last divisor is the GCD.
ConceptStep separates what is required from what is recommended or useful as reinforcement. Only required prerequisites block your progress.
Relationships: solid line = required · dashed line = recommended · dotted line = reinforcement.