Saved Bookmarks
| 1. |
Divide 1026 with 14 and apply Euclid divide Lemma |
|
Answer» Answer: so Here is Your Answer with details Step-by-step explanation: Euclid’s Division Lemma (lemma is like a theorem) says that given TWO POSITIVE integers a and b, there exist UNIQUE integers q and r such that a = bq + r, 0≤ r In simple words, Euclid's Division Lemma is what you were using to CHECK the accuracy of division in lower classes, which is Dividend = Divisor × Quotient + Remainder. When we divide a=39 by b=5, we get the quotient as q=7 and the remainder as r=4. Here is an example: Euclid's Division Lemma Thus, by Euclid's division lemma, 39 = 5 × 7 + 4. What is Euclid's Division Algorithm? Euclid’s Division Algorithm is the process of APPLYING Euclid’s Division Lemma in succession several times to obtain the HCF of any two numbers. |
|