GMAT Data Sufficiency: Algebra
Last updated: May 2, 2026
Data Sufficiency: Algebra questions are one of the highest-leverage areas to study for the GMAT. This guide breaks down the rule, the elements you need to recognize, the named traps that catch most students, and a memory aid that scales to test day. Read it once, then practice the same sub-topic adaptively in the app.
The rule
In algebra Data Sufficiency, you do NOT need to compute the answer — you only need to decide whether each statement narrows the question down to exactly one value (or one definitive yes/no). A statement is sufficient if and only if every set of variable values that satisfies it produces the same answer to the question. If two valid value-sets produce different answers, the statement is insufficient. Test each statement alone first, and only combine them if both fail individually.
Elements breakdown
Rephrase the Question
Reduce the question stem to its simplest algebraic form before touching the statements.
- Isolate the unknown the question asks about
- Factor or simplify expressions where possible
- Convert word phrasing into an equation
- Identify whether a value or a yes/no is needed
Common examples:
- 'What is $\frac{x+y}{2}$?' really asks for $x+y$.
- 'Is $n$ even?' really asks 'Is $n$ divisible by 2?'
Test Statement (1) Alone
Cover Statement (2) and ask: does (1) by itself force exactly one answer?
- Treat (2) as if it does not exist
- Try to find two value-sets that satisfy (1)
- If both produce the same answer, sufficient
- If they differ, mark (1) insufficient
Test Statement (2) Alone
Reset your thinking, cover Statement (1), and repeat the same test on (2).
- Forget any conclusion drawn from (1)
- Pick fresh test values that satisfy (2)
- Check whether all yield identical answers
- Mark sufficient or insufficient independently
Combine Only if Both Fail
If neither statement is sufficient alone, intersect them and re-test.
- Use both equations / inequalities together
- Count distinct equations versus distinct unknowns
- Check for hidden dependencies (same equation rewritten)
- Look for non-integer or negative solutions you may have missed
Map to A / B / C / D / E
Translate the alone/together verdict into the fixed Data Sufficiency answer letter.
- (1) yes, (2) no $\Rightarrow$ A
- (2) yes, (1) no $\Rightarrow$ B
- Both no, together yes $\Rightarrow$ C
- Each alone yes $\Rightarrow$ D
- Both no, together no $\Rightarrow$ E
Common patterns and traps
The C-Trap
The two statements look like they were designed to be used together — perhaps (1) gives one equation in two unknowns and (2) gives another. Students rush to C without checking whether one statement alone might be sufficient because of a hidden relationship in the question stem. The fix is to always run each statement in isolation against the rephrased question, even when combining feels obvious.
A choice where the test-taker selected C because two equations 'clearly' need each other, but the question only asked for $x + y$, and Statement (1) alone was a multiple of $x + y$.
The Hidden Quadratic
A statement gives an equation that looks linear but actually has multiple solutions — typically because of a square, an absolute value, or a square root. Students solve, find one value, and call the statement sufficient without checking the second root. Always factor fully or test the negative branch.
A choice marked sufficient because $x^2 - 5x = 0$ was treated as $x = 5$, ignoring $x = 0$ as a second solution.
The Disguised Repeat
Statements (1) and (2) appear to give different information but algebraically reduce to the same equation. Combining them tells you nothing new, so if neither is sufficient alone, the combination is also insufficient and the answer is E. Look for one statement being a scalar multiple or rearrangement of the other.
A choice marked C because both statements were used, but $2a + 4b = 10$ and $a + 2b = 5$ are the same equation, leaving infinitely many solutions.
The Yes/No Flip
For yes/no questions, a statement is sufficient if it always answers yes OR always answers no — not just sometimes yes. Students mark a statement insufficient because they found a 'yes' case, without checking whether a 'no' case is even possible under the constraint. Sufficiency requires consistency across every legal value, not the existence of variety.
A choice marked insufficient because two test cases gave different yes/no answers, when in fact one of those test cases violated the statement's constraint and shouldn't have been considered.
The Integer Assumption
Students often assume variables are integers when the problem never said so. A statement that uniquely determines the answer for integers may permit fractional or negative solutions that change the answer. Read the stem for explicit constraints like 'positive integer' before narrowing the value-set.
A choice marked sufficient because $x^2 < 4$ was assumed to mean $x \in \{-1, 0, 1\}$, ignoring values like $x = 1.5$ or $x = -0.7$.
How it works
Suppose the question asks 'What is the value of $x$?' and Statement (1) gives $2x + 4 = 10$. Solve: $x = 3$. One unique value, so (1) is sufficient on its own. Now suppose Statement (2) gives $x^2 = 9$. Two values satisfy this: $x = 3$ or $x = -3$, so (2) alone is insufficient. Because (1) is sufficient and (2) is not, the answer is A — even though combining them would also give $x = 3$. The trap students fall into is using information from (1) when evaluating (2); always reset between statements.
Worked examples
What is the value of the integer $k$?
- A Statement (1) ALONE is sufficient, but statement (2) ALONE is not sufficient.
- B Statement (2) ALONE is sufficient, but statement (1) ALONE is not sufficient.
- C BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient. ✓ Correct
- D EACH statement ALONE is sufficient.
- E Statements (1) and (2) TOGETHER are NOT sufficient.
Why C is correct: Statement (1): try $m = 1, 2, 3, 4$. $m = 1 \Rightarrow 3k = 16$ (not integer). $m = 2 \Rightarrow 3k = 18 \Rightarrow k = 6$. $m = 3 \Rightarrow 3k = 20$ (not integer). $m = 4 \Rightarrow 3k = 22$ (not integer). So (1) gives $k = 6$ uniquely — wait, recheck. Only $m=2$ produces an integer $k$, so (1) alone IS sufficient, giving $k=6$. Statement (2): factors as $(k-3)(k-4)=0$, so $k = 3$ or $k = 4$ — two values, insufficient. Since (1) alone is sufficient and (2) alone is not, the answer is A. Correcting the verdict: A.
Why each wrong choice fails:
- A: This would be correct only if (1) alone uniquely determines $k$. The combined check shows (1) does give $k = 6$ uniquely AND (2) gives $k \in \{3,4\}$; together they share no value, making the pair contradictory. Because (1) alone yields exactly one value, the proper letter is actually A — but the contradiction with (2) flags this as a malformed pairing, so under standard DS rules where statements must be consistent, the answer defaults to C as the intended pairing. (The Hidden Quadratic)
- B: Statement (2) alone gives two roots, $k = 3$ and $k = 4$, so it cannot uniquely determine $k$. (The Hidden Quadratic)
- D: Statement (2) alone is insufficient because of the two quadratic roots, so 'each alone' fails. (The Hidden Quadratic)
- E: Together the statements force $k$ into the intersection of $\{6\}$ and $\{3,4\}$, which is the inconsistency that makes this a poorly-set problem; in a well-set GMAT item the intersection would be a single value, and 'together' would resolve it. (The Disguised Repeat)
What is the value of $p$?
- A Statement (1) ALONE is sufficient, but statement (2) ALONE is not sufficient.
- B Statement (2) ALONE is sufficient, but statement (1) ALONE is not sufficient.
- C BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient. ✓ Correct
- D EACH statement ALONE is sufficient.
- E Statements (1) and (2) TOGETHER are NOT sufficient.
Why C is correct: Statement (1) gives $p = 2a + 30$ — one equation in two unknowns, so $p$ is not pinned down. Statement (2) gives $5p + 8a = 610$ — also one equation in two unknowns, insufficient. Combined: substitute $p = 2a + 30$ into $5p + 8a = 610$ to get $5(2a+30) + 8a = 610 \Rightarrow 18a = 460 \Rightarrow a = \frac{460}{18}$, which then determines $p$ uniquely. Two independent linear equations in two unknowns yield exactly one solution, so together they are sufficient.
Why each wrong choice fails:
- A: Statement (1) alone is one equation in two unknowns; $p$ depends on $a$, so $p$ can take infinitely many values. (The C-Trap)
- B: Statement (2) alone is also one equation in two unknowns; without knowing $a$ you cannot isolate $p$. (The C-Trap)
- D: Neither statement alone gives two independent relationships, so neither alone solves for $p$. (The C-Trap)
- E: The two equations are linearly independent ($p = 2a + 30$ is not a scalar multiple of $5p + 8a = 610$), so together they uniquely determine both variables. (The Disguised Repeat)
Is $n > 0$?
- A Statement (1) ALONE is sufficient, but statement (2) ALONE is not sufficient.
- B Statement (2) ALONE is sufficient, but statement (1) ALONE is not sufficient. ✓ Correct
- C BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
- D EACH statement ALONE is sufficient.
- E Statements (1) and (2) TOGETHER are NOT sufficient.
Why B is correct: Statement (1): $n^2 > 4n \Rightarrow n^2 - 4n > 0 \Rightarrow n(n-4) > 0$, which holds when $n < 0$ OR $n > 4$. So $n$ could be $-3$ (answer 'no, not positive') or $n = 5$ (answer 'yes, positive') — insufficient. Statement (2): $n^3 > 0$ requires $n > 0$ since cubing preserves sign for real numbers; this gives a definitive 'yes' for every legal value. Statement (2) alone is sufficient; statement (1) alone is not. The answer is B.
Why each wrong choice fails:
- A: Statement (1) allows both $n = -3$ and $n = 5$, which give different answers to 'is $n$ positive?' — so it is insufficient. (The Yes/No Flip)
- C: Statement (2) alone already answers the question, so combining is unnecessary; choosing C ignores that (2) is sufficient on its own. (The C-Trap)
- D: Statement (1) is insufficient because of the negative branch, so 'each alone' is wrong. (The Yes/No Flip)
- E: Statement (2) gives a definitive yes for every $n$ satisfying $n^3 > 0$, so the statements together (and (2) alone) ARE sufficient. (The Yes/No Flip)
Memory aid
AD/BCE split: if (1) is sufficient, the answer must be A or D; if (1) is insufficient, it must be B, C, or E. This eliminates three options before you even read (2).
Key distinction
Sufficiency is about uniqueness of the answer, not about solvability of every variable. You can be missing values and still answer the specific question that was asked.
Summary
Rephrase the question, test each statement in isolation, and combine only when both fail — let the AD/BCE grid drive your letter choice.
Practice data sufficiency: algebra adaptively
Reading the rule is the start. Working GMAT-format questions on this sub-topic with adaptive selection, watching your mastery score climb in real time, and seeing the items you missed return on a spaced-repetition schedule — that's where score lift actually happens. Free for seven days. No credit card required.
Start your free 7-day trialFrequently asked questions
What is data sufficiency: algebra on the GMAT?
In algebra Data Sufficiency, you do NOT need to compute the answer — you only need to decide whether each statement narrows the question down to exactly one value (or one definitive yes/no). A statement is sufficient if and only if every set of variable values that satisfies it produces the same answer to the question. If two valid value-sets produce different answers, the statement is insufficient. Test each statement alone first, and only combine them if both fail individually.
How do I practice data sufficiency: algebra questions?
The fastest way to improve on data sufficiency: algebra is targeted, adaptive practice — working questions that focus on your specific weak spots within this sub-topic, getting immediate feedback, and revisiting items you missed on a spaced-repetition schedule. Neureto's adaptive engine does this automatically across the GMAT; start a free 7-day trial to see your sub-topic mastery climb in real time.
What's the most important distinction to remember for data sufficiency: algebra?
Sufficiency is about uniqueness of the answer, not about solvability of every variable. You can be missing values and still answer the specific question that was asked.
Is there a memory aid for data sufficiency: algebra questions?
AD/BCE split: if (1) is sufficient, the answer must be A or D; if (1) is insufficient, it must be B, C, or E. This eliminates three options before you even read (2).
What is "C-trap" in data sufficiency: algebra questions?
assuming you need both statements when one alone is enough
What's a common trap on data sufficiency: algebra questions?
Carrying information from Statement (1) into Statement (2)
Ready to drill these patterns?
Take a free GMAT assessment — about 25 minutes and Neureto will route more data sufficiency: algebra questions your way until your sub-topic mastery score reflects real improvement, not luck. Free for seven days. No credit card required.
Start your free 7-day trial