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.
Answers & Comments
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.
HOPE IT HELPS
PLEASE MARK ME BRAINLIEST ☺️