Fatskills
Practice. Master. Repeat.
Study Guide: **GMAT Focus Edition: Data Sufficiency – Sufficiency Logic (Data Insights)**
Source: https://www.fatskills.com/gmat/chapter/gmat-focus-edition-data-sufficiency-sufficiency-logic-data-insights

**GMAT Focus Edition: Data Sufficiency – Sufficiency Logic (Data Insights)**

By Fatskills Exam Guides Team — the exam nerds behind 28,500+ quizzes and 2.1M practice questions across 500+ global exams.

⏱️ ~5 min read

GMAT Focus Edition: Data Sufficiency – Sufficiency Logic (Data Insights)

By [Your Name], 10+ Years Coaching 700+ Scorers


What This Is

Data Sufficiency (DS) is the only question type on the GMAT Focus Edition’s Data Insights section where you do not need to compute an answer—you only decide whether the given statements provide enough information to answer the question. Mastering sufficiency logic is non-negotiable for a 700+ score: ~20% of Data Insights questions are DS, and most test-takers lose 3–5 raw points here by overcomputing or misapplying logic.

Real-GMAT Example:
If x and y are positive integers, is x > y? 1. x² > y² 2. x³ > y³

Here, you never need to solve for x or y—just determine if each statement (or both together) guarantees a "yes" or "no" to the question.


Key Concepts & Techniques

  1. Sufficiency ≠ Solvability
  2. A statement is sufficient if it alone guarantees a definitive "yes" or "no" to the question.
  3. When to use: Every DS question. Ask: "Can I answer the question with only this statement?"

  4. The "AD/BCE" Decision Tree

  5. Evaluate Statement 1 first (AD), then Statement 2 (BCE).
  6. When to use: Immediately upon reading the question. This forces logical discipline.

  7. Plugging in Numbers (PIN)

  8. Test extreme values (0, 1, negatives, fractions) to disprove sufficiency.
  9. When to use: When the question involves inequalities, exponents, or variables without constraints.

  10. Algebraic Manipulation

  11. Rearrange statements to match the question’s form (e.g., if the question asks Is x > 5?, rewrite the statement to isolate x).
  12. When to use: When statements are equations or inequalities with the same variables as the question.

  13. Logical Overlap

  14. If both statements individually lead to the same conclusion (e.g., both say "yes"), the answer is D.
  15. When to use: When evaluating Statement 2 after Statement 1 is sufficient.

  16. The "No" Sufficiency Trap

  17. A statement is sufficient if it definitively answers "no" (e.g., Is x > 5?x = 3 is sufficient).
  18. When to use: When testing values or analyzing inequalities.

  19. Data Sufficiency "Cheat Sheet"

  20. Sufficient: "Yes" or "No" with certainty.
  21. Insufficient: "Maybe" or "It depends."
  22. When to use: To quickly eliminate answer choices (e.g., if Statement 1 is insufficient, cross out A and D).

Step-by-Step Strategy

Follow this process for every DS question:


  1. Read the question stem carefully.
  2. Identify the exact question (e.g., Is x > 0? vs. Is x ≥ 0?).
  3. Note any constraints (e.g., x is a positive integer).

  4. Evaluate Statement 1 alone (AD).

  5. Ask: "Does this statement alone guarantee a definitive 'yes' or 'no'?"
  6. If yesSufficient (eliminate B, C, E).
  7. If noInsufficient (eliminate A and D).

  8. Evaluate Statement 2 alone (BCE).

  9. Ignore Statement 1. Ask the same question.
  10. If sufficientB (if Statement 1 was insufficient) or D (if both are sufficient).
  11. If insufficientC or E.

  12. Combine Statements (if needed).

  13. Only if both statements alone are insufficient.
  14. Ask: "Together, do they guarantee a 'yes' or 'no'?"
  15. If yesC.
  16. If noE.

  17. Plug in numbers (if stuck).

  18. Test edge cases (e.g., 0, 1, negatives, fractions) to disprove sufficiency.
  19. Never assume a variable is positive unless stated.

  20. Select the answer and move on.

  21. Do not overcompute. If you’ve spent >2 minutes, guess and flag.

