Question

from Euclid's algorithm a=bq+r gf b=4 then r=​

Answer 1

Step-by-step explanation:

Euclid’s division Lemma:

It tells us about the divisibility of integers. It states that any positive integer ‘a’ can be divided by any other positive integer ‘ b’ in such a way that it leaves a remainder ‘r’.

Euclid's division Lemma states that for any two positive integers ‘a’ and ‘b’ there exist two unique whole numbers ‘q’ and ‘r’ such that , a = bq + r, where 0≤r<b.

Here, a= Dividend, b= Divisor, q= quotient and r = Remainder.

Hence, the values 'r’ can take 0≤r<b.