Core Relation

Only holds for two numbers
HCF × LCM = Product of the two numbers
When to use: a question gives one number plus the HCF or LCM, and asks for the other — no factorization needed.
HCF(4,6)=2, LCM(4,6)=12 → 2×12 = 24 = 4×6 ✓
Trap
For three or more numbers, HCF × LCM ≠ product of the numbers. Don't extend this rule past two numbers.

Prime Factorization Method

The default method when numbers factorize easily
HCF = common primes → lowest power
LCM = all primes → highest power
12 = 2²×3, 18 = 2×3² → HCF = 2×3 = 6, LCM = 2²×3² = 36

Co-prime Numbers

A special case of the core relation
HCF = 1 → LCM = product of the numbers
Worth memorizing on its own — recognizing a co-prime pair instantly gives you the LCM without any calculation.
8 & 9 share no common factor → HCF = 1, LCM = 72

Numbers in Ratio a : b, with HCF = H

Common phrasing: "two numbers are in ratio __, HCF is __"
Numbers = Ha, Hb
LCM = Hab
The ratio tells you the co-prime part (a and b share no factor); H is what scales them back up to the actual numbers.
Ratio 4:5, HCF=6 → numbers = 24, 30 → LCM = 6×4×5 = 120

HCF & LCM of Fractions

Easy to invert by accident — note the criss-cross
HCF = HCF(numerators) / LCM(denominators)
LCM = LCM(numerators) / HCF(denominators)
2/3 & 4/9 → HCF = 2/9, LCM = 4/3

Euclidean Algorithm

Faster than factorizing when numbers are large
Divide larger by smaller → take remainder → repeat
Last non-zero divisor = HCF
HCF(48,18): 48=18×2+12 → 18=12×1+6 → 12=6×2+0 → HCF=6

Remainder-Type Rules

The most exam-favored HCF/LCM application
ConditionFormula
Greatest no. dividing x, y, z exactlyHCF(x,y,z)
Greatest no. dividing x, y, z leaving remainders p, q, rHCF(x−p, y−q, z−r)
Smallest no. leaving the same remainder r on x, y, zLCM(x,y,z) + r
Smallest no. where (x−p) = (y−q) = (z−r) = kLCM(x,y,z) − k
Why: subtracting the remainder turns "leaves a remainder" into "divides exactly" — that one idea drives all four rows.
Greatest no. dividing 70,50 leaving remainders 3,5 → HCF(67,45) = 1
Smallest no. leaving remainder 4 on 5,6,8 → LCM=120 → 124
Smallest no.: remainder 3 on ÷5, remainder 2 on ÷4 (5−3=4−2=2) → LCM(5,4)=20 → 18
Trap
The "−k" row only applies if (divisor − remainder) is identical across every divisor. Verify that before applying it — otherwise the question wants the "+r" rule or a different approach entirely.
Self-Test

HCF & LCM Quiz

Questions are randomly drawn each session. Pick your topics and difficulty below.

Topics:
Core Relation
Prime Factorization
Co-prime
Ratio
Fractions
Euclidean
Remainder
Word Problems (hard)
Difficulty:
Easy
Mixed
Hard
Questions: (max 80)