Join 60,000+ competitive exam aspirants
Find the highest common factor (HCF) of the two numbers 64 and 148.
4
2
3
6
4
Use the division method: Divide the larger number by the smaller one, then use the remainder to divide the previous divisor until the remainder is 0.
Two numbers are 64 and 148.
HCF(a,b)=HCF(a,bтИТa)┬аor┬аEuclidean┬аAlgorithm┬аa=bq+r
Use the division method: Divide the larger number by the smaller one, then use the remainder to divide the previous divisor until the remainder is 0.
Many students mistake the HCF for the LCM or divide incorrectly, failing to reduce the divisor repeatedly until the final remainder is zero.
Divide 148 by 64
Perform long division: 148=64├Ч2+20. The remainder is 20.
148=64├Ч2+20
Divide 64 by 20
Use the previous divisor (64) and the remainder (20): 64=20├Ч3+4. The remainder is 4.
64=20├Ч3+4
Divide 20 by 4
Use the previous divisor (20) and the remainder (4): 20=4├Ч5+0. The remainder is 0.
20=4├Ч5+0
Final Conclusion
Since the remainder is 0, the last divisor is the HCF.
HCF=4
A is correct because the HCF of 64 and 148 is 4, derived using the Euclidean algorithm by finding the last non-zero remainder.
Understanding the Euclidean algorithm for HCF is essential for simplifying complex fractions and solving LCM-HCF relationship problems (LCM├ЧHCF=a├Чb).