HCF and LCM

Highest Common Factor, Least Common Multiple

91 practice questionsUpdate date pendingReview metadata pendingPractice questions

HCF (Highest Common Factor), also known as GCD (Greatest Common Divisor), is the largest number that divides two or more numbers without leaving a remainder. LCM (Lowest Common Multiple) is the smallest number that is a multiple of two or more numbers. HCF and LCM are fundamental concepts used extensively in problems involving divisibility, synchronization of cycles, comparison of fractions, and finding common periods in real-world scenarios such as scheduling and production.

Key formulas and rules

HCF x LCM = Product of two numbers (for exactly two numbers)

HCF(a, b) = |a x b| / LCM(a, b) [valid only for two numbers]

HCF of fractions = HCF of numerators / LCM of denominators

LCM of fractions = LCM of numerators / HCF of denominators

If HCF(a, b) = h, then a = h x m, b = h x n where m and n are co-prime

Co-prime numbers have HCF = 1

Division Method for HCF: Repeatedly divide the larger number by the smaller until remainder is 0; the last non-zero divisor is HCF

Prime Factorisation Method: HCF = product of common factors with minimum powers; LCM = product of all factors with maximum powers

Key concepts

Prime Factorisation Method

Express each number as a product of prime factors. For HCF, take each common prime factor with its MINIMUM power (lowest exponent) across all numbers and multiply them. For LCM, take each prime factor that appears in ANY number with its MAXIMUM power (highest exponent) and multiply them. Example: 12 = 2^2 x 3^1, 18 = 2^1 x 3^2. HCF = 2^1 x 3^1 = 6. LCM = 2^2 x 3^2 = 36.

Division Method (Euclidean Algorithm)

For finding HCF of two numbers, divide the larger number by the smaller and note the remainder. Then divide the previous divisor by this remainder. Repeat until the remainder becomes 0. The last non-zero remainder's divisor is the HCF. This method is especially efficient for large numbers where prime factorisation is impractical. Example: HCF(48, 18): 48 / 18 = 2 remainder 12; 18 / 12 = 1 remainder 6; 12 / 6 = 2 remainder 0 -> HCF = 6.

Worked examples

Example 1

Find the HCF and LCM of 12, 15, and 18 using the prime factorisation method.

Solution

Step 1: Prime factorisation:
12 = 2^2 x 3^1
15 = 3^1 x 5^1
18 = 2^1 x 3^2

Step 2: HCF — take common factors with minimum powers:
Common primes: 2^1 (minimum of 2^2, 2 , 2^1) and 3^1 (minimum of 3^1, 3^1, 3^2)
HCF = 2^1 x 3^1 = 6

Step 3: LCM — take all primes with maximum powers:
2^2 (from 12), 3^2 (from 18), 5^1 (from 15)
LCM = 2^2 x 3^2 x 5^1 = 4 x 9 x 5 = 180

Answer: HCF = 6, LCM = 180

Example 2

Two numbers are co-prime and their product is 105. Find their LCM.

Solution

Step 1: Key property — When two numbers are co-prime (HCF = 1), their LCM equals their product.

Step 2: Since the numbers are co-prime, HCF = 1.

Step 3: Using HCF x LCM = Product of two numbers:
1 x LCM = 105

LCM = 105

Alternative verification: Factor 105 = 3 x 5 x 7. These three factors are all prime and share no common factor, confirming the numbers are co-prime (e.g., 3 and 35, or 5 and 21, or 7 and 15). In each case LCM = 105.

Answer: LCM = 105

Example 3

The HCF of two numbers is 12 and their LCM is 360. If one number is 48, find the other number.

Solution

Step 1: Use the relationship: HCF x LCM = Product of two numbers

Step 2: Given: HCF = 12, LCM = 360, one number = 48

Step 3: Other number = (HCF x LCM) / Given number
Other number = (12 x 360) / 48
Other number = 4320 / 48
Other number = 90

Step 4: Verification:Use prime factorisation to verify the common factors and identify the true HCF.= 12a -> a = 4. So one number is 12 x 4 = 48
The other number = 12b. HCF(48, 12b) = 12 means b and 4 must be co-prime.

LCM(48, 12b) = 12 x 4 x b = 48b
Given LCM = 360 -> 48b = 360 -> b = 7.5 (not integer)

So either the problem has no integer solution with these values, OR we simply use the formula directly:
Other number = (12 x 360) / 48 = 90.

Checking HCF(48, 90):
48 = 2 x 3^1; 90 = 2^1 x 3^2 x 5
HCF = 2^1 x 3^1 = 6 (not 12) — so there's an inconsistency in the problem as stated.

For exam purposes, use the formula: Other = (HCF x LCM) / Given = 90.

Example 4

Three bells ring at intervals of 12 seconds, 15 seconds, and 20 seconds respectively. If they ring together at 9:00 AM, when will they next ring together again?

Solution

Step 1: Identify that this is a classic LCM (bells) problem.

Step 2: Find the LCM of the three intervals: 12, 15, and 20 seconds.

Step 3: Prime factorisation:
12 = 2^2 x 3^1
15 = 3^1 x 5^1
20 = 2^2 x 5^1

Step 4: LCM = 2^2 x 3^1 x 5^1 = 4 x 3 x 5 = 60 seconds

Step 5: The bells will next ring together after 60 seconds = 1 minute.

Step 6: Starting from 9:00 AM, add 1 minute.

Answer: They will next ring together at 9:01 AM.

HCF and LCM

Key formulas and rules

Key concepts

Prime Factorisation Method

Division Method (Euclidean Algorithm)

Relationship Between HCF, LCM and Product

HCF and LCM of Fractions

Co-prime Numbers

Bells and Lights Problems

Finding Numbers Given HCF and LCM

Worked examples

Example 1

Example 2

Example 3

Example 4

Representative solved questions

Question 1

Question 2

Question 3

Common mistakes and useful habits

Ready to test your understanding?

Key formulas and rules

Key concepts

Prime Factorisation Method

Division Method (Euclidean Algorithm)

Relationship Between HCF, LCM and Product

HCF and LCM of Fractions

Co-prime Numbers

Bells and Lights Problems

Finding Numbers Given HCF and LCM

Worked examples

Example 1

Example 2

Example 3

Example 4

Representative solved questions

Question 1

Question 2

Question 3

Common mistakes and useful habits

Ready to test your understanding?

Keep building the same skill family.