Question

Euclid division lemma is a restatement of

Answer 1

Answer:

every positive p and q integer exist an unique integer a+bq=r

Answer 2

Euclid division lemma:

1) Euclid division lemma states that if two positive integers x and y, then there exists unique integers q and r which satisfies the condition that

x = yq + r,  where 0 ≤ r ≤ b.

2) Here r is reminder, q is quotient, y is divisor and x is dividend.

3) Euclid division lemma is the proven statement of the Euclid division Algorithm.

4) Euclid Division Algorithm is the way to find the Highest Common Factor of two positive integers.

5)Highest common factor of two positive integers a and b is the largest positive integer d that divides both a and b.