find out the HCF of 1850 by using Euclid's division algorithm
Answers
Answered by
0
Answer:
HCF of 1850 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero.
Step-by-step explanation:
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 1850, 153 is 1.
HCF(1850) = 1
Similar questions
Social Sciences,
2 months ago
Science,
2 months ago
English,
2 months ago
Math,
3 months ago
India Languages,
3 months ago
Science,
11 months ago
Math,
11 months ago