HCF: HCF (12, 18) = 6, HCF(6, 24) = 6, HCF(12, 18, 24) = 6
LCM: LCM(12, 18) = 36, LCM(36, 24) = 72, LCM(12, 18, 24) = 72
Ans: HCF = 6, LCM = 72
Basic Concepts / āĻŽā§āϞāĻŋāĻ āϧāĻžā§°āĻŖāĻž
Formula: LCM × HCF = Product of two number
Ex : 12 and 18
Best Tricks for LCM / LCM
Trick 1: Prime Factorisation / āĻŽā§āϞāĻŋāĻ āĻā§āĻŖāύā§āϝāĻŧāĻ āĻāĻžāĻāύāĻŋ
Break each number into prime factors, take the highest power of each prime, multiply. āĻĒā§ā§°āϤāĻŋāĻā§ āϏāĻāĻā§āϝāĻž āĻŽā§āϞāĻŋāĻ āϏāĻāĻā§āϝāĻžāϤ āĻāĻžāĻāĻŋ āϞā§ā§ąāĻž, āĻĒā§ā§°āϤāĻŋāĻā§ āĻŽā§āϞāĻŋāĻ āϏāĻāĻā§āϝāĻžā§° āϏ⧰ā§āĻŦāĻžāϧāĻŋāĻ āĻāĻžāϤ āϞ⧠āĻā§āĻŖ āĻā§°āĻžāĨ¤
Ex: LCM (24,30,40)
Trick 2: Division Method / āĻāĻžāĻ āĻĒāĻĻā§āϧāϤāĻŋ: Divide numbers simultaneously until all become 1, multiply all divisors = LCM. āϏāĻāĻā§āϝāĻžāĻŦā§ā§° āĻāĻā§āϞāĻā§ āĻāĻžāĻ āĻā§°āĻŋ āϝā§ā§ąāĻž āϝā§āϤāĻŋāϝāĻŧāĻžāϞā§āĻā§ āϏāĻāϞ⧠1 āύāĻšāϝāĻŧ, āĻļā§āώāϤ āϏāĻŦ āĻāĻžāĻāĻā§° āĻā§āĻŖāĻĢāϞ = LCMāĨ¤
Trick 3: Observation / Shortcut / āĻĒā§°ā§āϝāĻŦā§āĻā§āώāĻŖ: Multiply the largest number and adjust by smaller numbers’ factors. āĻŦāĻĄāĻŧ āϏāĻāĻā§āϝāĻžāĻā§āĻ āϞ⧠āĻā§āĻŖ āĻā§°āĻŋ āϏ⧰ā§āĻŦā§ā§°ā§° āĻā§āĻŖāύā§āϝāĻŧāĻ āĻŦāĻžāĻĻ āĻĻāĻŋāϝāĻŧāĻžāĨ¤
Ex: LCM(24,36,48) → 48×3×1 = 144
Trick 4: Same Remainder Problems / āĻāĻā§ āĻ āĻŦāĻļāĻŋāώā§āĻ āϏāĻŽāϏā§āϝāĻž: If a number leaves same remainder r when divided by a,b,c → Number = LCM(a,b,c) + r. āϏāĻāĻā§āϝāĻž āϝā§āϤāĻŋāϝāĻŧāĻž a,b,c āϞ⧠āĻāĻžāĻ āĻĻāĻŋāϞ⧠āĻāĻā§ remainder r → Number = LCM(a,b,c) + r
Ex: 18,20,24 remainder 3 → LCM=360 → Number=360+3=363
Trick 5: Perfect Square LCM / Perfect Square ā§° āĻŦāĻžāĻŦā§ LCM: Make all prime factor powers even to make LCM a perfect square. LCM ā§° āĻŽā§āϞāĻŋāĻ āϏāĻāĻā§āϝāĻžā§° āĻāĻžāϤāϏāĻŽā§āĻšāĻ āϝā§ā§° āĻā§°āĻŋ āĻĻāĻŋāϝāĻŧāĻž āϝā§āύ square āĻšā§āĨ¤
Ex: 16,20,24 → LCM=240 → 3600 (Perfect Square)
Best Tricks for HCF / HCF ā§° āĻŦāĻžāĻŦā§ āϏ⧰ā§āĻŦāĻļā§ā§°ā§āώā§āĻ āĻā§ā§°āĻŋāĻ
Trick 1: Prime Factorisation / āĻŽā§āϞāĻŋāĻ āĻā§āĻŖāύā§āϝāĻŧāĻ āĻāĻžāĻāύāĻŋ: Break each number into prime factors, take lowest power of common primes, multiply. āĻĒā§ā§°āϤāĻŋāĻā§ āϏāĻāĻā§āϝāĻžā§° āĻŽā§āϞāĻŋāĻ āĻā§āĻŖāύā§āϝāĻŧāĻāϤ āĻāĻžāĻāĻŋ āϞā§ā§ąāĻž, āϏāĻžāϧāĻžā§°āĻŖ āĻŽā§āϞāĻŋāĻ āϏāĻāĻā§āϝāĻžā§° āϏāϰā§āĻŦāύāĻŋāĻŽā§āύ āĻāĻžāϤ āϞ⧠āĻā§āĻŖ āĻā§°āĻžāĨ¤
Ex: HCF(24,36)
24 = 2³×3, 36 = 2²×3² → HCF = 2²×3 = 12
Trick 2: Euclidean Algorithm / āĻāĻāĻā§āϞāĻŋāĻĄ āĻāϞāĻā§°āĻŋāĻĻāĻŽ: Fast for large numbers: Divide large by small → remainder → repeat until remainder 0. āĻŦāĻĄāĻŧ āϏāĻāĻā§āϝāĻž āĻāĻžāĻā§°āĻĢāϞ āϏ⧰⧠āϏāĻāĻā§āϝāĻž, āĻĒā§āύ⧰ āĻāĻžāĻ āĻā§°āĻŋ āĻ āĻŦāĻļāĻŋāώā§āĻ 0 āĻšāϞ⧠āĻļā§āώāĨ¤
Ex: HCF(252,105)
252 ÷ 105 = 2 remainder 42, 105 ÷ 42 = 2 remainder 21, 42 ÷ 21 = 2 remainder 0 → HCF = 21
Trick 3: Observation Method / āĻĒā§°ā§āϝāĻŦā§āĻā§āώāĻŖ āĻĒāĻĻā§āϧāϤāĻŋ: If numbers are multiples of a common number, pick the largest number dividing all. āϝāĻĻāĻŋ āϏāĻāĻā§āϝāĻžāϏāĻŽā§āĻšā§ āĻāĻā§ āϏ⧰⧠āϏāĻāĻā§āϝāĻžā§° āĻā§āĻŖāĻŋāϤāĻ āĻšāϝāĻŧ, āϏāĻāϞā§āĻā§ āĻāĻžāĻ āĻā§°āĻŋāĻŦ āĻĒā§°āĻž āϏ⧰ā§āĻŦāĻžāϧāĻŋāĻ āϏāĻāĻā§āϝāĻž āϞāĻāĻāĨ¤
Ex: HCF(36,48,60) → divisible by 12 → HCF=12
Combined Tricks (LCM & HCF) / LCM āĻā§°ā§ HCF āĻŽāĻŋāϞāĻŋāϤ āĻā§ā§°āĻŋāĻ
LCM × HCF = Product of Numbers → Always check
LCM of three numbers (a, b, c)
First find LCM of a and b, LCMâ = LCM(a, b)
Now find LCM of LCMâ and c, LCM(a, b, c) = LCM(LCM(a, b), c)
The final result is the LCM of all three numbers
HCF of three numbers (a, b, c)
First find HCF of a and b, HCFâ = HCF(a, b)
Now find HCF of HCFâ and c, HCF(a, b, c) = HCF(HCF(a, b), c)
The final result is the HCF of all three numbers, Prime factorisation once → reuse for both
Ex : Numbers: 12, 18, 24 HCF & LCM = ?
Basic definitions
Methods to find HCF
(A) Prime Factorization Method
Ex: Find HCF of 36 and 60
36 = 2² × 3²
60 = 2² × 3 × 5
Common factors = 2² × 3 = 12
HCF = 12
(B) Division Method (Euclid’s method)
Ex: Find HCF of 60 and 36
60 ÷ 36 → remainder 24
36 ÷ 24 → remainder 12
24 ÷ 12 → remainder 0
HCF = 12
(C) Shortcut Trick (for 2 or 3 numbers)
Methods to find LCM
(A) Prime Factorization Method
Ex: Find LCM of 12 and 18
12 = 2² × 3
18 = 2 × 3²
LCM = 2² × 3² = 36
(B) Division Method (for 2 or more numbers)
Ex: Find LCM of 12, 18, 24
Write the numbers: 12, 18, 24
Divide by 2 (smallest prime): 12 ÷ 2 = 6, 18 ÷ 2 = 9, 24 ÷ 2 = 12 → New numbers: 6, 9, 12
Divide by 2 again: 6 ÷ 2 = 3, 9 ÷ 2 = 9 (not divisible), 12 ÷ 2 = 6 → 3, 9, 6
Divide by 2 again: 3 ÷ 2 = 3, 9 ÷ 2 = 9, 6 ÷ 2 = 3 → 3, 9, 3
Divide by 3: 3 ÷ 3 = 1, 9 ÷ 3 = 3, 3 ÷ 3 = 1 → 1, 3, 1
Divide by 3 again: 1 ÷ 3 = 1, 3 ÷ 3 = 1, 1 ÷ 3 = 1 → 1, 1, 1 (Stop)
Multiply all divisors used: 2 × 2 × 2 × 3 × 3 = 72
LCM = 72
(C) Relation Between HCF and LCM
For any two numbers,
HCF × LCM = Product of numbers
Ex: If numbers are 12 and 18, HCF = 6, so LCM = (12 × 18) / 6 = 36
Short Tricks & Memory Tips
HCF & LCM Tricks
One number divides the other:
o HCF = Smaller number, LCM = Larger number
o Ex: (4, 8) → HCF = 4, LCM = 8
Co-prime numbers (no common factor except 1):
o HCF = 1, LCM = Product of numbers
o Ex: (4, 9) → HCF = 1, LCM = 36
Three consecutive numbers:
o HCF = 1
o Ex: (10, 11, 12) → HCF = 1
Three consecutive even numbers:
o HCF = 2
o Ex: (12, 14, 16) → HCF = 2
Fractions (a/b, c/d):
o HCF = HCF of numerators ÷ LCM of denominators
o LCM = LCM of numerators ÷ HCF of denominators
o Ex: HCF(2/3, 4/5) = HCF(2,4)/LCM(3,5) = 2/15
Example Mixed Problem
Find HCF and LCM of 16a²bc³, 32abc, 64a³bc²
LCM: Take highest powers = 64a³bc³
HCF: Take lowest powers = 16abc²
HCF = 16abc², LCM = 64a³bc³
Ex: Find HCF of 36 and 60
Ex
LCM & HCF – Memory Points
First write prime factors of the numbers. Look at the powers (exponents) of common prime numbers.
For HCF
Choose the LOWEST power of each common prime factor. Do NOT take highest power. Multiply the chosen lowest powers → HCF
For LCM
Choose the HIGHEST power of each prime factor (common or not). Do NOT take lowest power. Multiply the chosen highest powers → LCM
Ex: 12 and 24
12 = 22×31
24 = 23×31
HCF:
Lowest power of 2 = 22 & 3 = 31
HCF = 22×3 = 12
LCM:
Highest power of 2 = 23 & 3 = 31
LCM = 23×3 = 24
Memory Trick
HCF → Lowest power, LCM → Highest power