GMAT Review: Data Sufficiency (Understanding the 5 Answer Choices, Avoiding Common Traps)

GMAT – Data Sufficiency (Understanding the 5 Answer Choices, Avoiding Common Traps)

GMAT Data‑Sufficiency – Understanding the 5 Answer Choices & Avoiding Common Traps

What This Is

Data‑Sufficiency (DS) questions give you a question stem and two statements (Statement 1 and Statement 2). Your task is not to solve the problem fully; you must decide whether the information provided is enough to answer the question. The answer is always one of five fixed choices (A–E). For example:

If x is an integer, is x² greater than 20?
(1) x > 4 (2) x < ‑5

You must determine whether each statement alone, or together, lets you answer “yes” or “no” definitively.

Key Terms & Rules

• Data‑Sufficiency: A question type where you evaluate the adequacy of given statements rather than compute a numeric answer; answer choices are always A–E.
• Answer Choice A: Statement 1 alone is sufficient, but Statement 2 alone is not sufficient.
• Answer Choice B: Statement 2 alone is sufficient, but Statement 1 alone is not sufficient.
• Answer Choice C: Both statements together are sufficient, but neither alone is sufficient.
• Answer Choice D: Each statement alone is sufficient.
• Answer Choice E: Even together the statements are insufficient.
• “Sufficient” Definition: The statements must allow you to answer the question without any additional assumptions; any logical deduction must be based solely on the given information.
• “Irrelevant” vs. “Insufficient”: An irrelevant statement can be ignored (it does not affect the answer), while an insufficient statement leaves a gap that cannot be filled by the other statement.
• “Must be True” vs. “Could be True”: DS questions never ask “could be true”; they always ask for a definite answer (yes/no, greater/less, etc.).
• “Assume the best‑case scenario” Trap: Do not assume a value that makes the problem easier; you must consider all possibilities consistent with the statement.
• “Zero‑Division” & “Undefined” Pitfall: If a statement could lead to division by zero or an undefined expression, treat those cases as possible unless the statement explicitly rules them out.
• “Integer vs. Real” Distinction: The domain (integer, positive, rational, etc.) is crucial; a statement that seems sufficient for reals may fail for integers.

Step‑by‑Step Process Flow

1. Read the question stem carefully – identify exactly what is being asked (yes/no, inequality, value, etc.).
2. Scan Statement 1 – ask yourself, “If I only knew this, could I answer the question for every case that satisfies the statement?”
3. If yes, mark Statement 1 as sufficient; otherwise, note why it fails.
4. Scan Statement 2 – repeat the same “alone‑sufficiency” test.
5. Combine the statements (if needed) – only if both alone are insufficient, see whether the two together eliminate every ambiguity.
6. Select the answer choice that matches the pattern you discovered (A–E).
7. Double‑check by plugging a borderline example that satisfies the statements; if the answer changes, you’ve mis‑identified sufficiency.

Common Mistakes

• Mistake: Treating “could be true” as sufficient.
  Correction: DS requires a definite answer; if a statement only shows that an answer could be true, it is insufficient.

• Mistake: Assuming the “most convenient” value (e.g., picking x = 5 because it makes the inequality easy).
  Correction: Test a counterexample that still satisfies the statement; if the answer flips, the statement is not sufficient.

• Mistake: Ignoring domain restrictions (e.g., assuming x is positive when the problem says “integer”).
  Correction: Keep the domain explicit; a statement may be sufficient for reals but not for integers.

• Mistake: Marking a statement sufficient because it “looks” like it determines the answer, without checking edge cases (e.g., equality vs. strict inequality).
  Correction: Verify the statement covers all boundary conditions (equality, zero, negative values).

• Mistake: Over‑reading the question and trying to solve the problem instead of just assessing sufficiency.
  Correction: Stop once you know whether the information is enough; avoid unnecessary calculations that waste time.

Exam Insights

1. Most‑tested concept: Understanding the difference between “sufficient” and “irrelevant.” The GMAT loves to give a statement that looks helpful but actually adds no new information.
2. Common distractor: Answer choice D (both statements sufficient) is a frequent trap; one statement is usually a red herring.
3. Tricky wording: Phrases like “at least,” “no more than,” and “exactly one” often hide subtle boundary cases; read them literally.
4. Time‑saving tip: If a statement contains a single variable and the question asks about a relationship (greater/less), try to isolate that variable quickly; if you can solve for it without extra info, the statement is sufficient.

Quick Check Questions

1. Question: If p and q are positive integers, is p + q > 10?
   (1) p > 6 (2) q > 5

Answer: C – Neither statement alone guarantees the sum > 10 (p = 7, q = 1 still > 10? No; p = 7, q = 1 gives 8). Together, p > 6 and q > 5 force p + q ≥ 12, so the answer is “yes.”

1. Question: Is the integer n odd?
   (1) n² − 1 is even. (2) n + 1 is even.

Answer: D – Statement 1: n² − 1 even ⇒ n² odd ⇒ n odd (since only odd squares are odd). Statement 2: n + 1 even ⇒ n odd. Each alone is sufficient.

1. Question: If x is a real number, does x² = 4?
   (1) x > 0 (2) x ≠ 2

Answer: E – Even together they don’t determine whether x² = 4; x could be 2 (violates (2)) or –2 (violates (1)), or any other positive number not equal to 2.

Last‑Minute Cram Sheet

1. ⚠️ Never assume a value that isn’t forced by the statement; always test a boundary case.
2. A = 1 sufficient, B = 2 sufficient, C = both together, D = each alone, E = never enough.
3. “Irrelevant” ≠ “Insufficient.” An irrelevant statement can be ignored; an insufficient one leaves a gap.
4. Domain matters: “integer,” “positive,” “non‑zero” change the logic dramatically.
5. Equality vs. strict inequality – watch for “≥” or “≤” when the question asks “>” or “<.”
6. Zero‑division trap: If a statement could make a denominator zero, treat that case as possible unless excluded.
7. Quick isolation rule: If a statement lets you solve for the unknown directly (e.g., x = 5), it’s usually sufficient.
8. Combine only when both alone fail – never waste time adding statements if one already works.
9. Answer‑choice elimination: If you can prove one statement is sufficient, eliminate A, B, C, and E; the answer must be D.
10. Time tip: Spend ≤ 45 seconds per DS question; if you’re stuck after 30 seconds, move on and return if time permits.

Good luck—mastering DS is a matter of disciplined logic, not brute‑force calculation!