Question

State Euclid’s Division Lemma.

Answer 1

Answer:

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.

______________________________________

${\huge{\overbrace{\underbrace{\green{thanks}}}}}$

[source : Class 10th book( IIT foundation)]

Answer 2

$❤️ANSWER❤️$

Explanation:

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