Skip to content
GMAT overview

Public topic · GMAT

Data Sufficiency Strategy

A free GMAT note on data sufficiency strategy: testing each statement alone before combining them, the five-outcome decision scheme our drills train, and the non-integer, negative, and zero cases that break hasty sufficiency verdicts.

Concise answer

Data sufficiency questions ask whether given information determines an answer, not what the answer is. The working discipline is a fixed ladder — statement (1) alone, statement (2) alone, and the combination only if both alone fail — with each verdict slotted into a five-outcome scheme. Most wrong verdicts come from two habits: solving all the way to a number instead of stopping at determinacy, and testing only convenient values while forgetting negatives, zero, and non-integers.

Definitions

Sufficient
A statement is sufficient when it determines exactly one answer to the question asked — a unique number for a value question, or a definite yes or definite no for a yes/no question.
Statement independence
The discipline of evaluating each numbered statement using only the question stem, deliberately wiping the other statement's information from your scratch work.
Five-outcome scheme
The decision structure sufficiency verdicts fall into: only the first statement suffices, only the second, both together but neither alone, either alone, or neither even together.
Yes/no sufficiency question
A question whose answer is yes or no; a statement that forces a definite answer — including a definite no — is sufficient, while one that permits both answers is not.

Intuition

A sufficiency verdict is an audit, not a computation: ask whether two different scenarios could both satisfy the statement yet answer the question differently. One counterexample pair ends the audit as 'insufficient' — and hunting for that pair is usually faster than solving.

Treat the two statements as sealed envelopes. Opening envelope (1) must not change what envelope (2) says on its own; only after both fail alone do you pour them into the same pot. The combined case is a genuinely new problem, not a formality.

Concept walkthrough

GMAC lists data sufficiency among the skills the GMAT assesses, alongside critical reasoning, problem solving, logic, and analysis, and its exam-structure page describes a three-section exam whose Data Insights section (45 minutes, 20 questions) measures data literacy. A sufficiency item gives you a question stem plus two numbered statements, and the task is to say which combination of statements determines the answer. We do not reproduce GMAC's answer-option wording; our drills train the underlying five-outcome scheme — first alone, second alone, both together, either alone, neither — which is the decision every such item requires.

The evaluation ladder is fixed and worth making mechanical. Test statement (1) with only the stem; record sufficient or not. Wipe it, test statement (2) the same way. Only if both fail alone do you combine them. The ladder exists because the outcomes are mutually exclusive: if statement (1) alone suffices, the 'both together' outcome is wrong by definition, no matter how comfortable combining feels. Stopping at determinacy also saves the time that full solving burns — once you know an equation pins down exactly one legal value, the value itself is irrelevant.

The hard part is the audit standard. A statement is insufficient the moment two legal cases answer the question differently, so strong drills maintain a standing list of adversarial cases: a negative number, zero, and a non-integer such as 1/2. Squares hide signs (x² = 9 allows x = -3), products hide sign pairs, and 'number' never means 'positive integer' unless the stem says so. On yes/no questions the standard flips in a way that surprises new test-takers: a statement forcing a definite no is sufficient — insufficiency requires that both yes and no remain possible.

After this page, you should be able to

  • Run the fixed evaluation ladder: statement (1) alone, statement (2) alone, and the combination only when both alone fail.
  • Stop each evaluation at determinacy — 'exactly one answer exists' — instead of computing the answer.
  • Stress-test quick verdicts with negative, zero, and non-integer cases before locking them in.
  • Distinguish value questions from yes/no questions and apply the matching standard of sufficiency.

Formulas and assumptions

Statement evaluation ladder

test (1) alone -> wipe -> test (2) alone -> combine only if both alone fail

Variables

  • (1), (2): the two numbered statements, each first taken with the stem only
  • combine: the joint case, evaluated as a new problem

Assumptions

  • Schematic of the working order our drills train, not a quantitative formula.
  • The five outcomes are mutually exclusive; a statement sufficient alone rules out the 'both together' outcome.

Five-outcome decision map

only (1) | only (2) | both together, neither alone | either alone | neither, even together

Variables

  • only (1) / only (2): exactly one statement is sufficient by itself
  • both together: the combination suffices but neither statement alone does
  • either alone: each statement is independently sufficient
  • neither: even the combined information leaves multiple answers

Assumptions

  • Decision structure only; the official on-test answer wording is GMAC's and is not reproduced here.

Sufficiency stress-test set

before 'sufficient': try x < 0, x = 0, and x = 1/2 (a non-integer)

Variables

  • x < 0: breaks verdicts that silently assumed positivity (squares, products, inequalities)
  • x = 0: breaks division and sign reasoning
  • x = 1/2: breaks verdicts that silently assumed integers

Assumptions

  • A counterexample pair — two legal cases with different answers — proves insufficiency immediately.

Worked example

Auditing sufficiency without solving

What is the value of x? (1) x² = 9. (2) x < 0. Decide which combination of the statements determines x.

  1. 1Statement (1) alone: x² = 9 has two legal solutions, x = 3 and x = -3. Two different values of x satisfy the statement, so it is insufficient — the classic trap is 'solving' to x = 3 and stopping.
  2. 2Wipe statement (1). Statement (2) alone: x < 0 is satisfied by every negative number, so it is insufficient.
  3. 3Both alone failed, so combine: x must satisfy x² = 9 and x < 0 simultaneously, which leaves only x = -3. Exactly one value survives, so the combination is sufficient.
  4. 4Slot the verdict into the five-outcome scheme: both together, neither alone.
  5. 5Note where the audit did the work: the negative case -3 is exactly the stress-test value that exposes statement (1); no equation ever needed to be fully 'solved'.

Neither statement alone is sufficient; the two statements together are — they force x = -3 (the 'both together, neither alone' outcome).

Common traps

  • Solving to a number instead of stopping at determinacy — it burns time and tricks you into believing the one candidate you computed is the only one.
  • Forgetting non-integer, negative, and zero cases: x² = 9 does not mean x = 3, and a 'number of things' is only an integer when the stem makes it one.
  • Letting statement (1)'s information leak into your evaluation of statement (2) alone.
  • Calling a definite 'no' insufficient on a yes/no question — a statement that always forces no answers the question and is sufficient.
  • Defaulting to 'both together' because combining feels safe; if either statement alone suffices, the combined outcome is wrong by definition.

Question depth and domain coverage vary by exam. Practice answers are checked after submission.

Sources

  1. The GMAT Focus Edition: Exam Structure, Content & FeaturesGMAC. Accessed 2026-08-03. Use as a cited source for exam facts; do not imply affiliation or reproduce protected test material.
  2. Evaluate Talent with GMAT (The GMAT Exam)GMAC. Accessed 2026-08-03. Use as a cited source for exam facts; do not imply affiliation or reproduce protected test material.

Review and maintenance

Source-checked by publisher
Publisher record
Keiko Study editorial owner
Publisher placeholder; no individual credential claim is made yet.
Reviewer record
Technical reviewer pending
Placeholder only; this content is not labeled as reviewed by a named specialist.
Last source check
2026-08-03
Next scheduled review
2026-11-03

Recheck the GMAC exam-structure page for section and question-format changes before each major GMAT preparation cycle; official answer-option wording is GMAC's and is not reproduced here.