Data Sufficiency algebra questions do not ask you to calculate a final value. They ask whether the information is enough to determine one answer. That shift changes the skill being tested: you need to recognize when an equation determines a target, when a quadratic leaves two possibilities, and when a constraint such as "positive integer" closes the gap.
Each question has a question stem and two statements. You decide whether statement (1) alone is sufficient, whether statement (2) alone is sufficient, whether both together are sufficient, or whether even together they are not sufficient. The answer choices are fixed:
Do not carry information from one statement into the other when testing them separately. Each statement is evaluated on its own first.
Before reading the statements, rewrite the question in your own words. Are you looking for a value, a relationship, or a yes/no answer? If the question asks for , then a statement that gives is not sufficient, because could be 3 or -3. If the question asks for , the same statement is sufficient, because both values give the same absolute value.
Sufficiency is about the target, not about how much information a statement contains. A statement can give several facts and still fail if the target remains ambiguous. A single equation can be sufficient if it determines the exact combination the question asks for.
A single linear equation with two variables usually does not determine both variables. The equation has many integer and non-integer solutions. But the same equation can determine a combination. If the question asks for , then , so the statement is sufficient.
Example. What is the value of ?
(1)
(2)
Statement (1) divides to , so it is sufficient. Statement (2) gives a relationship but not the sum, so it is not sufficient. The answer is (A).
This pattern is common. The GMAT rewards looking at the target as an expression rather than as a pair of individual variables.
A quadratic equation usually gives two solutions. A statement such as means or . If the question asks for , the statement is not sufficient unless another condition eliminates one value. If the question asks for the product of the roots, the statement is sufficient because the product is 6 regardless of which root is which.
Example. What is the value of ?
(1)
(2)
Statement (1) gives or , so it is not sufficient. Statement (2) alone does not give a value. Together, , so the answer is (C).
Watch for the same issue with absolute value. gives two values. A condition such as is needed to determine one.
An inequality statement is sufficient for a yes/no question only if it forces the same answer for every allowed value. If the question asks "Is ?" and a statement says , then could be 3 or -3. The statement does not answer the question consistently, so it is not sufficient.
Test the boundary cases: positive, negative, zero, and fractions between 0 and 1. A statement that works for positive integers may fail for fractions or negatives.
Example. Is ?
(1)
(2)
Statement (1) allows and , so it is not sufficient. Statement (2) allows , so it is not sufficient. Together, and give . The answer is (C).
An integer constraint can turn an insufficient equation into a sufficient one. The equation has many real solutions, but if and are positive integers, the possibilities are limited. Test small values to see whether only one pair works.
Be careful with the exact wording. "Positive integer" excludes zero. "Nonnegative integer" includes zero. "Integer" includes negatives. The allowed set is part of the statement, and it can decide sufficiency.
Two distinct linear equations with two variables usually determine both variables, but not always. If the equations are multiples of each other, they represent the same line and do not add new information. For example, and are the same equation. Together they do not determine and .
If the question asks for a combination, two equations may be more than enough. If it asks for individual values, check whether the equations are independent.
When testing a statement, translate it into an equation and compare it with the target. If the target is a combination such as , a statement that gives is sufficient because it determines . A statement that gives is not sufficient, because it does not determine the sum.
For systems, count independent equations and check that they are not multiples of each other. Two equations can look different and still be dependent. If one is a multiple of the other, they provide only one relationship.
Use values that are easy to compute but still challenge the statement. If the statement involves a square, test a positive and a negative value. If it involves a fraction, test a value between 0 and 1. If it involves a denominator, test the value that makes the denominator zero to see whether it is excluded.
Example. Is ?
(1)
For real numbers, implies because the cube function is increasing. Statement (1) is sufficient. Testing confirms the yes case, and testing shows that it fails the statement. The answer is (A).
Algebra can confirm what testing suggests. If the statement can be manipulated into the target without extra assumptions, it is sufficient. If the manipulation requires dividing by a variable of unknown sign, the statement may not be sufficient.
| Situation | Usually sufficient? |
|---|---|
| One linear equation, target is the same combination | Yes |
| One linear equation, target is one variable | No |
| Quadratic, target is one variable | No, unless a constraint removes a root |
| Two independent linear equations | Yes for both variables |
| Two dependent linear equations | No |
| Inequality, yes/no target | Only if every allowed value gives the same answer |
Data Sufficiency algebra is about ambiguity, not calculation. Ask whether the target can take more than one value. If it can, the statement is not sufficient. If every allowed value gives the same answer, it is.
Free Data Sufficiency questions on this topic — try a few now.