Question

define Euclid division algorithm? ????​

Answer 1

Answer:

Euclid division lemma algorithm ,

a= bq+r , where 0< r<b..

Answer 2

Answer:

Euclid's Division Algorithm :-

To Obtain HCF of two positive Integers say, c and d , with c > d , Follow the Steps below mentioned :-

Step 1 :- Apply E.D.L to c and d. So, we find whole numbers , q and r such that c = dq + r where, 0 ≤ r < d.

Step 2 :- If r = 0, then d is the HCF of c and d. If r ≠ 0, apply d.l to d and r.

Step 3 :- Continue till when Remainder reaches 0, The divisor at this stage will be the Required HCF