Question Logic
Set X has exactly 4 distinct integers.
Rule:
If a composite number is in X, all of its distinct prime factors must also be in X.
Example:
* If 20 is in X → 2 and 5 must be in X.
* If 12 is in X → 2 and 3 must be in X.
We need to determine how many members of X are prime.
---
Statement (1)
Product of integers in X is divisible by 36.
36 = (2^2 × 3^2)
Therefore 2 and 3 must appear as prime factors somewhere.
Because all prime factors must themselves belong to X:
2 ∈ X and 3 ∈ X.
But is there a third prime?
Possible Set A:
{2, 3, 4, 9}
* 4's prime factor = 2 ✓
* 9's prime factor = 3 ✓
* Product divisible by 36
Prime count = 2
Possible Set B:
{2, 3, 5, 30}
* 30's prime factors = 2,3,5 ✓
* Product divisible by 36
Prime count = 3
Different answers.
Statement (1) is NOT sufficient.
---
Statement (2)
Product of integers in X is divisible by 60.
60 = (2^2 × 3 × 5)
Therefore 2, 3, and 5 must all appear as prime factors somewhere.
By the rule:
2 ∈ X
3 ∈ X
5 ∈ X
Three of the four elements are already forced.
Now there is only one slot left.
Could that fourth element introduce a new prime factor, say 7?
No.
If 7 were a prime factor of the fourth element, then 7 itself would also have to be in X.
That would require a fifth element.
Impossible.
Therefore the fourth element can only be built from primes 2, 3, and 5.
Examples:
{2,3,5,6}
{2,3,5,10}
{2,3,5,15}
{2,3,5,30}
In every valid case:
Prime elements = 2, 3, 5
Exactly 3 primes.
Statement (2) is sufficient.
----------------------------
Answer
(B)
Statement (2) alone is sufficient, but Statement (1) alone is not sufficient.
-----------------------------------------------------------------------------
Fast takeaway
When you see:
"All prime factors must also be in the set"
and
"Set has exactly 4 elements"
immediately count how many distinct prime factors are forced.
* Statement (1) forces {2,3} → could be 2 primes or 3 primes.
* Statement (2) forces {2,3,5} → already 3 of the 4 slots are taken by primes, so the number of primes is fixed at 3.