Question

what is euclids division lemma

Answer 1

Hello Mate,

The basis of the Euclidean division algorithm is Euclid's division lemma. It is uesd 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.

Hope this helps you

Answer 2

$\huge\mathfrak\blue{hello}$

Euclid’s division lemma:

Euclid’s division lemma, states that for any two positive integers ‘a’ and ‘b’ we can find two whole numbers ‘q’ and ‘r’ such that a = b × q + r where 0 ≤ r < b.

Euclid’s division lemma can be used to find the highest common factor of any two positive integers and to show the common properties of numbers.

HOPE IT HELP...