what is Euclid's division algorithm
Answers
Answered by
9
It is a technique to compute HCF of two given positive integer , say a nd b with a>b , in the following steps :-
1) On dividing a by b , we get the quotient Q nd remainder R such that a = bq+r , where 0<_r <b .
2) If r = 0 then HCF (a,b) .
if r is not equal to 0 then apply Devision lemma to B nd R .
3) Continue the process till the remainder is 0 .
The last divisor will be required HCF .
1) On dividing a by b , we get the quotient Q nd remainder R such that a = bq+r , where 0<_r <b .
2) If r = 0 then HCF (a,b) .
if r is not equal to 0 then apply Devision lemma to B nd R .
3) Continue the process till the remainder is 0 .
The last divisor will be required HCF .
Answered by
1
Answer:
Step-by-step explanation:
Attachments:
Similar questions