Question

11, 121,33 hcf in three methods​

Answer 1

Answer:

Step-by-step explanation:

Below detailed show work will make you learn how to find HCF of 121,33 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(121,33).

Here 121 is greater than 33

Now, consider the largest number as 'a' from the given number ie., 121 and 33 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 121 > 33, we apply the division lemma to 121 and 33, to get

121 = 33 x 3 + 22

Step 2: Since the reminder 33 ≠ 0, we apply division lemma to 22 and 33, to get

33 = 22 x 1 + 11

Step 3: We consider the new divisor 22 and the new remainder 11, and apply the division lemma to get

22 = 11 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 11, the HCF of 121 and 33 is 11