InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
state the Euclid division algorithm |
| Answer» Let ‘a’ and ‘b’ be any two positive integers. Then there exist unique integers ‘q’ and ‘r’ such that\xa0a = bq + r, 0 ≤ r ≤ b.\xa0\xa0 | |