Saved Bookmarks
| 1. |
what is euclids division lemma |
|
Answer» a= bq + r Given positive integers a and b there exist unique integer q and r satisfying a=bq+r, The basis of Euclidean division algorithm is Euclid\'s division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid\'s division algorithm. HCF is the largest number which exactly divides two or more positive integers. |
|