GMAT DATA INSIGHTS • DATA SUFFICIENCY

Determine Sufficiency — Determine whether statements are sufficient independently.

Master the critical skill of evaluating each Data Sufficiency statement in isolation before considering them together.

Historical Context & Motivation

The Data Sufficiency question format is one of the most distinctive elements of the GMAT, having been a core component of the exam since its early development by the Graduate Management Admission Council (GMAC). Unlike conventional multiple-choice problems that ask you to compute a specific answer, Data Sufficiency questions assess a higher-order cognitive skill: the ability to determine whether given information is sufficient to answer a question without necessarily solving it. This format was designed to mirror the kinds of judgment calls that business professionals make daily—evaluating whether they have enough data to reach a conclusion before committing resources to a full analysis. The emphasis on logical reasoning over computation has made Data Sufficiency a signature feature of the GMAT's assessment of quantitative and analytical aptitude.

1953
Birth of the GMAT
The Graduate Management Admission Test is first administered, initially featuring only conventional quantitative and verbal sections without the Data Sufficiency format.
1970s
Introduction of Data Sufficiency
GMAC introduces the Data Sufficiency question type to the Quantitative section, recognizing the need to assess analytical judgment alongside computational ability.
2006
Computer-Adaptive Testing
The GMAT transitions to a fully computer-adaptive format. Data Sufficiency questions become central to the adaptive algorithm's ability to calibrate difficulty.
2023
GMAT Focus Edition
The GMAT is restructured into the Focus Edition. Data Sufficiency questions move into the new Data Insights section, reflecting their role in assessing data-driven reasoning.

Within the Data Sufficiency format, one of the most fundamental skills is the ability to evaluate each of the two provided statements independently. Test-takers frequently make errors by conflating the information from both statements or by rushing to combine them prematurely. The disciplined approach of isolating each statement—asking whether Statement (1) alone is sufficient, then whether Statement (2) alone is sufficient—forms the backbone of a reliable and accurate strategy. This lesson addresses the central question: how do you rigorously determine whether a single statement, taken in isolation, provides enough information to answer the question posed?

Core Principles & Definitions

Before diving into technique, it is essential to establish the structural anatomy of a Data Sufficiency problem. Every question consists of a question stem (which may include initial conditions or constraints), followed by two statements labeled (1) and (2). Your task is not to solve the problem but to determine which statements, if any, provide sufficient information to answer the question. The five answer choices—A, B, C, D, and E—are invariant across every Data Sufficiency problem, and memorizing them is a prerequisite for efficient performance.

1

Independent Evaluation

Each statement must first be evaluated in complete isolation. When testing Statement (1), you must act as though Statement (2) does not exist, and vice versa. This prevents cross-contamination of information.
2

Sufficiency ≠ Solution

A statement is sufficient if it guarantees a single, definitive answer. You do not need to compute the final value—you need only confirm that the answer is uniquely determinable from the given information.
3

Question Type Matters

"Value" questions ask for a specific number and require a unique answer. "Yes/No" questions ask whether a condition holds and require a definitive yes or definitive no—either is sufficient, but mixed results are not.
4

Stem Information Is Universal

The information in the question stem is always available. When evaluating each statement independently, you combine it with the stem's constraints—but never with the other statement.
5

The Five Fixed Answer Choices

(A) Statement 1 alone is sufficient. (B) Statement 2 alone is sufficient. (C) Both together are sufficient. (D) Each alone is sufficient. (E) Neither alone nor together is sufficient.
KEY TAKEAWAY
Think of each statement as a separate witness testifying in a courtroom. You must evaluate each witness's testimony on its own merits before considering whether their combined accounts tell a complete story. If one witness alone provides enough evidence to reach a verdict, that witness is "sufficient." The judge (you) must resist the temptation to mentally blend testimonies during individual evaluation—that is a separate, subsequent step.

Visual Explanation — The Independent Evaluation Flowchart

This flowchart illustrates the mandatory evaluation sequence for every Data Sufficiency question. Notice that Statement (1) and Statement (2) are evaluated on separate parallel tracks before results are combined. Each track uses only the question stem plus that single statement. The bottom row shows how the two individual verdicts (S or NS) map to the final answer choice.

