euclid division algorithm
Answers
Answered by
9
Answer:
a=bq+r
Dividend = Divisior * Quotient + Remainder
Answered by
2
Step-by-step explanation:
Euclid division algorithm states that given a positive integers a and b there exist unique integers q and r satisfying
a=bq+r
0<r<b<a
please mark as brainliest please
Similar questions