Question

Euclid’s divisions lemma states that for positive integers a and b, there exists unique integers q and r

such that a = bq + r, where r must satisfy

1) 1 < r < b 2) 0 < r < b 3) 0 ≤ r < b 4) 0 < r ≤ b​

Answer 1

Step-by-step explanation:

By dividing both the integers x and y the remainder is zero. 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.