Skip to content
Technique

Numbers with a given LCM and HCF: decide where each prime goes

Quantitative Aptitude • Number System

Statement

Let the LCM be a product of different primes, such as . Every number divides the LCM, so each is 1 or a product of some of these primes. The LCM is reached exactly when each prime is in at least one of the numbers. The HCF is 1 exactly when no prime is in every number. So a set of numbers is fixed by choosing, for each prime, which numbers carry it: at least one of them, and not all.

How to use it

  1. 1Break the LCM into primes and list its divisors.
  2. 2For each prime, choose which of the numbers contain it: at least one and, for HCF 1, not all.
  3. 3Build the numbers from these choices. If the question only asks whether the count passes some value, listing that many valid sets is enough.

Worked example

Find all pairs of different numbers with LCM 15 and HCF 1.

Step-by-step

  1. 1
    .
  2. 2
    With two numbers, 'at least one but not both' means each prime goes into exactly one of them.
  3. 3
    3 and 5 go into the same number or into different ones: or .

Answer

and .

Watch out

Forgetting that 1 can be one of the numbers loses sets. Putting a prime into every number breaks HCF 1.

Also known as

sets with given LCM and HCF, co-prime sets with a given LCM, divisors of a product of primes

Appears in past papers

2025