1
Question
Why we used Euclid division lemma to find the HCF of two numbers
Open in App
Solution
Dear student,
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.
It is an easier method to find HCF.
It can be used to solve to find HCF between any two largest numbers also not only smaller numbers ( like 2 digit numbers or 3 digit numbers)
Regards
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.
It is an easier method to find HCF.
It can be used to solve to find HCF between any two largest numbers also not only smaller numbers ( like 2 digit numbers or 3 digit numbers)
Regards
Suggest Corrections
0
Similar questions
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
