11.1 Data Sufficiency Architecture: The 5 Answer Choices (AD/BCE) and Yes/No vs. Value Logic

11.1 Data Sufficiency Architecture: The 5 Answer Choices (AD/BCE) and Yes/No vs. Value Logic

Quick Summary: On the GMAT Focus Edition, Data Sufficiency (DS) has moved entirely out of Quantitative Reasoning and into the Data Insights (DI) section. Data Sufficiency is part of the equally weighted Data Insights section, where an on-screen calculator is available. DS tests data evaluation and sufficiency logic under time pressure (approximately 2 minutes and 15 seconds per question). Success requires memorizing the invariant five answer choices, mastering the two-branch AD / BCE elimination framework, and understanding the strict mathematical divergence between Value questions (where a single unique number is required) and Yes/No questions (where a definitive 'NO' is just as sufficient as a definitive 'YES').

---

The Paradigm Shift: Data Sufficiency in GMAT Focus Data Insights

For decades, Data Sufficiency was a staple of the legacy Quantitative section. Candidates faced 15 to 17 DS questions alongside traditional Problem Solving items, working entirely without computational assistance. On the GMAT Focus Edition, the Graduate Management Admission Council (GMAC) executed a fundamental realignment:

1. Exclusive Placement in Data Insights: Data Sufficiency appears exclusively within the Data Insights section. The Quantitative Reasoning section now consists of 100% Problem Solving items.
2. Equal Composite Weighting: Data Insights contributes equally with Quantitative and Verbal to the Total Score, so Data Sufficiency performance can materially affect the overall result.
3. Availability of the On-Screen Digital Calculator: In the Data Insights section, candidates have access to an on-screen calculator. However, top test-takers understand that reaching for the calculator on Data Sufficiency is almost always an indicator of flawed methodology. DS tests whether a problem can be solved, not the arithmetic execution itself.
4. Pacing Realities: With 20 questions in 45 minutes, you have an average of 2 minutes and 15 seconds per item. Because multi-tab Multi-Source Reasoning (MSR) prompts frequently require 2.5 to 3 minutes, efficient DS execution (under 1:45 per question) is your primary engine for banking time.

---

The Five Invariant Answer Choices: Memorization and Structure

Unlike traditional multiple-choice questions where answer choices vary by prompt, Data Sufficiency answer choices are identical and appear in the exact same sequence on every single question. Reading the answer choices during the exam is an unacceptable waste of cognitive bandwidth. You must commit them to memory until their retrieval is instantaneous:

• Choice (A) / First Choice: Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
• Choice (B) / Second Choice: Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
• Choice (C) / Third Choice: BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
• Choice (D) / Fourth Choice: EACH statement ALONE is sufficient.
• Choice (E) / Fifth Choice: Statements (1) and (2) TOGETHER are NOT sufficient.

Core Axiom: If either statement is sufficient on its own, Choice C and Choice E are eliminated immediately. You only ever combine the statements if both Statement (1) and Statement (2) fail independently.

---

The AD / BCE Elimination Protocol: The Two-Stage Decision Tree

The structure of the five answer choices allows you to partition your scratchpad into a high-speed elimination grid. Because Statement (1) is evaluated first, your decision immediately bifurcates the universe of five choices into two mutually exclusive groups:

$\text{Evaluate Statement (1)} \implies \begin{cases} \text{SUFFICIENT} & \implies \text{Choices narrowed to } \{\mathbf{A}, \mathbf{D}\} \\ \text{INSUFFICIENT} & \implies \text{Choices narrowed to } \{\mathbf{B}, \mathbf{C}, \mathbf{E}\} \end{cases}$

The AD Branch (Statement 1 is Sufficient)

If Statement (1) gives sufficient information, Choices B, C, and E are impossible. Write AD on your scratchpad and proceed to Statement (2):

• If Statement (2) is also sufficient on its own $\implies$ Select D (Each statement alone is sufficient).
• If Statement (2) is insufficient on its own $\implies$ Select A (Statement 1 alone is sufficient).

The BCE Branch (Statement 1 is Insufficient)

If Statement (1) fails to provide sufficient information, Choices A and D are eliminated. Write BCE on your scratchpad and proceed to Statement (2):

• If Statement (2) is sufficient on its own $\implies$ Select B (Statement 2 alone is sufficient).
• If Statement (2) is insufficient on its own $\implies$ Eliminate B. You are left with CE.

