Question

How to find hcf of two numbers by euclid's 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 ☺️☺️

Answer 2

Answer:

To obtain the HCF of two positive integers, say c and d with c > d, follow the steps given below:

Step 1: Apply Euclid's Division Lemma, to c and d. So, we find whole numbers, q and r such that c = dq + r,0 ≤ r < d.

Step 2: If r = 0, d is the HCF of c and d. If r = 0, apply the Euclid's Division Lemma to d and r.

Step 3: Continue the process till the remainder becomes 0. The divisor at this stage will be the required HCF.