Use euclid's division algorithm to find the HCF of 318 and 186
Answers
Answered by
0
Step-by-step explanation:
HCF of 186, 875, 318 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.
Consider we have numbers 186, 875, 318 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b
Highest common factor (HCF) of 186, 875, 318 is 1.
HCF(186, 875, 318) = 1
Similar questions