Question

state eculid division lemma for positive integers a and b​

Answer 1

Step-by-step explanation:

Euclid's division lemma: It states that for any two positive integers a and b there exist unique integers q and r such that a=bq+r, where 0≤r<b. Euclid's Division Algorithm: It is a technique to compute the HCF of two given positive integers. Step 2: If r=0, b is the HCF of a and b.

Answer 2

xjfjfhtufhrdtdh hdhfhfjfjfgj fhhfuffuffjtjk hfjfifififufjftfjfjfggit