Question

Euclids lemma states for any positive integers a and b unique integers q and r such that a=bq+r must satisfy which inequality​

Answer 1

Answer:

Euclids lemma states for any positive integers a and b unique integers q and r such that a=bq+r must satisfy which inequality

Answer 2

Answer:

Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.

$\: \: \: \:$