Saved Bookmarks
| 1. |
II.Answer the following.9)6x1-6Define Euclid's division Lemma |
|
Answer» Euclid’s Division Lemma: According to Euclid’s Division Lemma if we have two positive integers a and b, then there exists unique integersqandrwhich satisfies the conditiona = bq + rwhere 0≤ r ≤ b. The basis of Euclidean division algorithm is Euclid’s division lemma. To calculate the Highest Common Factor (HCF) of two positive integersaandbwe use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the |
|