state Euclid division algorithm
Answers
Answered by
4
Euclid's Division Lemma: For any two positive integers a and b, there exist unique integers q and r satisfying a = bq + r hope like it bro
IshaArolkar:
i am not bro
sorry
it's ok
thanks sis
welcome
Answered by
6
Euclid's division algorithm is a technique to compute the Highest Common Factor ( HCF ) of two or three given positive integers.
According to this, HCF of any two positive integers a and b , with a > b , is obtained as follows
Step 1. Apply the division Lemma to find q and r, who are a+bq+r, 0 is equal to or smaller than r smaller than b.
Step 2. If r = 0 , the HCF is b. If r ≠ 0 , apply Euclid's division Lemma to b and r.
Step 3. Continue the process till the reminder is zero. The divisor at this stage will be the HCF of a and b .
Hope this helps you dear friend.
According to this, HCF of any two positive integers a and b , with a > b , is obtained as follows
Step 1. Apply the division Lemma to find q and r, who are a+bq+r, 0 is equal to or smaller than r smaller than b.
Step 2. If r = 0 , the HCF is b. If r ≠ 0 , apply Euclid's division Lemma to b and r.
Step 3. Continue the process till the reminder is zero. The divisor at this stage will be the HCF of a and b .
Hope this helps you dear friend.
Similar questions