Data Sufficiency is the most structurally distinctive question family on the GMAT Focus Quant section, and the one where a small number of repeatable habits separate a 75th-percentile score from a 90th-percentile one. Each item presents a question stem, two labelled statements, and a fixed set of five answer choices whose verbs (sufficient, not sufficient, both, either, neither) carry every ounce of the scoring weight. The arithmetic is rarely the obstacle; the obstacle is keeping your reasoning organised under a 62-minute clock while the test asks, again and again, whether a single piece of information is enough to settle the matter.
This article builds a working strategy for Data Sufficiency on the GMAT Focus Edition. The approach rests on three habits: read the stem for its question type before you touch Statement 1, treat each statement as a self-contained world you can enter or leave, and resist the urge to do the final arithmetic once you already know sufficiency. Each habit is mechanical, trainable, and easy to drop the moment pressure builds, which is why the rest of this piece is dedicated to the concrete moves that keep the habits alive when the timer is running.
Reading the stem in under 30 seconds: identify the question type and the unknown
The single most common failure I see in tutoring sessions is not a miscalculation but a misread stem. Candidates read a Data Sufficiency prompt the way they read a regular Quant problem, which is to say they start hunting for the numbers and only later discover what the question was actually asking. On the GMAT Focus, that delay is expensive. The five answer choices are completely insensitive to the value of the answer, so any arithmetic you perform before you understand the unknown is, in scoring terms, a gift to the clock.
Your first 30 seconds on a Data Sufficiency item should answer two questions, in this order: what kind of value does the question ask for, and what would count as sufficient evidence. Is the question asking for a unique numerical value, a range, an integer count, a yes/no decision, or a relationship such as "x greater than y"? Each of those answer types has a different sufficiency signature. A unique numerical value requires that the data pin down exactly one number. A yes/no question only requires that the data force the same answer every time, regardless of the specific values. A relationship such as "is x positive?" only requires that the data force a single polarity.
Once the question type is clear, look for hidden traps. Some stems contain a quantifier that flips the entire logical load: "What is the value of x?" behaves nothing like "What is one possible value of x?". The first demands a unique answer; the second only demands that the statements jointly restrict x to some set you can name. Other stems bury a constraint inside the wording, such as "x is a positive integer" or "x and y are distinct". Those three words change the sufficiency calculus completely because they restrict the universe the statements can choose from. Underline them in your mind, or write them on your scratch pad. A stem that says "What is the value of x?" with no further constraint is a much harder prompt than the same stem with "x is a positive integer" attached, because the integer condition collapses many near-miss cases into a single verdict.
A useful 30-second drill is to restate the stem out loud, in plain English, as if you were explaining the question to a friend. If your restatement contains the word "exactly", "unique", or "the value of", you are looking for a single answer. If it contains "must be", "always", or "is it true that", you are looking for a forced verdict. If it contains "could be" or "is it possible that", the test is asking whether the statements can produce the named outcome, which is a much softer target. The restatement step costs you ten seconds and saves you the most common error category on the exam: answering a different question than the one that was asked.
The five answer-choice verbs and what they really demand
The Data Sufficiency answer key is fixed across the entire GMAT Focus, and that fixed key is the single biggest strategic gift the format offers. You will never see a sixth option, and you will never see a verb that is not one of five. Memorising the structure of those five choices, including the conditions under which each becomes available, lets you work backwards from the choice set to the logic. The structure looks like this in plain form:
- Statement (1) ALONE is sufficient — Statement 2 is neither needed nor able to change the verdict.
- Statement (2) ALONE is sufficient — Statement 1 is neither needed nor able to change the verdict.
- BOTH statements TOGETHER are sufficient, but NEITHER alone is sufficient — the classic "1+2=3, 1≠2" case.
- EACH statement ALONE is sufficient — Statement 1 settles it; Statement 2 also settles it; no need to combine.
- NEITHER statement NOR both together is sufficient — the test is essentially undecidable on the evidence provided.
The trap that catches most candidates is to read these five choices as ordinal, that is, to assume the test is moving from "least information" to "most information". It is not. The five choices are logical, not ordinal. Choice (D), the "each alone" option, is no more or less powerful than Choice (B); both are simply scenarios that fit the data. What unifies the five is the work you do on each statement, not the order in which they are listed.
Two tactical points flow from this. First, never eliminate a choice because it "feels too generous". If Statement 1 truly settles the question, then (A) is a legitimate verdict, even when the problem looks like it ought to require both. Second, treat the four "sufficient" outcomes as a single category and the one "insufficient" outcome as its opposite. The whole exam is, in scoring terms, asking: is there enough information, or is there not. The verb that the answer choice uses is just a routing label.
For most candidates I tutor, the highest-leverage move is to translate the answer key into a decision tree. Decide first whether Statement 1 is sufficient. If yes, ask whether Statement 2 is also sufficient. If yes, the answer is (D). If no, the answer is (A). If Statement 1 is not sufficient, move to Statement 2. If Statement 2 is sufficient on its own, the answer is (B). If Statement 2 is also not sufficient, ask whether the two together are sufficient. If yes, the answer is (C). If no, the answer is (E). This is the only logic the answer key actually requires. If you can hold that tree in your head, the verb in front of the answer choice becomes almost decorative.
Testing Statement 1: the art of finding a counterexample
Once you have isolated the question the stem is asking, the work on Statement 1 is binary: is it sufficient, or is it not? Sufficiency in the GMAT Focus sense is a stronger claim than "the statement is true". Sufficiency means that the statement, taken on its own, removes all ambiguity about the unknown. The fastest way to test that claim is to attempt the opposite: try to construct a counterexample. A single valid counterexample is enough to prove that the statement is not sufficient. Two valid examples that yield different answers are also enough. You only need one consistent example to prove that the statement is sufficient.
Counterexample construction is the skill that separates experienced Data Sufficiency solvers from novices. It requires you to treat the statement as a constraint on a variable, and then ask: under this constraint alone, is the unknown forced? If the constraint is "x is a positive integer", the question is whether the stem's question is answered uniquely for every positive integer x. The answer is no for most prompts, yes for a few. If the constraint is "x = 7", the answer is yes for almost any stem. The skill is to read the constraint, sketch the resulting domain, and ask whether the domain collapses to a single value, a single polarity, a single yes/no answer.
In practice, three categories of counterexample appear again and again. The first is the symmetric case, where swapping two variables preserves the constraints. If x and y satisfy a relation and the question asks "what is the value of x?", a symmetric counterexample gives you a different x that also works, which is enough to kill sufficiency. The second is the boundary case, where the unknown sits at the edge of the constraint. If a statement says "x is greater than 5" and the stem asks "is x greater than 10?", the boundary value x = 7 is a counterexample to sufficiency, because the statement does not rule out x = 7. The third is the family case, where the statement pins down a shape but not a scale. "x and y are in a ratio of 2:1" is the canonical example: the ratio is fixed, but the absolute values are not, so any stem asking for a specific value of x is not answered by that statement alone.
One of the most expensive mistakes on Statement 1 is the "partial sufficiency" error, where a candidate finds a single answer under the statement's constraint and concludes that the statement is sufficient. A single answer is a necessary but not sufficient condition for sufficiency. The statement is sufficient only when every value consistent with the statement yields the same answer to the stem's question. A counterexample kills sufficiency; a single example never proves it on its own. Train yourself to ask, after you find a working value: "is this the only value the statement allows?" If you cannot answer yes with confidence, the statement is not sufficient.
Testing Statement 2 and the temptation to combine
Statement 2 testing is structurally identical to Statement 1 testing, and that symmetry is the second biggest strategic gift of the format. The same counterexample logic applies. The same boundary, family, and symmetric cases apply. The only difference is the constraint, and the constraint is the only thing you should be looking at. Candidates often forget this symmetry and start treating Statement 2 as a continuation of Statement 1, which leads them to combine the two statements before they have completed the single-statement analysis. Combining early is the second-most-expensive mistake on Data Sufficiency, after the misread-stem error.
The reason combining early is so costly is that it muddies the answer choice. If you combine before you finish, you cannot cleanly distinguish "(A) sufficient" from "(B) sufficient" from "(C) sufficient". The whole architecture of the answer key is built on the assumption that you have first asked about each statement in isolation. Skip that step and you force yourself to redo the work in less time, on an item that has already consumed more of your budget than it deserved.
A second temptation on Statement 2 is the "information is good" fallacy. Candidates will look at a Statement 2 that adds detail to Statement 1 and assume that the addition must help. Information is not the same as sufficiency. A statement can be informative, plausible, and even numerically true, and still fail to change the answer to the stem's question. The test of sufficiency is whether the statement, taken alone, settles the unknown, not whether it tells you something. The way to neutralise this fallacy is to test Statement 2 in complete isolation, pretending Statement 1 does not exist. If Statement 2 alone settles the stem, the answer is (B), regardless of how elaborate Statement 1 happens to be.
There is one more subtle trap on Statement 2 testing. Some statements, when taken alone, are insufficient for an interesting reason: they are too powerful. A Statement 2 that asserts "x = 7" is, of course, sufficient on its own, but candidates sometimes resist the answer (B) because the statement feels too easy. The test does not calibrate difficulty per item. A one-line Statement 2 is just as valid as a four-line Statement 2, and either can resolve the question. If Statement 2 alone removes the ambiguity, the answer is (B). Period.
Combining the two statements: when it helps and when it does not
The combination step is only relevant when neither statement alone is sufficient. If you have reached this branch of the decision tree, the question is whether the two statements, taken together, force a unique answer. The mechanics are the same as on the single-statement branch: look for a single value the combined constraints force, then check whether any other pair of values also satisfies both. Two specific patterns deserve attention because they recur in scoring material.
The first is the linear-system pattern. When Statement 1 gives you one linear equation in two unknowns and Statement 2 gives you a second linear equation in the same two unknowns, the combination is sufficient because the intersection is a single point. This is the cleanest combination on the exam, and it is the pattern most candidates recognise. The version that catches people is the disguised linear system, where the "equations" are inequalities, ratios, or products. A ratio of 2:1 is a single linear constraint, just like an equation. An inequality such as "x > y" is a half-plane. Two such constraints, properly chosen, pin down a region. The question is whether the stem asks for a value or for a polarity. A stem asking "is x positive?" can be settled by a region even when a stem asking "what is x?" cannot.
The second is the closure pattern. Statement 1 restricts the unknown to a finite set, and Statement 2 picks one element of that set. For example, Statement 1 says "x is one of {3, 5, 7}", and Statement 2 says "x is odd". Together, the statements narrow x to {3, 5, 7}, but they do not collapse to a single value. Add a third fact, "x is a prime" (which the first statement already implies), and the set is still {3, 5, 7}. The combination is not sufficient because two valid scenarios remain. This is the kind of combination step that often fools candidates into choosing (C) when the answer is (E).