Find the HCF following pairs of Euclid's algorithm 32 and 54
Answers
Answered by
0
Answer: HCF of 32, 54, 54 is 2 the largest number which exactly divides all the numbers i.e. where the remainder is zero. ... Highest common factor (HCF) of 32, 54, 54 is 2.
Similar questions