HCF and LCM is one of the most scoring chapters in AFCAT Numerical Ability because the rules are fixed and the calculation is fast once you know the tricks. At The Cavalier we treat it as a guaranteed-marks topic: questions on bells ringing together, fitting tiles, distributing items equally and simplifying fractions all reduce to a single pair of ideas you can master in one sitting.
Why HCF and LCM matter in AFCAT
Almost every AFCAT paper carries one or two direct questions on HCF (Highest Common Factor) and LCM (Least Common Multiple). They are pure-formula questions: no lengthy logic, no guesswork. If you know the method, you can solve each in well under a minute, which is exactly the speed AFCAT rewards in a paper where every correct answer earns three marks and every wrong one costs one.
Beyond the direct questions, HCF and LCM hide inside other chapters too — simplifying fractions, comparing ratios, finding the period of repeating events, scheduling problems and even some number-series problems. So a strong grip here pays off across the whole Numerical Ability section, not just in the one or two questions that name the topic openly.
The good news for AFCAT aspirants is that this is a closed, rule-based topic. There is nothing to interpret and no tricky wording in the core sums — once you can spot which of the two tools a question wants, the arithmetic is mechanical. That makes HCF and LCM one of the safest places to bank marks under exam pressure.
HCF is also called GCD (Greatest Common Divisor) and LCM is sometimes written as LCD. AFCAT may use either name — the method is identical, so do not let the label confuse you.
What HCF and LCM actually mean
The HCF of two or more numbers is the largest number that divides each of them exactly, leaving no remainder. For example, the HCF of 12 and 18 is 6, because 6 is the biggest number that goes into both without anything left over. The factors of 12 are 1, 2, 3, 4, 6, 12 and the factors of 18 are 1, 2, 3, 6, 9, 18; the largest factor common to both lists is 6.
The LCM is the smallest number that is a multiple of each of the given numbers — the smallest number all of them divide into exactly. The multiples of 12 are 12, 24, 36, 48… and the multiples of 18 are 18, 36, 54…; the first value appearing in both lists is 36, so the LCM of 12 and 18 is 36.
Listing factors and multiples by hand works for tiny numbers but becomes slow and error-prone for exam-sized numbers. That is why the formal methods below — prime factorisation and division — are essential for AFCAT speed.
HCF ≤ smallest number in the set. LCM ≥ largest number in the set. Use this as an instant sanity check on your answer before you mark the option.
A simple memory hook: HCF goes Down (it is a divisor, so it is smaller), LCM goes Up (it is a multiple, so it is larger). Get this direction fixed in your head and you will never confuse the two.
Method 1: Prime factorisation
Break each number into its prime factors written as powers. A prime number is one divisible only by 1 and itself — 2, 3, 5, 7, 11, 13 and so on. Every whole number can be written uniquely as a product of primes, and that is the foundation of this method. Once you have the prime forms:
- HCF = product of common primes raised to the lowest power they appear with.
- LCM = product of all primes that appear, each raised to the highest power.
Take 12 and 18. Write 12 = 22 × 3 and 18 = 2 × 32. The primes involved are 2 and 3.
HCF = 21 × 31 = 6 (lowest powers of the common primes).
LCM = 22 × 32 = 36 (highest powers of all primes present).
This method is the safest for AFCAT when the numbers are small to medium, because it makes the logic visible on paper and avoids silly slips. It also doubles as a self-check: since both answers come from the same prime list, you can quickly confirm that your HCF divides your LCM. If you are comfortable with prime factorisation here, you will also find percentage, ratio and number-system questions easier, because they lean on the same skill.
Method 2: The division (short-division) method
For the LCM of several numbers, write them in a row and keep dividing by a prime that divides at least one of them, carrying down unchanged any number that prime does not divide. Continue until the bottom row is all 1s (or all co-prime). Multiply every left-hand divisor by the final bottom row to get the LCM. This handles three, four or more numbers neatly in one tidy table.
For the HCF of two numbers, use continuous (Euclidean) division: divide the larger by the smaller, then divide the previous divisor by the remainder, and repeat the process. The last divisor that leaves remainder 0 is the HCF. The logic is that any common factor of the two numbers must also divide their remainders, so chasing the remainders down quickly corners the largest common factor.
Find the HCF of 48 and 36 by division.
36 ÷ 12 → remainder 0
Last divisor = 12
HCF = 12
The division method is fastest for large numbers (3+ digits) where prime factorisation gets messy. Practise it until it is automatic.
The magic product rule (biggest shortcut)
For exactly two numbers, there is a rule that saves enormous time and is a favourite of AFCAT examiners:
HCF × LCM = Product of the two numbers
So if you know any three of {HCF, LCM, number A, number B}, you can find the fourth instantly by simple rearrangement.
Example: two numbers are 24 and 36. Their HCF is 12. Then LCM = (24 × 36) ÷ 12 = 864 ÷ 12 = 72. No factor tree needed. The same rule run backwards lets you recover a missing number: if HCF, LCM and one number are given, the other number = (HCF × LCM) ÷ known number.
This single relationship turns many word problems into one line of division, which is exactly why it is worth memorising cold. Whenever a question gives you three of the four quantities, reach for this rule first.
This rule works only for two numbers. For three or more numbers, HCF × LCM does not equal their product. Do not apply it to three numbers in the exam.
HCF and LCM of fractions and decimals
AFCAT loves to test the fraction version because students forget the rule. Reduce every fraction to lowest terms first, then:
HCF of fractions = HCF of numerators ÷ LCM of denominators
LCM of fractions = LCM of numerators ÷ HCF of denominators
Notice the cross-pattern: HCF uses HCF-on-top, LCM-below; LCM uses LCM-on-top, HCF-below.
Find the LCM of 2⁄3, 4⁄9 and 6⁄5.
Denominators: 3, 9, 5 → HCF = 1
LCM of fractions = 12 ÷ 1 = 12
For decimals, first make the number of decimal places equal by adding trailing zeros, drop the decimal point so you are dealing with whole numbers, find the HCF or LCM of those whole numbers, then put the decimal point back in the result with the same number of places. For instance, to find the HCF of 0.6 and 0.18, write them as 0.60 and 0.18, treat as 60 and 18, find HCF = 6, then place two decimals back to get 0.06.
Mixing up the fraction rule is the single most common error here. Chant it as “HCF stays high on top” and “LCM lifts low to the top” until it is automatic.
Cracking AFCAT word problems
Most marks come from word problems. The trick is recognising which tool to use:
- “Largest”, “maximum”, “greatest size”, “equal groups” → use HCF. (e.g. largest tile to pave a floor, maximum students sharing items equally.)
- “Together again”, “ring simultaneously”, “minimum number”, “least length/quantity” → use LCM. (e.g. bells tolling together, smallest number divisible by all.)
Three bells toll at intervals of 9, 12 and 15 seconds. If they toll together now, after how many seconds will they toll together again?
9 = 32, 12 = 22×3, 15 = 3×5
LCM = 22 × 32 × 5 = 180
They toll together after 180 seconds (3 minutes)
A tile-fitting version uses HCF instead: “Find the largest square tile that can pave a floor 12 m by 18 m exactly.” Here you want the biggest size that fits both dimensions, so the side of the tile is the HCF of 12 and 18, which is 6 m. The number of tiles is then (12 × 18) ÷ (6 × 6) = 6 tiles. Train your eye to translate the wording into HCF or LCM before touching any numbers — that single decision is where most marks are won or lost.
Remainder-type problems
Two classic patterns appear often. Learn both formulas.
Same remainder r each time: Required number = (LCM of divisors) × n + r.
Common difference (divisor − remainder is constant): Required number = (LCM of divisors) × n − k, where k is that constant difference.
For “greatest number that divides a, b, c leaving the same remainder”, take the HCF of the differences (a−b), (b−c), (c−a).
If a question says “leaves remainder 0” (divides exactly), ignore the remainder add-on — it is plain LCM or HCF.
Speed shortcuts for the exam hall
These tricks shave precious seconds:
- Co-prime numbers (HCF = 1, like 8 and 15): their LCM is simply their product.
- One number is a factor of the other (like 6 and 24): HCF = smaller number, LCM = larger number. No working needed.
- HCF of a set always divides their LCM — if your HCF does not divide your LCM, you made an error.
- When options are given, eliminate: the correct LCM must be divisible by every number in the set; the correct HCF must divide every number.
For any two numbers, the answer LCM must be a multiple of the larger number. Glance at the options — often only one fits.
Common mistakes that cost marks
Swapping the formulas. Students often write LCM when the question wants HCF. Decode the keyword first (largest → HCF, together/least → LCM) before calculating.
In fraction problems, forgetting to reduce fractions to lowest terms, or flipping the HCF/LCM-of-numerator-vs-denominator rule. Memorise the cross-pattern.
Applying HCF × LCM = product to three numbers. It holds only for two numbers.
Previous-year style question
Q. The HCF of two numbers is 11 and their LCM is 7700. If one of the numbers is 275, find the other number.
Answer: Using HCF × LCM = product of the two numbers, 11 × 7700 = 275 × x. So x = (11 × 7700) ÷ 275 = 84700 ÷ 275 = 308. The other number is 308.
Notice how the product rule turned a tough-looking question into one line of arithmetic — that is the AFCAT advantage.
Quick revision
- HCF = largest common divisor (small); LCM = smallest common multiple (large).
- Prime factorisation: HCF = common primes, lowest powers; LCM = all primes, highest powers.
- For large numbers, use Euclidean division for HCF and short-division for LCM.
- Two numbers only: HCF × LCM = product of the numbers.
- Fractions: HCF = HCF(num)÷LCM(den); LCM = LCM(num)÷HCF(den).
- Keyword decode: “largest/equal” → HCF; “together/least” → LCM.
Frequently asked questions
How many HCF and LCM questions come in AFCAT?
Typically one to two direct questions appear in the Numerical Ability section, and the concept also supports fraction and ratio questions. It is a high-return, low-effort topic worth mastering fully.
Is the product rule valid for three numbers?
No. HCF × LCM equals the product of the numbers only for two numbers. For three or more numbers this relationship does not hold, so never use it there in the exam.
Which method is faster, prime factorisation or division?
Prime factorisation is clearer for small numbers, while the Euclidean and short-division methods are faster for large 3-digit-plus numbers. Practise both and pick by number size.
How do I know whether a word problem needs HCF or LCM?
Look for keywords. Largest, maximum, greatest size or equal distribution point to HCF. Together again, simultaneously, minimum or least quantity point to LCM.
How do I find HCF and LCM of fractions?
Reduce fractions first. HCF of fractions = HCF of numerators divided by LCM of denominators; LCM of fractions = LCM of numerators divided by HCF of denominators.
Related AFCAT Numerical Ability topics
Want a teacher to walk you through AFCAT Numerical Ability?
Cavalier's AFCAT batches break every topic into classroom sessions with daily practice, tests and doubt-clearing.