Euclid's division algorithm is a technique to compute the Highest Common Factor (HCF) of two or three given positive integers.
Euclid's Division Lemma states that for any two positive integers say a and b there exist two unique whole numbers say q and r, such that, a = bq + r, where 0 ≤ r < b.
Welcome to MathsGee Answers, a free online study network where students can ask, answer, and explore 24/7 for improved outcomes.
MathsGee Supporting City of Joburg
Enter your email address: