what is HCF by Euclid division algorithm
Attachments:
Answers
Answered by
0
In arithmetic, Euclidean division or division with remainder is the process of division of two integers, which produces a quotient and a remainder smaller than the divisor. ... The methods of computation are called integer division algorithms, the best known being long division.
Answered by
0
Euclid division algorithm is done to find HCF (highest common factor ) a smallest no. that can divide the given no. ........the three numbers which are given ...first find out HCF of two no. by EDA
a=bq+r
after finding the HCF of first two no ...then find HCF of ( HCF of first two no. , and third no ) ...this HCF will be ur answer
Similar questions