Question

define the euclid's division Lemma with example?​

Answer 1

$\huge{\fbox{\fbox{\bigstar{\mathfrak{\red{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

Step-by-step explanation:

a=bq+r where 0<or equal to r and r<b