Question

state euclid division lemma for integers

Answer 1

euclid's division Lemma is very simple and is based on the formula:
dividend = divisor × quotent + remainder .
moreover it is simply a division

Answer 2

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 its helpful for u !!
Please mark it as brainlist !!