Question 1
The two numbers are 16 and 28.
What is the least common multiple of 16 and 28?
- 111
- 113
- 16
- 224
- 112
Show the worked solution
- GCD(16, 28) = 4.
- LCM = 16 × 28 ÷ 4 = 112.
- Answer: 112.
GCF & LCM
GCF and LCM problems are solved fastest through a single identity: for any two positive integers, the GCF multiplied by the LCM equals the product of the numbers. Find the GCF by inspection or the Euclidean algorithm, then divide the product by it. Factorising both numbers fully is almost never necessary.
Most candidates learn these through prime factorisation, which is reliable and slow. Under a clock the identity is far better: the greatest common factor of two exam-sized numbers is usually obvious within a couple of seconds, and everything else is one division. The factor-tree habit is what costs the time here, not the difficulty.
Try it against the clock. HCF & LCM runs at 90s easy, 105s medium and 120s hard. The clock is stamped and judged on our server, so the limit you see is the deadline that is actually enforced — and it starts when you tap Start, not while the question is loading.
For 16 and 24 the largest shared factor is 8. Exam pairs are built so this is visible immediately; only reach for the Euclidean algorithm when it is not.
With 16 and 24 the product is 384, so the LCM is 384 divided by 8, which is 48. One multiplication and one division replace two factor trees.
Compute 16 divided by 8 to get 2, then 2 times 24 to get 48. Cancelling first keeps the numbers small and avoids a three-digit multiplication under time pressure.
When the GCF is 1, as with 8 and 35, the LCM is simply the product: 280. Spotting coprimality first turns the whole question into a single multiplication.
| The two numbers | What that tells you |
|---|---|
| Share no common factor | GCF is 1, LCM is the product |
| One divides the other | GCF is the smaller, LCM is the larger |
| Both even | GCF is at least 2 — halve and recheck |
| 16 and 24 | GCF 8, so LCM is 384 ÷ 8 = 48 |
| 8 and 35 | Coprime, so LCM is 280 |
Generated by the same engine that mints the Quant Daily daily. Each answer is computed from the numbers printed in the question, and the walkthrough below each one is the engine's own working — not a solution written afterwards. Reload this page's live drill and you get different numbers.
The two numbers are 16 and 28.
What is the least common multiple of 16 and 28?
The two numbers are 9 and 24.
What is the least common multiple of 9 and 24?
The two numbers are 10 and 18.
What is the least common multiple of 10 and 18?
The wrong options are not random numbers. Each one is the result of a specific careless error for this topic, so picking one tells you which habit is costing you marks.
Prime factorisation always works and always costs more seconds than the identity. Reserve it for awkward three-digit pairs.
The GCF is never larger than the smaller number and the LCM is never smaller than the larger one. A quick size check catches the swap instantly.
Forming the full product first creates a larger division than necessary. Cancel the GCF out of one number, then multiply.
The specific wrong numbers this topic produces, and what each one tells you about the step you took. If you have just got a question wrong and want to know which habit did it, start here.
No — it is 280. 8 and 35 share no common factor, so the GCF is 1 and the LCM is the full product. 40 is what you get by assuming a shared factor of 7 that only one of the numbers has. Check coprimality before reaching for anything clever.
384 is the product of the two numbers, not the LCM. The identity says the product equals the GCF times the LCM, so you still have to divide by the GCF of 8 to reach 48. Stopping at the product is the most common slip with this method.
Find the greatest common factor, then divide the product of the two numbers by it. For 16 and 24 the GCF is 8 and the product is 384, giving an LCM of 48. Cancel the GCF out of one number before multiplying to keep the arithmetic small.
For any two positive integers, yes — it is exact, not an approximation. It does not extend to three or more numbers, where the product of the GCF and the LCM is generally not the product of all of them. For pairs, which is what these questions ask, it is completely reliable.
Use the Euclidean algorithm: divide the larger by the smaller, then replace the larger with the remainder and repeat until the remainder is zero. The last non-zero remainder is the GCF. It takes two or three short steps even for awkward pairs.
Quant Daily is free, needs no account, and is not affiliated with ETS or GMAC. GRE/GMAT-style practice only.