Question

how to explain euclidean lemma
​

Answer 1

$\huge{\bf{\blue {\fbox{\underline{\color{red}{HEY\:MATE}}}}}}$

♕ $\boxed{Here\:is\:your\:@nswer}$♕

$\huge\mathfrak{\orange{♠♠♠♠♠♠♠♠♠♠}}$

$\huge\bf{\pink{Lemma}}$

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.

$\huge\mathfrak{\orange{♠♠♠♠♠♠♠♠♠♠}}$

$<marquee direction="up" >❤️Please Follow Me❤️</marquee>$

$\huge{\bf{\red {\fbox{\underline{\color{blue}{@ayush579}}}}}}$

$\huge{\bf{\green {\fbox{\underline{\color{brown}{Follow Me}}}}}}$

‌$<marquee direction="left" >❗✌️IT WILL BE HELP YOU✌️❗</marquee>$

‌

Answer 2

Answer:

Given positive integer a,b their exist the unique integers q,r

satisfying a =bq+r

where 0_<r<b