How to Find GCF and LCM: Complete Dual Guide with Steps
The Greatest Common Factor (GCF/HCF) and Least Common Multiple (LCM) are dual mathematical operators in arithmetic and number theory. While GCF identifies the largest shared divisor to reduce quantities, LCM finds the smallest shared multiple to harmonize units and denominators.
Prime Factorization for GCF (HCF)
To compute GCF using prime factorization:
- Find the prime factors of each number.
- Identify only common prime factors present in all numbers.
- Raise each common prime to its lowest exponent.
- Multiply these prime powers together.
Prime Factorization for LCM
To compute LCM using prime factorization:
- Find the prime factors of each number.
- Identify all distinct prime factors present in any number.
- Raise each prime to its highest exponent.
- Multiply all these prime powers together.
The Fundamental Product Theorem: GCF ร LCM = a ร b
For any two positive integers a and b, the product of their Greatest Common Factor and Least Common Multiple always equals the product of the two integers:
GCF(a, b) ร LCM(a, b) = a ร b
For example, with 12 and 18: GCF = 6 and LCM = 36. Since 6 ร 36 = 216 and 12 ร 18 = 216, the result is mathematically verified!
Frequently Asked Questions (FAQs)
Can GCF ever be greater than LCM?
No. For positive integers, GCF โค numbers โค LCM. GCF only equals LCM when all numbers are identical (e.g. GCF(7, 7) = 7 and LCM(7, 7) = 7).
How do you find GCF and LCM for 3 or more numbers?
You can compute pairwise: GCF(a, b, c) = GCF(GCF(a, b), c) and LCM(a, b, c) = LCM(LCM(a, b), c). Alternatively, the prime factorization method inspects min/max powers across all three numbers at once.