What is the Euclid's division algorithm?
Answers
Answered by
0
Answer:
If a and b are positive integers such that a = bq + r, then every common divisor of a and b is a common divisor of b and r, and vice-versa.
HOPE IT HELPS..!!
Similar questions