Question

H.C.F of 22 ,98 division algorith​

Answer 1

Step-by-step explanation:

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

Here 98 is greater than 22

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

Step 1: Since 98 > 22, we apply the division lemma to 98 and 22, to get

98 = 22 x 4 + 10

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

22 = 10 x 2 + 2

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

10 = 2 x 5 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 22 and 98 is 2

Notice that 2 = HCF(10,2) = HCF(22,10) = HCF(98,22) .

Answer 2

Answer:

Prime factories 22

factors are 2 and 11

Prime factories 98

factors are 2,7,7

common factors 2

Therefore, HCF of 22 and 98 is 2