1.

Use Euclid's division algorithm to find the HCF of;(a) 130 and 220​

Answer»

Euclids Division Algorithm is a TECHNIQUE to COMPUTE the Highest Common FACTOR (HCF) of two GIVEN positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.



Discussion

No Comment Found

Related InterviewSolutions