Compute the greatest common divisor of 108 and 63 using Euclid's algorithm. Show your intermediate work.
The GCD is therefore 9.
Compute the greatest common divisor of 72 and 30 using Euclid's algorithm. Show your intermediate work.
The GCD is therefore 6.
Home
Syllabus
Assignments
Tests
printable version