Question

6. Use Euclid's division algorithm to find the HCF
of 156 and 13.​

Answer 1

Answer:

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. That means, on dividing both the integers a and b the remainder is zero.

hope it is useful for you and have a sweet day today and please tq my answer guys