Question

State euclid's division lemma​

Answer 1

Answer:

Definition

: 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. ... In this example, 9 is the divisor, 58 is the dividend, 6 is the quotient and 4 is the remainder.

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.

Step-by-step explanation:

I hope this helps u