Question

Write euclids division lemma

Answer 1

Euclid's Division Lemma:-
Any positive integer 'a' and 'b' , there exists a unique integer 'q' nd 'r' satisfying a=bq+r
where; 'r' is greater than or equal to zero but less than 'b'...



Hope it helps..
Hope U have get that...
mark as brainliest

Answer 2

Answer:

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ 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 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.

I HOPE THIS WILL HELPFULL TO YOU