Question

State Euclid's division lemma theorem

Answer 1

Step-by-step explanation:

it is a long division method used in divisibility of integers

Easy pisy lemeon creezy

Answer 2

Answer:

$\huge\fbox{\tt \huge \pink {\o { \color{lime}Euclid's \: division \: lemma}}}$

Euclid's Division Lemma (lemma is similar to a theorem) says that given two positive integers, 'a' and 'b', there exist unique integers, 'q' and 'r', such that: a = bq+r, where 0 ≤r <b. The integer 'q' is the quotient and the integer 'r' is the remainder.

Or

Euclid's Division Lemma states that, if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b.

Step-by-step explanation:

thx bappe