using euclid division algorithm find the HCF of 112 and 248​

Sure, here are the steps to find the HCF (Highest Common Factor) of 112 and 248 using Euclid's Division Algorithm:

Step 1: We start by dividing the larger number by the smaller number. So, we divide 248 by 112. The quotient is 2 and the remainder is 24.

Step 2: Now, we replace the larger number with the smaller number and the smaller number with the remainder obtained in the previous step. So, we now divide 112 by 24. The quotient is 4 and the remainder is 16.

Step 3: We repeat the process. Now, we divide 24 by 16. The quotient is 1 and the remainder is 8.

Step 4: We continue the process. Now, we divide 16 by 8. The quotient is 2 and the remainder is 0.

Step 5: When the remainder becomes 0, the divisor at this stage will be the HCF of the given numbers. So, the HCF of 112 and 248 is 8.