what is euclids division algorithm formula
Answers
Answered by
1
Step-by-step explanation:
The basis of the Euclidean division algorithm is Euclid's division lemma. 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.
Answered by
1
Answer:
a= bq+r,
where b > q > r
For Example,
PLS MARK AS BEST ANSWER AND THANK ME ❤️
Similar questions
History,
8 months ago
India Languages,
8 months ago
Geography,
8 months ago
Social Sciences,
1 year ago
Math,
1 year ago
Physics,
1 year ago
Math,
1 year ago