Loading…
Enter two positive whole numbers to get their exact HCF (GCD) and LCM, computed with the Euclidean algorithm.
HCF is found with the Euclidean algorithm (repeatedly replacing the larger number with the remainder of dividing it by the smaller, until the remainder is 0). LCM is then HCF's natural counterpart: (first number × second number) ÷ HCF — both are exact, not approximated.
More Calculators
Looking for a school or coaching center?
Browse verified listings with real fees and reviews on InstiWise.