Question

24.
05. According to Euclid's division algorithms HCF of any
two positive integers a and b with a >b is obtained by
applying Euclid's division lemma to a and b to find a
and r such that a=bq+r, then write the limination of r.​

Answer 1

Answer:

r will be lesser than b

and, r will be lesser or equal to zero

mark it down the brainliest answer and follow back for more help