← 🔢 Numbers, Algebra & Series
Subtopic 1 of 4

3.1Divisibility, remainders, LCM & HCF

The idea

LCM and HCF come from the prime factors. Perfect squares and cubes need every exponent to be a multiple of 2 or 3.

Think of it like this: Prime factors are the Lego bricks of a number: LCM keeps the biggest pile of each colour, HCF the smallest.

Why it exists

Smallest number with a given remainder and "smallest multiplier to make a cube" are repeat question types.

How it works

  1. Factorise each number.
  2. LCM takes the highest power, HCF the lowest.
  3. Same remainder r for every divisor → LCM + r.
  4. For a perfect cube, top up each exponent to a multiple of 3.

Worked example: Smallest number leaving remainder 7 on division by 20, 42 and 76

LCM = 7980, so 7987.

Now play with it

  • →Use 20, 42, 76 and r = 7.
  • →Type 162 and read the multiplier for a cube.
HCF of a, b, c2
LCM of a, b, c7980
Smallest number leaving r each time7987
a = 2^2 × 5
b = 2 × 3 × 7
c = 2^2 × 19
n =2 × 3^4
Smallest y so n·y is a perfect square2
Smallest y so n·y is a perfect cube36
Cube made5832

Check yourself

The smallest y so that 162 × y is a perfect cube is

Remember: LCM + r for equal remainders. Cube: every prime exponent a multiple of 3.
Exam notes (the dense version)

HCF takes the lowest power of each prime, LCM the highest; HCF × LCM = product of two numbers. The smallest number leaving remainder r when divided by several numbers is LCM + r. To make n × y a perfect square or cube, bring every prime exponent up to a multiple of 2 or 3 (162 = 2 × 3⁴ needs y = 4 × 9 = 36 for a cube). Divisibility: 3 and 9 by digit sum, 11 by alternating sum.

Previous year questions: Numbers, Algebra & Series (27)

PYQs are grouped by topic, so this is the full set for Numbers, Algebra & Series; try the ones that match this subtopic. Open all 27 on the topic page.