GMAT Focus Data Sufficiency is the section of the exam that punishes haste and rewards discipline. The format is deceptively simple: a short problem stem, two labelled statements, and a fixed five-option answer choice asking whether the data, alone or together, is enough. The cognitive trap is that test-takers treat it as a regular quant problem, plunge into arithmetic, and forget the question they are actually being asked. The GMAT Focus edition preserves the original DS architecture: 18 items inside the Quant module, each scored on a unique logic grid where the correct response is one of five canonical answer choices (A, B, C, D, E). Reading that grid correctly, before any calculation, is the single skill that separates a high-30s DS subscore from a low-40s one.
The anatomy of a Data Sufficiency stem and why it must be rephrased first
A DS question is a small engine with three moving parts. The stem poses a question whose target value (a single number, a yes/no, a ratio, an expression) is hidden inside ordinary prose. Statement 1 and Statement 2 are independent fact packets that may or may not lock the answer down. The five answer choices are identical across the entire section, and they ask one meta-question: 'Is the information you have enough to answer the stem uniquely?' Rephrasing the stem into a precise target is the first non-negotiable step; without it, candidates waste time calculating the wrong thing.
Consider a stem such as: 'What is the value of x?' The target is a single real number. The statements can be read with one question in mind: 'Does this packet of information yield a single, unique value of x, no matter which scenario it allows?' If yes, the statement is sufficient. If the packet produces two or more legal values, the statement is insufficient, even if those values are numerically close. The trap is that test-tellers design stems where two values differ by a sign, a factor, or a hidden integer, and candidates stop the moment they find one answer.
Yes/no stems invert the logic. A stem such as: 'Is x greater than y?' is satisfied by Statement 1 only if, in every legal scenario the statement allows, the answer to the question is unambiguously 'yes.' If the statement permits even one scenario where x is less than y, Statement 1 is insufficient. The grammatical switch from 'What is…' to 'Is…' flips the sufficiency criterion from uniqueness to universal truth. Candidates who fail to notice this switch will mark a 'Yes' answer to the meta-question and a 'Yes' to the embedded question, conflating two different layers of the test.
Three rephrasing moves to make before reading the statements
- Convert the prose into a one-line target. 'What is the value of x?' becomes find a unique real number. 'Is the product of a and b positive?' becomes is sign(a × b) = +1 in every legal scenario.
- Strip social-context words. Phrases such as 'on average', 'at least', 'no more than', and 'an integer' are load-bearing; words such as 'in total' and 'together' often are not.
- Translate constraints into algebra. 'x is a positive integer' becomes x ∈ ℤ⁺, which is a domain restriction that can collapse two mathematical solutions into one DS answer.
This rephrasing habit is what allows a candidate to glance at Statement 1 and immediately judge sufficiency without re-reading the stem. In practice, candidates who skip rephrasing spend 30-45 extra seconds per item rewriting the question inside their head, which is more than the 2-minute DS budget can absorb.
The five canonical answer choices and the only logical relationships they encode
Every GMAT Focus Data Sufficiency item resolves to one of five answer choices. Memorising them is not a study tip; it is the only way to avoid a common error pattern in which the test-taker produces the correct sufficiency conclusion but selects the wrong letter. The five choices, in the order they always appear, are:
- A: Statement 1 alone is sufficient, but Statement 2 alone is not.
- B: Statement 2 alone is sufficient, but Statement 1 alone is not.
- C: Both statements together are sufficient, but neither alone is sufficient.
- D: Each statement alone is sufficient.
- E: Even both statements together are not sufficient.
The middle three options describe the most important logical relationships. C requires the test-taker to verify that the two statements are complementary — each blocks a different route to ambiguity, and the union of the two blocks all ambiguity. D is the strongest possible data state and tends to appear in items where the stem is a value-target and both statements are independent algebraic locks. E is the most underappreciated option; candidates who reflexively try to combine statements sometimes miss cases where the union still allows two scenarios.
How to test the answer choice before committing
The efficient method is a two-pass judgement. First, evaluate Statement 1 in isolation. If it is sufficient, the answer is either A or D. Then evaluate Statement 2 in isolation. If it is also sufficient, the answer is D; if not, the answer is A. If Statement 1 is insufficient, the answer cannot be A or D, so the candidate moves on. This binary tree, applied consistently, removes the paralysis that afflicts candidates who try to read all five options after each statement. It also forces the test-taker to give every statement a clean sufficient/insufficient verdict, which is the only decision the answer choices are asking for.
The 90-second budget per item is a soft average, not a rule. Some DS items — particularly those with integer constraints, hidden squares, or domain restrictions — demand 120-150 seconds, and the candidate must trade that time against an easier item elsewhere in the section. In my experience, the candidates who plateau at a low DS subscore are the ones who refuse to spend more than 75 seconds on the hard items, then lose 4-5 minutes of cumulative time to re-checking the easy ones. The mental model should be: spend the time the item deserves, then move on without re-verification.
Statement 1 alone versus Statement 2 alone: reading the logical frame of a Data Sufficiency prompt
Statements 1 and 2 are deliberately written to feel symmetric. They often share a variable, a function, or a context (a business, a tank, a sequence), which leads candidates to assume their sufficiency status will match. In reality, the second statement is engineered to break the symmetry: it adds, removes, or transforms the very piece of information that made the first statement ambiguous. The candidate's job is to identify that breaking element, not to assume parallelism.
Consider the stem: 'A rectangle has perimeter 40. What is its area?' Statement 1: 'The length of the rectangle is twice its width.' This locks length and width uniquely: 2L + 2W = 40 and L = 2W give W = 20/3 and L = 40/3, so the area is uniquely 800/9. Statement 1 alone is sufficient. Statement 2: 'The diagonal of the rectangle is 10√2.' A perimeter of 40 and a diagonal of 10√2 also uniquely fix the rectangle, since the diagonal and perimeter together determine the side lengths. Statement 2 alone is sufficient. The answer is D. The symmetry holds here, which is precisely what makes the item a 'fair' test of sufficiency judgement.
Now consider a stem where the symmetry breaks. 'A positive integer n is multiplied by 2. Is the product greater than 50?' Statement 1: 'n > 30.' This guarantees the product exceeds 60, so the answer is always yes — sufficient. Statement 2: 'The product is a multiple of 9.' Multiplying n by 2 yields a multiple of 9 only when n is a multiple of 9/2, but n must be a positive integer, so n ∈ {9, 18, 27, 36, …} and the products are {18, 36, 54, 72, …}. Some of these products are below 50, others above, so Statement 2 is insufficient. The answer is A. The first statement looked modest; the second looked powerful; the sufficiency ranking was inverted by the integer constraint. Candidates who trusted surface impressions chose D and were wrong.
The hidden integer trap
Integer constraints are the single most underweighted feature in DS preparation. A statement that mathematically allows two values (such as x² = 9) becomes sufficient the moment the stem declares x is a positive integer (x = 3, unique). The reverse is also true: a statement that looks sufficient because it yields a unique real solution becomes insufficient the moment x is allowed to be negative, complex, or non-integer. Candidates who fail to map domain restrictions onto the algebra will repeatedly mark A or B when the correct answer is C or E. In a focused preparation block, the highest-yield drill is a 20-item set restricted to integer traps.
Rephrasing, then testing, then committing: the 90-second decision tree
The decision tree for a single DS item, compressed, runs in three phases. Phase one is rephrasing: rewrite the stem as a target, identify the answer type (value, yes/no, expression, ratio), and note any domain restrictions. This phase should take no more than 15 seconds; longer means the stem was misread. Phase two is the two-statement evaluation: judge Statement 1 in isolation, then Statement 2, then both together, using a clean sufficient/insufficient verdict for each. Phase three is the answer mapping: convert the three verdicts into the correct letter using the canonical table.
For most candidates the bottleneck is phase two, where the temptation to compute a numerical answer is strongest. A DS question is never asking for the numerical answer to the stem; it is asking whether the data is rich enough to produce one. Calculating the actual value of x is often a waste of time, except as a tool to disprove sufficiency. If a single computation produces a single value, that alone is enough to declare sufficiency; if the candidate has to enumerate cases, the statement is probably insufficient.
A worked example: applying the decision tree end-to-end
Stem: 'Is x a positive integer?' Statement 1: 'x² − x is a positive integer.' Statement 2: 'x² is a positive integer.'