Question

what is formula of Euclid division lemma​

Answer 1

Answer:

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. ... HCF is the largest number which exactly divides two or more positive integers.

Step-by-step explanation:

Please mark as brainliest

Answer 2

Answer:

Euclid’s Division Lemma (lemma is similar to a theorem) says that given two positive integers, a and b, there exists unique integers, q and r, such that:

a=bq+r,0⩽r<b

The integer q is the quotient and the u r is the remainder.

The quotient and the remainder are unique.

In simple words, Euclid's Division Lemma statement is that if we divide an integer by another integer (non-zero integer), we will get a unique integer as quotient and a unique integer as remainder.