Question

what do you mean by Euclid division lemma​

Answer 1

Hello Dear ✔️✔️↙️↙️

Euclid's Division Lemma states that, if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b. ... Let us take an example of the division of positive integer by positive integer, say 58 by 9.

I hope it's helps you

Answer 2

Euclid’s Division Lemma:

According to Euclid’s Division Lemma if we have two positive integers a and b, then e exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.

The basis of 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. By exactly we mean that on dividing both the integers a and b the remainder is zero.

Let us now get into the working of this euclidian algorithm.

Consider we have two numbers 78 and 980 and we need to find the HCF of both of these numbers. To do this, we choose the largest integer first, i.e. 980 and then according to Euclid Division Lemma, a = bq + r where 0 ≤ r ≤ b;