Question

to find the hcf of two number experimentally based on euclid division lemma

Answer 1

divide the greater no. by the smaller one . step 2 take the divisor and remainder and then apply division algorithm on it apply the divison algorithm on the divisor and remainder until the remainder comes to 0 then the divisor is the required hcf