Multiple choice

Find the greatest number of 3 digits which is divided by both a and b. I-LCM of a and b is 60. II- Sum of a and b is 27.

  1. If statement I alone is sufficient but statement II alone is not sufficient.

  2. If statement II alone is sufficient but statement I alone is not sufficient.

  3. If each statement alone (either I or II) is sufficient.

  4. If statement I and II together are not sufficient.

  5. If both statement together are sufficient, but neither statement alone is sufficient.

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

We need the largest 3-digit number (999 or below) divisible by both a and b. LCM(a,b) = 60 from statement I alone. The largest 3-digit multiple of 60 is 960 (60 × 16). Statement II (sum = 27) is not needed - the LCM alone gives us the divisibility requirement. Statement I alone is sufficient.