Question

Find HCF of 120,23 by Euclid's division algorithm???
​

Answer 1

Answer:

with step explanation

Answer 2

Answer:

1

Step-by-step explanation:

Step 1. Divide the larger number by the smaller one:

120 ÷ 23 = 5 + 5;

Step  2. Divide the smaller number by the above operation's remainder:

23 ÷ 5 = 4 + 3;

Step  3. Divide the remainder from the step 1 by the remainder from the step 2:

5 ÷ 3 = 1 + 2;

Step 4. Divide the remainder from the step 2 by the remainder from the step 3:

3 ÷ 2 = 1 + 1;

Step 5. Divide the remainder from the step 3 by the remainder from the step 4:

2 ÷ 1 = 2 + 0;

At this step, the remainder is zero, so we stop:

1 is the number we were looking for

This is the greatest common factor (divisor).

Greatest (highest) common factor (divisor):

gcf, hcf, gcd (120; 23) = 1

HOPE IT HELP