What is the hcf of 13 and 72 by Euclid\'s theorem

1.	What is the hcf of 13 and 72 by Euclid\'s theorem
Answer» Using Euclid\'s Division Lemma a=bq+r Where, 0<_ r The HCF (72, 13) by Euclid\'s algorithm/theorem is:a = bq + r (0<_r

Discussion