🎯 IBA / GMAT Prep

Chapter 2: HCF & LCM

Master the shortcuts IBA loves to test — with traps to avoid

🔗 Core Relation

Formula
HCF × LCM = Product of the two numbers
Why / When

Use this when a question gives you one number + HCF or LCM and asks for the other — no factorization needed. But remember: this only works for exactly 2 numbers. It breaks for 3 or more.

Example

HCF(4,6) = 2, LCM(4,6) = 12 → 2 × 12 = 24 = 4 × 6 ✓

⚠️ Trap

Students often apply this to 3 numbers. It fails. For 3 numbers, use prime factorization or Euclidean algorithm instead.

🔢 Prime Factorization Method

Rules
HCF = common primes → lowest power
LCM = all primes → highest power
Why / When

Go-to method when numbers are small enough to factorize quickly (under 3 digits). Fast and visual — great for MCQs with clean numbers.

Example

12 = 2² × 3, 18 = 2 × 3²
HCF = 2 × 3 = 6, LCM = 2² × 3² = 36

🤝 Co-prime Numbers

Special Case
HCF = 1, LCM = Product of the numbers
Why / When

This is just a special case of the Core Relation, but worth memorizing separately because co-prime pairs appear often as MCQ shortcuts. Spot them instantly.

Example

8 & 9 → HCF = 1, LCM = 72

📐 Numbers in Ratio a:b with HCF = H

Formulas
Numbers = Ha, Hb   |   LCM = Hab
Why / When

Very common IBA pattern. Trigger phrase: "two numbers are in ratio __, HCF is __, find LCM/numbers." Recognize the ratio + HCF combo instantly.

Example

Ratio 4:5, HCF = 6 → numbers = 24, 30 → LCM = 6 × 4 × 5 = 120

🧮 Fractions — HCF & LCM

Formulas
HCF = HCF(numerators) / LCM(denominators)
LCM = LCM(numerators) / HCF(denominators)
Why / When

Easy to mix up which operation goes on top. Memory trick: criss-cross — HCF formula uses LCM on bottom, and vice versa. Low frequency but easy marks if known.

Example

2/3 & 4/9 → HCF = 2/9, LCM = 4/3

🔄 Euclidean Algorithm

Method
Divide larger by smaller → remainder → repeat → last non-zero divisor = HCF
Why / When

Faster than factorization when numbers are large (3-4 digits+). Skip factor-hunting entirely. Essential for speed in IBA.

Example

HCF(48,18): 48 = 18×2 + 12 → 18 = 12×1 + 6 → 12 = 6×2 + 0 → HCF = 6

🎯 Remainder-Type Rules (IBA Favorites)

Core Idea

Subtracting the remainder turns "leaves remainder" into "divides exactly" — that's the one idea behind all four rules. Once a number divides exactly, HCF/LCM logic applies normally.

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 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
Examples

Rule 2: Greatest no. dividing 70,50 leaving remainders 3,5 → HCF(67,45) = 1
Rule 3: Smallest no. leaving remainder 4 on 5,6,8 → LCM = 120 → 124
Rule 4: Smallest no. leaving remainder 3 on ÷5, remainder 2 on ÷4 (5−3=4−2=2) → LCM(5,4)=20 → 18

⚠️ Critical Trap

Rule 4 only applies if (divisor − remainder) is identical across all given divisors. Always verify before using it. If not identical, the question likely wants Rule 2 or 3 instead, or needs to be solved by CRT/trial.

🧠 Quick Self-Check Before Solving Any Remainder Problem

  1. "Exactly divides"? → plain HCF/LCM
  2. Remainders differ but (divisor−remainder) pattern matches? → Rule 4
  3. Same remainder every time? → Rule 3
  4. Asked for greatest number given remainders? → Rule 2
⚡ IBA Speed Drill

Test Your HCF & LCM Skills

Questions are randomly generated each session. Target: under 12 minutes for 25 questions.

Select topics to include:

🔗 Core Relation
🔢 Prime Factor
🤝 Co-prime
📐 Ratio
🧮 Fractions
🔄 Euclidean
🎯 Remainder

Select difficulty:

Easy
Mixed
Hard
Questions: (max 50)
🎯 IBA Target: 25 questions in under 12 minutes