Question

Find the HCF of 196 and 38416, using Euclid's algorithm​

Answer 1

Amswer:

The divisor at this stage will be the required HCF. As, in the first attempt only, the remainder comes zero so, the HCF of 196 and 38416 is 196. Hence option D is the correct answer.

Step-by-step explanation:

Answer 2

Answer:

Let us first state Euclid’s division algorithm:

To obtain the HCF of two positive integers, say c and d, with c>d, follow the steps 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 division lemma to d and r.  

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

Now, let us apply the Euclid’s division algorithm to the given numbers 196 and 38416 as follows:

38416=196×196+0

Since the remainder is 0.

Hence, the HCF of 196 and 38416 is 196.

Step-by-step explanation: