Question

use euclid's division algorithm to find the HCF of 420 and 130​

Answer 1

Answer: highest common factor(HCF) using the euclid's division algorithm is 10.

• 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.

• Euclidean division algorithm is the algorithm of dividing one integer (the dividend) by another (the divisor), in such a way that produces a quotient and a remainder smaller than the divisor.
• A fundamental property is that the quotient and the remainder exist and are unique.