Question

Euclid's division law state that for any positive interesa and there exte positive inter quod such that a byr where must satisfy which of the folk co

​

Answer 1

Answer:

hope it helps you!!

mark me as the brainliest!!

Answer 2

Answer:

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\leq r\leq 0)$

where, a is divdend

b is divisor

R is remainder.