Saved Bookmarks
| 1. |
What is uclids division algorithm |
|
Answer» Bro no need to study this , it\'s deleted form the portion. I think you should focus on the portion which will come first :) a=bq+r where 0 < r < b According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers\xa0q\xa0and\xa0r\xa0which satisfies the condition\xa0a = bq + r\xa0where 0\xa0≤ 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\xa0a\xa0and\xa0b\xa0we 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\xa0a\xa0and\xa0b\xa0the remainder is zero. |
|