HCF & LCM Formula (GCF × LCM = a × b)

How to Use This HCF & LCM Formula (GCF × LCM = a × b)

Applying the fundamental relation GCF(a, b) × LCM(a, b) = a × b to homework and problem sets follows three structured steps:

1. Identify Numbers a and b: Select two integers for which you wish to analyze the relationship between factors and multiples.
2. Calculate GCF and Product: Find the greatest common factor and compute the simple product a × b.
3. Derive LCM with Formula: Apply LCM(a, b) = (a × b) / GCF(a, b) to find the least common multiple with zero trial division.

Statement of the Formula and Algebraic Proof

The relationship connecting the Highest Common Factor (HCF, also known as GCF) and the Least Common Multiple (LCM) of any two positive integers a and b is one of the most celebrated and practical theorems in elementary number theory. The theorem is formally stated as:
HCF(a, b) × LCM(a, b) = a × b
In words: The product of the HCF and LCM of any two positive integers is equal to the product of the two numbers themselves.

To understand why this formula of hcf and lcm is universally true, consider the prime factorization of the two numbers. Let p be any prime factor that divides either a or b. In their prime factorizations: − The exponent of p in a is denoted as e_a ≥ 0. − The exponent of p in b is denoted as e_b ≥ 0.
When computing the HCF, we select the smaller exponent: min(e_a, e_b). When computing the LCM, we select the larger exponent: max(e_a, e_b).
When we multiply HCF(a, b) by LCM(a, b), the exponent of the prime p becomes min(e_a, e_b) + max(e_a, e_b). For any two real numbers, the sum of their minimum and maximum is identically equal to their sum: min(x, y) + max(x, y) = x + y. Therefore, the prime power in HCF × LCM is p^(e_a + e_b) = p^(e_a) × p^(e_b), which is precisely the prime power present in the product a × b. Because this holds for every prime factor, the product HCF(a, b) × LCM(a, b) equals a × b identically.

Rearranging the Formula to Solve for Unknowns

The product formula enables mathematicians and students to find any one of the four variables if the other three are known. By straightforward algebraic transposition:
1. Finding LCM when HCF is known: LCM(a, b) = (a × b) / HCF(a, b)
2. Finding HCF when LCM is known: HCF(a, b) = (a × b) / LCM(a, b)
3. Finding an unknown number a: a = [HCF(a, b) × LCM(a, b)] / b
4. Finding an unknown number b: b = [HCF(a, b) × LCM(a, b)] / a
This formulation is computationally vital. In computer algorithms, calculating GCF(a, b) using the Euclidean algorithm requires only logarithmic time O(log(min(a, b))). Calculating LCM directly via prime factorization can be slow for massive numbers; using LCM = (a × b) / GCF(a, b) allows instant computation of LCM even for hundred-digit values.

Comprehensive Worked Examples

Review these typical exam problems and real-world applications of the product formula: − Problem 1: Finding LCM Given HCF: The HCF of two numbers is 16 and their product is 3,072. What is their LCM? − Solution: Using LCM = (a × b) / HCF: − LCM = 3072 / 16 = 192. − Problem 2: Finding an Unknown Integer: The HCF and LCM of two numbers are 12 and 360 respectively. If one of the numbers is 72, find the other number. − Solution: Using b = (HCF × LCM) / a: − b = (12 × 360) / 72 − Simplify: 360 / 72 = 5, then 12 × 5 = 60. − The second number is 60. − Verification: 60 = 2² × 3 × 5; 72 = 2³ × 3². HCF = 2² × 3 = 12; LCM = 2³ × 3² × 5 = 360. Correct! − Problem 3: Checking if Numbers Can Have Given HCF and LCM: Can two numbers have 15 as their HCF and 175 as their LCM? − Rule: The HCF must always be a divisor of the LCM! − Test: 175 / 15 = 11 remainder 10 (not an integer). − Conclusion: No, two numbers cannot have HCF = 15 and LCM = 175, because 15 does not divide 175 evenly.

Critical Scope Boundary: Why the Formula Fails for Three Numbers

A widespread misconception among algebra students is assuming that HCF(a, b, c) × LCM(a, b, c) = a × b × c. This does NOT hold for three or more numbers!
To see why, examine a counterexample with three simple integers: a = 4, b = 6, c = 8: − a × b × c = 4 × 6 × 8 = 192. − HCF(4, 6, 8) = 2. − LCM(4, 6, 8) = 24. − HCF × LCM = 2 × 24 = 48. − 48 != 192! The product of the three numbers is four times larger than HCF × LCM.

Why does it fail? Because for three numbers, a prime factor that is shared by two numbers (like 2³ in 8 and 2² in 4) is incorporated into the LCM, but because it is not shared by all three numbers, it is excluded from the HCF. Consequently, it is counted fewer times in the HCF × LCM product than in the product a × b × c.
The correct extended formula for three numbers is:
LCM(a, b, c) = (a × b × c × HCF(a, b, c)) / [HCF(a, b) × HCF(b, c) × HCF(a, c)]

Authoritative Standards and References

The product theorem between common divisors and multiples is a standard fixture in foundational mathematics curricula. For comprehensive theoretical treatments, explore OpenStax Prealgebra Prime Factorization and LCM.

Common Mathematical Results & Factor Patterns

The table below tests the lattice product identity across consecutive, coprime, and composite integer pairs:

Real-World Practical Applications

Common Pitfalls & Mistakes to Avoid

Frequently Asked Questions