The Final Resolution: Combining Statements (The CE Split)

Only when both statements fail independently do you consider them together. Pool all given information from both statements:

• If combining them yields a unique answer $\implies$ Select C (Both statements together are sufficient).
• If even combined they leave ambiguity $\implies$ Select E (Together they are not sufficient).

---

The Two Question Archetypes: Value vs. Yes/No Logic

Every Data Sufficiency problem on the GMAT falls strictly into one of two logical archetypes. Identifying which archetype you are facing determines your exact standard of sufficiency.

                    ┌────────────────────────────────────────┐
                    │       Data Sufficiency Question        │
                    └───────────────────┬────────────────────┘
                                        │
                ┌───────────────────────┴───────────────────────┐
                ▼                                               ▼
   ┌──────────────────────────┐                   ┌──────────────────────────┐
   │      Value Question      │                   │     Yes/No Question      │
   │  "What is the value?"    │                   │   "Is x > 0?", "Is n?"   │
   └────────────┬─────────────┘                   └─────────────┬────────────┘
                │                                               │
      ┌─────────┴─────────┐                           ┌─────────┴─────────┐
      ▼                   ▼                           ▼                   ▼
┌───────────┐       ┌───────────┐               ┌───────────┐       ┌───────────┐
│ Exactly 1 │       │  2+ Values│               │Definitive │       │   Maybe   │
│   Value   │       │ or Range  │               │YES or NO  │       │(Ambiguous)│
└─────┬─────┘       └─────┬─────┘               └─────┬─────┘       └─────┬─────┘
      ▼                   ▼                           ▼                   ▼
 SUFFICIENT          INSUFFICIENT                SUFFICIENT          INSUFFICIENT

1. Value Questions: The Unique Number Standard

Value questions ask for a specific numerical quantity (e.g., "What is the value of $x$?", "How many liters of water were added?", "What was the company's net profit?").

• Sufficient: The statement allows you to determine exactly one unique numerical value.
• Insufficient: The statement leaves two or more possible numerical values, or establishes a continuous range (e.g., $x > 4$ or $x = 3 \text{ or } -3$).

The Range Trap in Value Questions: If a question asks, "What is the value of $k$?", and Statement (1) simplifies to $2 < k < 5$, Statement (1) is insufficient if $k$ can be any real number. Even if the stem restricts $k$ to integers, $k$ could still be $3$ or $4$, remaining insufficient. Only if an external condition restricts $k$ to an odd integer would $k = 3$ be unique, rendering the statement sufficient.

2. Yes/No Questions: The Definitive Binary Standard

Yes/No questions ask a qualitative or relational question that can be answered with a binary true/false response (e.g., "Is $x > 0$?", "Is $n$ an even integer?", "Does line $L$ intersect the circle?").

• Sufficient: The statement yields a definitive, universal YES (the condition is always true) OR a definitive, universal NO (the condition is always false).
• Insufficient: The statement yields a MAYBE—under some valid cases the answer is YES, while under other valid cases the answer is NO.

---

The "Definitive NO = Sufficient" Cognitive Breakthrough

The single most pervasive psychological trap in GMAT Data Sufficiency is the "No Means Insufficient" fallacy. In ordinary human conversation, a negative answer often feels like a lack of resolution or a failure of information. For example, if someone asks, "Do you know where the keys are?" and you answer "No," you have provided no helpful information.

In formal mathematical logic, however, a definitive NO is a complete, ironclad answer. Consider the question: $\text{Question: Is integer } x \text{ positive?}$

• Suppose Statement (1) proves that $x = -7$.
• When you test the question "Is $x$ positive?", the answer is a decisive, absolute "NO, $x$ is not positive; it is $-7$."
• You have answered the question with 100% certainty. There is zero ambiguity. Therefore, Statement (1) is completely SUFFICIENT.

If you ever catch yourself thinking, "Statement (1) doesn't work because the answer is no," pause immediately. Re-anchor your standard: on Yes/No questions, sufficiency means certainty of the outcome, whether that outcome is YES or NO.

---

Step-by-Step Worked DS Examples

Worked Example 1: Value Question Analysis

Problem: What is the value of the positive integer $n$?

• Statement (1): $(n - 3)(n - 8) = 0$
• Statement (2): $n$ is a prime number strictly less than 7.