Fully Worked Example

Question:
If x and y are integers, is x > y? 1. x² > y² 2. x³ > y³

Step 1: Read the stem.
- Question: Is x > y? - Constraints: x and y are integers (no other restrictions).

Step 2: Evaluate Statement 1 (AD).
- x² > y² → Does this guarantee x > y? - Test values:
- x = 3, y = 2 → 9 > 4 → x > y (yes).
- x = -3, y = 2 → 9 > 4 → x < y (no).
- Insufficient (sometimes yes, sometimes no). Eliminate A and D.

Step 3: Evaluate Statement 2 (BCE).
- x³ > y³ → Does this guarantee x > y? - For integers, x³ > y³ always implies x > y (cubing preserves order).
- Sufficient. Eliminate C and E.
- Answer: B.

Key Insight:
- Statement 1 fails because squaring loses sign information.
- Statement 2 works because cubing preserves order for all integers.


Common Mistakes

  1. Mistake: Assuming variables are positive.
  2. Why it happens: Test-takers forget to test negatives or zero.
  3. Correct approach: Always test x = -1, 0, 1 unless explicitly restricted.

  4. Mistake: Overcomputing instead of testing sufficiency.

  5. Why it happens: Habit from Problem Solving questions.
  6. Correct approach: Ask: "Do I need to solve, or just decide if it’s possible?"

  7. Mistake: Ignoring "no" as a sufficient answer.

  8. Why it happens: Students think only "yes" counts.
  9. Correct approach: A definitive "no" is just as sufficient as a "yes."

  10. Mistake: Combining statements too early.

  11. Why it happens: Panic or rushing.
  12. Correct approach: Always evaluate each statement alone first.

  13. Mistake: Misapplying inequalities.

  14. Why it happens: Forgetting that x² > y² doesn’t imply x > y (e.g., x = -2, y = 1).
  15. Correct approach: Rewrite inequalities to match the question (e.g., x² > y²|x| > |y|).

GMAT Traps & Timing

  1. Trap: The "Almost Sufficient" Statement
  2. Example: Is x > 5?
    1. x > 4
  3. Why it’s a trap: x > 4 includes x = 4.5 (no) and x = 6 (yes).
  4. How to avoid: Test values just above and below the threshold.

  5. Trap: Hidden Constraints

  6. Example: If x is a positive integer, is x > 3?
    1. x² > 9
  7. Why it’s a trap: x² > 9x > 3 or x < -3, but x is positive.
  8. How to avoid: Always note constraints in the question stem.

  9. Time Budget:

  10. Easy/Medium DS: 1:30–1:45 per question.
  11. Hard DS: 2:00 max. If stuck, guess and flag.

Quick Practice

Question:
If x is a positive integer, is x divisible by 6? 1. x is divisible by 3. 2. x is divisible by 2.

Answer: C Explanation: Statement 1 alone (e.g., x = 3) is insufficient. Statement 2 alone (e.g., x = 2) is insufficient. Together, they guarantee divisibility by 6.


Last-Minute Cram Sheet

  1. Sufficiency = Definitive "yes" or "no"—never "maybe."
  2. AD/BCE tree: Evaluate Statement 1 first, then Statement 2.
  3. Plug in numbers to disprove sufficiency (test 0, 1, negatives, fractions).
  4. A "no" is sufficient—don’t overlook it.
  5. Combine statements only if both are insufficient alone.
  6. Inequalities: x² > y²x > y (test negatives).
  7. Cubing preserves order for all real numbers (x³ > y³x > y).
  8. Constraints matter: Positive? Integer? Non-zero?
  9. Common trap: x > 4 is not sufficient for x > 5.
  10. Time: 1:30–2:00 per question. Guess if stuck.

Final Tip: On test day, write "AD/BCE" on your scratch pad before starting Data Insights. This keeps your logic disciplined.



ADVERTISEMENT