Saved Bookmarks
| 1. |
What is Euclid division algorithm? |
|
Answer» A=bq+r For any integers a and b, there exist a unique whole number q and r, such that, a= bq+ r, where a = dividend, b= divisor, q = quotient and r = remainder. |
|