what do you mean by euclid's division algorithm?
Answers
Answered by
1
Answer:
A method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder is called Euclid's division algorithm.
If it helps you! then,
Plzzzzzzz Mark As Brainliest!!!
Similar questions