Question

State Euclid's Division Lemma​

Answer 1

HEY MATE

HEY MATE UR ANSWER IS

HEY MATE UR ANSWER IS 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.

HEY MATE UR ANSWER IS 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 two positive integers a and b we use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.

MARK AS BRAINLIEST

Answer 2

⤵HERE IS YOUR ANSWER MATE⤵

According to Euclid’s Division Lemma

if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r

where 0 ≤ r ≤ b .

Eg

If we have two integers a=27 and b=4

Then 27= 4×6 + 3,

Where q= 6 and r= 3(less than b=4) are also integers.

☺HOPE THIS ANSWER WILL HELP YOU☺

FOLLOW ME AND MY FOLLOWING✌