Saved Bookmarks
| 1. |
What is euclid\'s algorithm |
|
Answer» a=bq+r Where a is divedent,b is divisor,q is quotient and r is reminder The algorithm states that the HCF of 2 positive integers a and b with a>b can be obtained by: a=bq+r. HCF(a,b)=HCF(b,r) |
|