PYQ Vault

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

The HCF keeps only what the numbers share: the lowest power of each common prime. The LCM keeps everything: the highest power of every prime that appears. For two numbers, the HCF times the LCM is their product.

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 ×\times LCM =a×b= a \times b.
  • Two numbers with HCF h are h×h \times (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 ÷\div LCM of the bottoms; LCM == LCM of the tops ÷\div HCF of the bottoms.

Two numbers

HCF(a,b)×LCM(a,b)=a×b\text{HCF}(a, b) \times \text{LCM}(a, b) = a \times b

Diagram · shared factors and all factors

360 = 2³ × 3² × 5756 = 2² × 3³ × 725223337360 onlyboth756 onlyHCF (the overlap): 2 × 2 × 3 × 3 = 36LCM (everything): 36 × 2 × 5 × 3 × 7 = 756036 × 7560 = 360 × 756 = 272160

Worked example

Find the HCF and LCM of 23×32×52^3 \times 3^2 \times 5 and 22×33×72^2 \times 3^3 \times 7.
Practise this conceptself-check · 3 quick reps

The same idea in a real exam question:

SSC CGL Tier II · 2024 · Tier II (CGL 2024), 20 Jan 2025 · Q29Easy

Example 1 · Number System · Factorisation, HCF and LCM

The LCM of 23×92×132^3 \times 9^2 \times 13, 22×132×192^2 \times 13^2 \times 19 and 93×132×1929^3 \times 13^2 \times 19^2 is:

Taking the highest powers for the HCF

The HCF takes the LOWEST power of each shared prime and leaves out primes that are not shared. The highest powers of every prime give the LCM.

Concept 2 of 3: Remainder recipes

Questions about a number that leaves the same remainder, or remainders that each fall short of the divisor by the same amount, are HCF or LCM questions in disguise.

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 +r+ r.
  • Least number whose remainders are each k less than the divisor: LCM −k- k.
  • 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

N=m×LCM+rN = m \times \text{LCM} + r

Worked example

Find the least number that leaves remainder 4 when divided by 6, by 9 and by 15.
Practise this conceptself-check · 3 quick reps

The same idea in a real exam question:

SSC CGL Tier II · 2022 · Tier II (CGL 2022), 7 Mar 2023 · Q2Easy

Example 2 · Number System · Factorisation, HCF and LCM

The largest three-digit number that gives the same remainder 2 when divided by 3, 5 and 9 is ________.

Taking the HCF of the numbers, not of the differences

For 'the same remainder', the remainders cancel only in the DIFFERENCES. The HCF of 70, 115 and 205 is 5, but the answer is 45.

Concept 3 of 3: Counting divisors

Write a number as a product of prime powers. Each prime can appear in a divisor anywhere from zero times up to its full power, so the number of divisors multiplies those choices.

Definition

  • N=paqbrcN = p^a q^b r^c has (a+1)(b+1)(c+1)(a + 1)(b + 1)(c + 1) divisors.
  • Exactly 2 divisors: a prime. Exactly 3 divisors: the square of a prime (1, p and p2p^2).
  • A perfect square has an odd number of divisors.

Number of divisors

N=paqbrc  ⇒  (a+1)(b+1)(c+1) divisorsN = p^a q^b r^c \;\Rightarrow\; (a + 1)(b + 1)(c + 1) \text{ divisors}

Worked example

How many divisors does 360 have?
Practise this conceptself-check · 3 quick reps

The same idea in a real exam question:

SSC CGL Tier II · 2025 · Tier II (CGL 2025), 18 Jan 2026 · Q26Easy

Example 3 · Number System · Factorisation, HCF and LCM

How many integers in the set {1,2,3……,100}\{1, 2, 3\ldots\ldots, 100\} have exactly 3 divisors?

Forgetting that a prime can be left out

Each power counts from zero, so 232^3 gives 4 choices (1, 2, 4, 8), not 3. That is why every exponent gets 1 added.

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

    HCF(a,b)×LCM(a,b)=a×b\text{HCF}(a, b) \times \text{LCM}(a, b) = a \times b
  • Remainder recipes

    A number with a fixed remainder

    N=m×LCM+rN = m \times \text{LCM} + r
  • Counting divisors

    Number of divisors

    N=paqbrc  ⇒  (a+1)(b+1)(c+1) divisorsN = p^a q^b r^c \;\Rightarrow\; (a + 1)(b + 1)(c + 1) \text{ divisors}

Watch out for (3)

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.