What do you mean by Euclid\'s division lema

1.	What do you mean by Euclid\'s division lema
Answer» According to Euclid’s Division Lemma if we have two positive integers a and b, then there exists unique integers\xa0q\xa0and\xa0r\xa0which satisfies the condition\xa0a = bq + r\xa0where 0\xa0≤ r ≤ b.The basis of 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. By exactly we mean that on dividing both the integers\xa0a\xa0and\xa0b\xa0the remainder is zero.

Discussion