Question

Euclid division algorithm can be applied to ?

Answer 1

highest common factor {HCF}

Answer 2

The basis of the Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.