Question

32
Euclid's division algorithm is a
repeated application of division
lemma until we get remainder as
A)1
B)0
C)infinitive
D)none of these​

Answer 1

Answer:

B) 0

Step-by-step explanation:

We should divide lemma until we get

Remainder 0