Question

• Euclid's division lemma states that for two positive intègers a and b, there exist unique integers q and r such that a = bq+ r. What condition r must satisfy?​

Answer 1

Answer:

Step-by-step explanation:

0≤r<b

b is divisor

r is shorter than divisor or greater or equal to 0

Please mark it brainliest

And follow me for answers ✌✌✌✌

Answer 2

Q. Euclid's division lemma states that for two positive intègers a and b, there exist unique integers q and r such that a = bq+ r. What condition r must satisfy?

As your statement is correct.

The condition for R to be satisfied is that R is greater or equal to 0 but always less than divisor.

This statement is based on division algorithm that's why it is known as euclid division algorithm.

Dividend = Divisor × quoteient + remainder

The condition must satisfied that :-

$a = bq + r (0 \leqslant R<0)$

where, a is divdend

b is divisor

R is remainder.

For more info Go through this link →https://brainly.in/question/10890310