Question

euclid division lemma definition​

Answer 1

Answer:

hii mate.

Step-by-step explanation:

Euclid's Division Lemma: ...

The basis of Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers...

follow me guys ✌✌✌

Answer 2

$\huge\mathcal{\underline{\underline{Answer:-}}}$

Euclid's Division Lemma is basically termed as :

"For any of the two given positive integers consider it a and b, there always exist unique whole numbers, for example, consider it q and r such that

a = bq + r

where r is greater than or equal to 0 and less than b"

Furthermore, here a is represented as dividend, b for divisor, q for the quotient, and last but not the least, r for remainder, i.e.,

Dividend = (Divisor × Quotient) + Remainder