The diagram above codifies the discipline that separates high-scoring test-takers from the rest. The critical insight is that the two parallel evaluation tracks must remain hermetically sealed from one another during the independent evaluation phase. When you assess Statement (1), you must mentally discard Statement (2)—treat it as if it were never written. Only after you have rendered independent verdicts on both statements do you proceed to the combination phase, which is relevant only when both individual verdicts are "Not Sufficient." This systematic approach prevents the most common Data Sufficiency error: inadvertently importing information from one statement into the evaluation of the other.

The Sufficiency Test — How It Works

Value Questions vs. Yes/No Questions

The mechanics of testing sufficiency differ depending on the question type. For value questions—those asking "What is the value of x?" or "How many widgets were sold?"—a statement is sufficient if and only if it narrows the solution to exactly one possible value. If a statement is compatible with two or more distinct values, it is not sufficient, regardless of how much it constrains the solution space.

VALUE QUESTION SUFFICIENCY TEST
Statement is Sufficient ⟺ |{x : x satisfies Stem ∧ Statement}| = 1
The set of values satisfying both the stem constraints and the statement must have exactly one element. If the cardinality exceeds 1, the statement is insufficient.

For yes/no questions—those asking "Is x > 5?" or "Is n divisible by 3?"—the sufficiency criterion is different but equally precise. A statement is sufficient if it produces a definitive answer: always yes or always no. It is insufficient only when the statement allows for scenarios in which the answer is sometimes yes and sometimes no. Critically, a definitive "no" is just as sufficient as a definitive "yes"—sufficiency concerns certainty, not affirmation.

YES/NO QUESTION SUFFICIENCY TEST
Sufficient ⟺ (∀x satisfying Stem ∧ Stmt: Answer = Yes) ∨ (∀x satisfying Stem ∧ Stmt: Answer = No)
The statement is sufficient when every valid scenario produces the same answer (all yes or all no). A mixture of yes-scenarios and no-scenarios renders the statement insufficient.

The Counterexample Method

The most reliable technique for testing insufficiency is the counterexample method (also called "testing cases" or "picking numbers"). After reading a statement, you attempt to construct two scenarios that satisfy both the stem and the statement but yield different answers. If you succeed, the statement is insufficient. If you can prove that no such pair of scenarios exists—through algebraic manipulation, logical deduction, or exhaustive enumeration—the statement is sufficient. For value questions, you seek two valid inputs that produce two different output values. For yes/no questions, you seek one scenario that produces "yes" and another that produces "no." A single successful counterexample pair is conclusive evidence of insufficiency.

COUNTEREXAMPLE TEST
Not Sufficient ⟺ ∃ (x₁, x₂) : both satisfy Stem ∧ Stmt, but Answer(x₁) ≠ Answer(x₂)
Finding even one pair of valid scenarios with different answers proves insufficiency. Conversely, to prove sufficiency, you must demonstrate that no such pair can exist.

The Answer Choice Decision Matrix

Understanding how the results of independent evaluation map to the five fixed answer choices is essential. Many test-takers memorize the answer choices in the abstract but struggle to apply them under time pressure. The following diagram and table provide a definitive reference. The key principle is that you should only consider combining statements after determining that neither statement alone is sufficient. This means that answer choices (A), (B), and (D) should be resolved entirely during the independent evaluation phase, and only the choice between (C) and (E) requires the combined analysis.

The 2×2 decision matrix maps the two independent sufficiency verdicts directly to the answer choice. The bottom-right cell (both Not Sufficient) is the only scenario requiring a combined analysis, which then resolves to either C (together sufficient) or E (together still not sufficient).
The five fixed answer choices and their corresponding sufficiency outcomes. Note that "N/A" indicates that the combined test is not needed because the answer is already determined.
AnswerStmt (1) AloneStmt (2) AloneTogether
(A)Sufficient ✓Not Sufficient ✗N/A
(B)Not Sufficient ✗Sufficient ✓N/A
(C)Not Sufficient ✗Not Sufficient ✗Sufficient ✓
(D)Sufficient ✓Sufficient ✓N/A
(E)Not Sufficient ✗Not Sufficient ✗Not Sufficient ✗
⚠️ Common Trap
A frequent error among test-takers is selecting (C) when the correct answer is actually (A) or (B). This happens when a student correctly identifies that one statement is sufficient but then assumes both are needed because the other statement provides "additional" information. Remember: if Statement (1) alone is sufficient, the answer is either (A) or (D)—it can never be (C). The presence of redundant information in the other statement does not downgrade an individually sufficient statement.

