Question

What is Euclid Division Lemma

Answer 1

$\huge\color{navy}\boxed{\colorbox{red}{Answer}}$

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.

Answer 2

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.

The basis of the Euclidean division algorithm is Euclid’s division lemma. To calculate the Highest Common Factor (HCF) of twopositiveintegers a and b we use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. That means, on dividing both the integers a and b the remainder is zero.

♡♡|| हर हर महादेव ||♡♡