Find the highest common factor (HCF) of 48 and 180.
Note
Using the Euclidean algorithm: gcd(180,48) → 180 mod 48 = 36, 48 mod 36 = 12, 36 mod 12 = 0, so the HCF is 12.
Find the highest common factor (HCF) of 48 and 180.
Using the Euclidean algorithm: gcd(180,48) → 180 mod 48 = 36, 48 mod 36 = 12, 36 mod 12 = 0, so the HCF is 12.