Math, asked by younewhot, 2 months ago

Find the HCF of 85 and 153 by Euclid’s Division Algorithm no​

Answers

Answered by xXMIHIRXx
2

To find the HCF of 85 and 153, we shall find it by Euclid's Division Lemma. Since the remainder is not equal to zero, we shall again apply Euclid's division lemma. Now the remainder is zero, thus the HCF of 85 and 153 is 17. Answer

Similar questions