Question

Find hcf of 850 and 680 with help of euclid devison method
​

Answer 1

Answer:

This algorithm involves the operation of dividing and calculating remainders.

'a' and 'b' are the two positive integers, 'a' >= 'b'.

Divide 'a' by 'b' and get the remainder, 'r'.

If 'r' = 0, STOP. 'b' = the GCF (HCF, GCD) of 'a' and 'b'.

Else: Replace ('a' by 'b') & ('b' by 'r'). Return to the division step above.

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

850 ÷ 680 = 1 + 170;

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

680 ÷ 170 = 4 + 0;At this step, the remainder is zero, so we stop:

170 is the number we were looking for, the last remainder that is not zero.

This is the greatest common factor (divisor).

Greatest (highest) common factor (divisor):

gcf, hcf, gcd (850; 680) = 170

Step-by-step explanation:

hope it helps u

nd follow me