Step-by-Step Sufficiency Evaluation:

1. Rephrase the Target: We require a single, unique numerical value for $n$. We are given that $n$ must be a positive integer ($n \in {1, 2, 3, 4, \dots}$).
2. Evaluate Statement (1) in Isolation: $(n - 3)(n - 8) = 0 \implies n = 3 \quad \text{or} \quad n = 8$ Both $3$ and $8$ are positive integers. Statement (1) yields two valid values for $n$. Because it does not yield a single unique value, Statement (1) is NOT sufficient.
   • Scratchpad Update: Cross off AD. Retain BCE.
3. Evaluate Statement (2) in Isolation (Zero Contamination): Wipe Statement (1) from your mind. $n$ is a prime number strictly less than 7. The prime numbers strictly less than 7 are $2, 3,$ and $5$. Because $n$ could be $2, 3,$ or $5$, Statement (2) yields three possible values. Thus, Statement (2) is NOT sufficient.
   • Scratchpad Update: Cross off B. Retain CE.
4. Evaluate Both Statements Combined (1 + 2): We now combine both statements:
   • From Statement (1): $n \in {3, 8}$.
   • From Statement (2): $n \in {2, 3, 5}$. The only positive integer that satisfies both constraints simultaneously is $n = 3$. Because combining the statements locks $n$ into a single unique value, BOTH statements TOGETHER are sufficient.
5. Final Verdict: The correct answer is Choice C (BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient).

---

Worked Example 2: Yes/No Question and the "Definitive NO" Principle

Problem: Is the integer $k$ divisible by 6?

• Statement (1): $k$ is an odd integer.
• Statement (2): $k$ is a multiple of 3.

Step-by-Step Sufficiency Evaluation:

1. Rephrase the Target: A number is divisible by 6 if and only if it is divisible by both 2 and 3 (meaning it must be an even multiple of 3). Our question is: "Is $k$ an even multiple of 3?"
2. Evaluate Statement (1) in Isolation: Statement (1) states that $k$ is an odd integer. An odd integer, by definition, is not divisible by 2. Because $k$ is not divisible by 2, it is mathematically impossible for $k$ to be divisible by 6. For any odd integer you choose ($k = 3, 5, 7, 9, 15$), the answer to "Is $k$ divisible by 6?" is a definitive, universal "NO". Because Statement (1) guarantees a conclusive, single answer (NO) across all cases, Statement (1) ALONE is sufficient!
   • Scratchpad Update: Retain AD. Cross off BCE.
3. Evaluate Statement (2) in Isolation: Wipe Statement (1) from your scratchpad. Statement (2) states that $k$ is a multiple of 3 ($k \in {\dots, -6, -3, 0, 3, 6, 9, 12, \dots}$).
   • Case 2A: Let $k = 6$. Is 6 divisible by 6? YES.
   • Case 2B: Let $k = 9$. Is 9 divisible by 6? NO. Because Statement (2) yields both YES and NO depending on the multiple selected, it produces a MAYBE. Thus, Statement (2) is NOT sufficient.
4. Final Verdict: Statement (1) alone is sufficient, but Statement (2) alone is not sufficient. The correct answer is Choice A.

---

High-Frequency Candidate Traps

• Trap 1: The "Definitive NO Means Insufficient" Fallacy
  Candidates routinely evaluate Statement (1), prove conclusively that the target condition is false, and reflexively write "Insufficient" on their notepad. Remember: in Yes/No Data Sufficiency, an unambiguous "NO" is 100% sufficient.

• Trap 2: The Multiple Values Fallacy in Value Problems
  When solving quadratic equations like $x^2 = 25$, test-takers frequently forget the negative root and conclude $x = 5$, marking the statement sufficient. Unless the prompt explicitly specifies that $x > 0$ or that $x$ represents a physical quantity (such as length, time, or price), $x = \pm 5$ yields two valid answers, rendering the statement insufficient.

• Trap 3: The Calculation Addiction
  Because Data Insights provides an on-screen calculator, test-takers fall into the trap of computing exact numerical quantities (e.g., multiplying 47.85 by 1.15 to calculate total revenue). In Data Sufficiency, you receive zero points for the final number. The moment you determine that a unique linear equation with one variable has been established, stop calculating immediately and mark the statement sufficient.