How we find hcf of 21658 and 8624 by use Euclid division algorithm?

Answer 1

To find the HCF (highest common factor) of 21658 and 8624 using the Euclidean division algorithm, we repeatedly divide the larger number by the smaller number and take the remainder. We start by dividing 21658 by 8624, which gives a quotient and a remainder. We then replace the larger number with the smaller number and the smaller number with the remainder. This process continues until the remainder is zero; the last non-zero remainder is the HCF. In this case, the HCF of 21658 and 8624 is 2.