Hi gullyboy09,You're right about one thing:
statement (1) never forbids a non-Q word from also containing U. A word without Q must have T, but nothing stops it from carrying a U as well. So your instinct isn't wrong.
Here's the key move, though:
it doesn't matter for what we're counting. The question asks for words with
T but not U. That group lives entirely inside the
non-U words - and the non-U count is locked down.
Why the non-U group is fully determined:- Statement (2):
36 words have U, so
72 words do
not have U.
- Statement (1): Q → U. So any word
without U cannot have Q. That means all
72 non-U words are non-Q.
- Non-Q words all contain T. So all
72 non-U words have
T and not U.
Notice we never needed to know how the
36 U-words split up. Let me show that with your own scenario.
Case A - all U-words are Q-words:- Q-words (all with U) =
36, non-Q =
72, all with T, none with U.
- Words with T but not U =
72.
Case B - some non-Q words also have U (your worry):- Q-words (all with U) =
30; plus
6 non-Q words that have both U and T.
- U total =
30 +
6 =
36 ✓, non-U =
72, all with T.
- Words with T but not U = still
72.
Same answer both ways. The
6 non-Q words that grabbed a U simply fall into the
U-group - they were never candidates for "T but not U" in the first place, so they can't change our count.
Takeaway: when a distribution you can't pin down (the U-words) sits entirely
outside the group you're counting, it can't create a second answer - so the statements together are
sufficient.
Answer: Cgullyboy09
Hi
Bunuel can you please help with this question. One without Q will have T, but they can have U also. So 36 words with U will be distributed in Q with U and NOT Q with T and U.