Saved Bookmarks
| 1. |
4) If qandr are two integers in Euclid's division lemma a = b q + r, then the value of ris A) 0 |
|
Answer» ng to Euclid’s DIVISION Lemma if we have two positive integers a and b, then there exist UNIQUE integers q and r which satisfies the condition a = bq + r where 0 ≤ r < b.The basis of the 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. That means, on dividing both the integers a and b the remainder is zero. |
|