Great question — this is a classic Overlapping Sets problem, and the key is to work with "exactly one" rather than "at least one."
Key concept being tested: The Two-Set Formula — specifically isolating elements belonging to exactly one set.
Step 1 — Set up what you know.
Let M = instructors with a master's degree = x
Let P = instructors with a PhD = x + 4 (given as "4 greater than the number with a master's")
Let B = instructors with BOTH = n
Step 2 — Find "master's only" and "PhD only."
Master's only (no PhD) = M − B = x − n
PhD only (no master's) = P − B = (x + 4) − n
Step 3 — Answer the question.
The question asks: how many have either a PhD or a master's but NOT both?
That's exactly (master's only) + (PhD only):
= (x − n) + (x + 4 − n)
= 2x + 4 − 2n
Answer: A
Common trap students fall into: Many jump to using the full union formula |M ∪ P| = M + P − B = x + (x+4) − n = 2x + 4 − n, which gives answer B. That formula counts people with BOTH degrees once — but the question specifically asks for those with one but NOT both. You need to subtract the "both" group entirely from the count, not just avoid double-counting it.
Quick check with numbers: Say x = 10 (10 masters), so PhD = 14, and n = 3 (3 have both).
Masters only = 7, PhD only = 11, total with exactly one = 18.
Plug into A: 2(10) + 4 − 2(3) = 20 + 4 − 6 = 18. ✓
Plug into B: 2(10) + 4 − 3 = 21. ✗ (That 21 includes the 3 "both" people.)
Takeaway: Whenever a question asks for "exactly one" of two categories, calculate each "only" group separately — don't rely on the union formula, which always gives "at least one."