Question

Theoram1.1(euclid's divison lemma)​

Answer 1

Answer:

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.

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.

Answer 2

Answer:

according to euclids division lemma if you have two postive integers a and b there exists a unique integer q and r which satisfies the condition a=bq+r where r is in between 0 and b (it can be 0 and b too)