Question

How to find the h.c.f of two number experimentally using euclid division algorithm?

Answer 1

❣️Hi friend ❣️

You can find H.C.F by performing long division method. Keep doing long division until it remainder comes to zero.

Then , after you get zero remainder than u should written in the form of this
;- By taking large number be a and small no. be y ..

Dividend = divisor × quotient + remainder ...

And whose remainder is zero that dividend is Hcf.

Example is shown in attachment..

(*Kindly have a look on image that is attached in this answer.)

Thanks ☄️☄️

Hope it will helpful ☺️☺️