Worked Example — Independent Sufficiency Analysis

Consider the following Data Sufficiency problem, which illustrates the independent evaluation process in full detail.

📝 Sample Problem
What is the value of integer n? (1) n² = 36 (2) n is a positive integer
Worked Solution: Independent Evaluation of Each Statement
1
Step 1 — Analyze the Question StemThe stem asks "What is the value of integer n?" This is a value question, so sufficiency requires that we determine a single, unique value for n. The stem also provides a constraint: n is an integer. This constraint is available for use with both statements.
2
Step 2 — Evaluate Statement (1) AloneStatement (1) says n² = 36. Combined with the stem constraint that n is an integer, the solutions are n = 6 and n = −6. Since two values are possible, Statement (1) does not yield a unique answer. We apply the counterexample method: if n = 6, the answer is 6; if n = −6, the answer is −6. Two different answers ⟹ Not Sufficient.
Statement (1) ALONE: Not Sufficient
3
Step 3 — Evaluate Statement (2) AloneStatement (2) says n is a positive integer. Combined with the stem (which already tells us n is an integer), we now know n is a positive integer. However, n could be 1, 2, 3, or any positive integer—there are infinitely many possibilities. Statement (2) does not uniquely determine n.
Statement (2) ALONE: Not Sufficient
4
Step 4 — Since Both Are Not Sufficient Alone, Test CombinedBecause neither statement is individually sufficient, we now combine them. From Statement (1), n² = 36, so n = 6 or n = −6. From Statement (2), n is positive. The only value satisfying both conditions is n = 6. The combined information yields a unique value.
Combined: Sufficient → Answer is (C)
5
Step 5 — Verify Against the Decision MatrixStatement (1): Not Sufficient. Statement (2): Not Sufficient. Together: Sufficient. Consulting the decision matrix: NS + NS + Together Sufficient = Answer (C). This confirms our selection. Note that if the stem had stated "n is a positive integer" instead of just "n is an integer," then Statement (1) alone would have been sufficient (yielding n = 6 uniquely), and the answer would have been (A).
🔑 PROCESS CHECK
Notice how the answer hinged entirely on the discipline of independent evaluation. Had the test-taker mentally combined the statements from the start—thinking "n² = 36 and n is positive, so n = 6"—they might have incorrectly chosen (D) (each alone sufficient) or simply jumped to the answer without confirming that each statement individually fell short. The sequential, isolated approach is not merely a best practice; it is the only reliable method.

Common Pitfalls & Strategic Countermeasures

Even well-prepared candidates fall into predictable traps during Data Sufficiency questions. Understanding these pitfalls transforms them from hidden dangers into recognizable patterns that can be avoided systematically. The table below catalogs the most frequent errors encountered during independent evaluation, alongside the strategic countermeasures that prevent them.

Common independent evaluation pitfalls and their strategic solutions.
PitfallDescriptionCountermeasure
Statement BlendingUnconsciously importing information from Statement (2) while evaluating Statement (1), or vice versa.Physically cover the other statement with your hand or mentally bracket it. Write "Stem + (1) ONLY" at the top of your scratch work.
Solving Instead of AssessingSpending time computing the actual answer rather than determining whether a unique answer exists.Ask "CAN I solve it?" not "WHAT is the answer?" Stop as soon as you confirm uniqueness or find a counterexample.
Ignoring Stem ConstraintsFailing to use constraints given in the question stem (e.g., "x is a positive integer") when evaluating each statement.Always list stem constraints first on your scratch work. They are universal facts available to every evaluation pathway.
Yes/No ConfusionMistaking a definitive "No" answer for insufficiency. If a statement always yields "No," it is sufficient.Reframe: sufficiency means consistency, not affirmation. "Always No" = Sufficient. "Sometimes Yes, Sometimes No" = Not Sufficient.
Insufficient CounterexamplesTesting only one or two numbers and declaring sufficiency because they happened to produce the same answer.Deliberately test adversarial cases: 0, negatives, fractions, and extremes. Confirm sufficiency only through algebraic proof, not limited sampling.
KEY TAKEAWAY
Think of Data Sufficiency like a laboratory experiment with controlled variables. In a well-designed experiment, you change only one variable at a time to isolate its effect. Similarly, when evaluating statements, you must isolate each one—holding everything else constant (i.e., using only the stem)—to determine its individual contribution. Changing two variables simultaneously (reading both statements at once) makes it impossible to attribute the result to either one, just as it does in experimental science.

