Question

Euclid's division lemma states that for two positive integers a and b, there exists unique integers q and rr such that $a=bq+r$, where r must satisfy $0\le r\le b$ is this statement true?

Answer 1

required conditions

$0\le r<b$

$a$ is the quotient, $b$ is the divisor $a$ is divided and $r$ is remainder

Remainder cannot be more than divisor