state euclid division lemma
Answers
Answered by
2
Step-by-step explanation:
even positive integers a and b their exists unique integers q and r satisfying
a=bq+r
o=<r<b
Answered by
0
by help of Euclid division lemma
we can find hcf easily
Euclid division lemma=a=bq+r
where a is always greater than b
q is quotient and r is remainder
Similar questions