answer this fast tommorow my exam
Attachments:
Answers
Answered by
1
hey dear....here is ur ans....
euclid's division algorithm is to apply euclid's division lemma again and again to obtain the hcf of 2 numbers
euclid's division algorithm is to apply euclid's division lemma again and again to obtain the hcf of 2 numbers
Answered by
2
Given positive integer a and b, there exist unique integer q and r satisfing a=bq+r, where 0=< r<b
Hope it is helpful and mark me as brainliest if you satisfied from my answer
Hope it is helpful and mark me as brainliest if you satisfied from my answer
Similar questions