Division method: This method uses successive division to find the HCF. To find the HCF of two numbers N1 and N2, the smaller of the two, say N1, divides N2. The remainder R1 then divides N1 followed by the remainder R2 dividing R1, and so on till a remainder of 0 is reached. The last divisor is HCF.
Answers & Comments
Answer:
Division method: This method uses successive division to find the HCF. To find the HCF of two numbers N1 and N2, the smaller of the two, say N1, divides N2. The remainder R1 then divides N1 followed by the remainder R2 dividing R1, and so on till a remainder of 0 is reached. The last divisor is HCF.