Question

describe euclid division lemma.​

Answer 1

$\huge{\overbrace{\underbrace{\blue {Answers:-}}}}$

According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of the Euclidean division algorithm is Euclid's division lemma.

Step-by-step explanation:

mark my answer to brainliest please...

Answer 2

${\bold{\blue{\underline{\red{An}\pink{sw}\green{er}\purple{:-}}}}}$

☛ For any given positive integers a and b there exist unique whole numbers q and e such that

a = bq + r where 0 ≤ r < b

Here we call a as dibident ,b as divisor and ,q as quotient and r as remainder.

Divident = ( divisor × quotient) + remainder.

Suppose we divide 117 by 14 then we get

8 as quotient and 5 as remainder.

here dividend = 117 divisor = 14 quotient = 8 and remainder = 5

so,

we know that,

Divident = ( divisor × quotient ) + remainder.

117 = (14 × 8) +5

117=117