Question

Find the HCF of 680 and 850 using Euclid's division algorithmn. Using this find their LCM

Answer 1

Answer:

HCF of 850, 680 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm. Highest common factor (HCF) of 850, 680 is 170.

Step-by-step explanation:

thanks I used the way home from the way