Question

proof that remainder is always smaller than ddivisior plz proof mathmatically by Euclid's division lemma ​

Answer 1

Answer:

plz mark me as brainlist ✌️ ✌️☺️ ☺️☺️☺️☺️☺️

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.