Question

HCF by division method 28 and 33
Answer any one

Answer 1

Answer:

Highest Common Factor of 28, 33 using Euclid's algorithm

HCF of 28, 33 is 1 the largest number which exactly divides all the numbers i.e. where the remainder is zero. ... Highest common factor (HCF) of 28, 33 is 1.