SSC CGL Tier II Maths · Number System
Factorisation, HCF and LCM
Break numbers into primes: the HCF takes the lowest shared powers, the LCM the highest powers, and the same two tools solve the 'same remainder' recipes and count divisors.
Why this matters
9 questions in the Tier II bank, 8 EASY and 1 MODERATE. Every one starts from prime factors or from the rule that HCF times LCM equals the product of two numbers.
Concept 1 of 3: HCF and LCM
Definition
- Write each number as a product of primes. HCF: the lowest power of each prime common to all. LCM: the highest power of every prime in any of them.
- For two numbers: HCF LCM .
- Two numbers with HCF h are (a pair with no common factor), so their product fixes how many such pairs exist.
- Numbers in a ratio of co-prime parts, each times k, have HCF k.
- Fractions: HCF HCF of the tops LCM of the bottoms; LCM LCM of the tops HCF of the bottoms.
Two numbers
Diagram · shared factors and all factors
Worked example
Practise this conceptself-check · 3 quick reps
The same idea in a real exam question:
Example 1 · Number System · Factorisation, HCF and LCM
Taking the highest powers for the HCF
Concept 2 of 3: Remainder recipes
Definition
- Greatest number dividing a, b and c with the same remainder each time: the HCF of the differences.
- Least number leaving remainder r with each of several divisors: LCM .
- Least number whose remainders are each k less than the divisor: LCM .
- Largest number of a given size with remainder r: the largest multiple of the LCM of that size, plus r.
A number with a fixed remainder
Worked example
Practise this conceptself-check · 3 quick reps
The same idea in a real exam question:
Example 2 · Number System · Factorisation, HCF and LCM
Taking the HCF of the numbers, not of the differences
Concept 3 of 3: Counting divisors
Definition
- has divisors.
- Exactly 2 divisors: a prime. Exactly 3 divisors: the square of a prime (1, p and ).
- A perfect square has an odd number of divisors.
Number of divisors
Worked example
Practise this conceptself-check · 3 quick reps
The same idea in a real exam question:
Example 3 · Number System · Factorisation, HCF and LCM
Forgetting that a prime can be left out
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (3)
- HCF and LCM
Two numbers
- Remainder recipes
A number with a fixed remainder
- Counting divisors
Number of divisors
Watch out for (3)
- Taking the highest powers for the HCF→ HCF and LCM
- Taking the HCF of the numbers, not of the differences→ Remainder recipes
- Forgetting that a prime can be left out→ Counting divisors
Test yourself on Number System
10 past SSC CGL Tier II questions from this chapter, timed at 10 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.