If among 200 students, 105 like pizza and 134 like burger, then the number of students who like only burger can possibly be
Show solution
Correct answer: D
Think of this as: we know the total number of students and how many like each food, but we don't know the overlap. The question asks what the "burger-only" count can possibly be — so we need to find the full range of valid values, then check which option lands inside it.
Step 1 — Set up the four regions.
With 200 students split by their pizza/burger preferences, there are four disjoint groups:
- = pizza only
- = burger only
- = both pizza and burger
- = neither
From the data:
So we can express and in terms of :
Step 2 — Find the allowable range for (the overlap).
Every region count must be non-negative.
- From : .
- From : (already weaker than ).
- From : trivially .
Now use the "neither" group. Substitute and :
Since :
Combining both bounds:
💡 Teacher tip: The "neither" region is the hidden constraint here. Even though the question never mentions students who like neither food, that group must still exist as a non-negative count — and that's what pins down the lower bound on the overlap .
Step 3 — Convert the range of into a range for burger-only .
Since , burger-only is largest when the overlap is smallest, and vice versa:
| Overlap | Burger-only |
|---|---|
| (minimum) | (maximum) |
| (maximum) | (minimum) |
So the number of burger-only students can be any integer in:
Step 4 — Check which option falls inside the range.
| Option | Value | In ? |
|---|---|---|
| A | ✗ (too low) | |
| B | ✗ (too low) | |
| C | ✗ (too high) | |
| D | ✅ |
Only 93 lies inside the valid range.
Answer: D —
💡 Why this works: "Can possibly be" is the key phrase — it signals a range question, not a unique-value question. Whenever you see it, derive the minimum and maximum of the requested quantity using non-negativity of every region, then test the options against that range.