Saved Bookmarks
| 1. |
What is euclid\'s division algorithm |
|
Answer» Again and again use of division lemma till the ans not come Again and again use of division lemma a=bq+r{where o<=ra=bq+r(0<=r) The euclid\'s division algorithm:-a=bq+r(where 0≤r |
|