Connection to Advanced Data Sufficiency Patterns

The skill of independent sufficiency evaluation is not an end in itself—it is the foundation upon which more sophisticated analytical patterns are built. As you encounter higher-difficulty GMAT problems, you will notice that the independent evaluation phase becomes more nuanced, requiring deeper mathematical insight and more creative counterexample construction. The table below contrasts the independent evaluation approach at a foundational level with its manifestation in advanced Data Sufficiency problems.

How independent sufficiency evaluation scales from foundational to advanced GMAT difficulty.
DimensionFoundational ApplicationAdvanced Application
Counterexample DifficultyCounterexamples are integers or simple fractions that are easy to identify.Counterexamples may involve irrational numbers, boundary conditions, or edge cases requiring algebraic insight to construct.
Hidden ConstraintsConstraints in the stem are explicit (e.g., "x is a positive integer").Constraints may be implicit—embedded in geometric properties, divisibility rules, or inequality chains that must be deduced.
Statement InteractionStatements provide clearly distinct pieces of information.One statement may appear to merely restate or be a logical consequence of the other, requiring you to recognize logical equivalence or independence.
Algebraic ComplexitySingle-variable equations or direct computation.Systems of equations, quadratic inequalities, number theory arguments, or combinatorial reasoning required to assess sufficiency.
Yes/No SubtletyThe yes/no condition is straightforward to test.The yes/no condition may require proving a universal statement or recognizing that an exception exists only in a non-obvious corner case.

As you progress to 700+ level questions, you will encounter problems where independent evaluation reveals that one statement is a logical subset of the other—meaning that any scenario satisfying Statement (1) automatically satisfies Statement (2), but not vice versa. In such cases, if Statement (2) is sufficient, Statement (1) is automatically sufficient as well (since it is more restrictive). Recognizing these logical relationships during independent evaluation can save significant time and prevent errors during the combination phase. The core discipline, however, remains unchanged: evaluate each statement on its own terms first, and let the decision matrix guide your answer selection.

Practice Problems

PROBLEM 1CONCEPTUAL
In a Data Sufficiency problem, you determine that Statement (1) alone is sufficient and Statement (2) alone is also sufficient. A classmate argues that the answer must be (C) because "both statements are needed." Explain why the classmate is wrong and identify the correct answer.
PROBLEM 2BASIC CALCULATION
What is the value of x? (1) 3x + 7 = 22 (2) x is an odd prime number less than 10 Determine the sufficiency of each statement independently.
PROBLEM 3INTERMEDIATE
Is the integer n divisible by 6? (1) n is divisible by 3. (2) n is divisible by 12. Evaluate each statement independently and determine the answer.
PROBLEM 4APPLIED
A retailer sold a jacket at a profit. What was the retailer's profit as a percentage of cost? (1) The jacket was sold for $180. (2) The cost of the jacket was 75% of the selling price. Evaluate each statement independently.
PROBLEM 5CRITICAL THINKING
If x and y are integers, is x > y? (1) x² > y² (2) x³ > y³ Evaluate each statement independently and provide a rigorous justification.

Lesson Summary

The cornerstone of Data Sufficiency success is the disciplined practice of independent evaluation—assessing each statement in complete isolation before considering any combined analysis. Every problem begins with reading the question stem and identifying whether it poses a value question (requiring a unique numerical answer) or a yes/no question (requiring a definitive, consistent answer). For value questions, sufficiency demands exactly one possible answer; for yes/no questions, sufficiency demands that every valid scenario produces the same verdict. The counterexample method is the primary tool for disproving sufficiency: finding two valid scenarios with different answers conclusively demonstrates that a statement is not sufficient.

The results of independent evaluation map directly to the five fixed answer choices through a 2×2 decision matrix. Answer choices (A), (B), and (D) are resolved entirely during independent evaluation, while the choice between (C) and (E) requires a subsequent combined analysis. Avoid common pitfalls such as statement blending (mixing information across statements), confusing a definitive "no" with insufficiency, and solving for the actual answer when only sufficiency assessment is needed. Master this process, and you will approach every Data Sufficiency question with a clear, repeatable, and error-resistant framework.

Varsity Tutors • GMAT Data Insights • Determine Sufficiency — Determine whether statements are sufficient independently.