UPSC Prelims 2026 CSAT Q5 · Data Sufficiency
If x, y and z are integers, each greater than 1, then is x a prime number?
I. xy² = 116
II. xz = 261
- aQuestion answerable using one statement alone, but not the other
- bQuestion answerable using either statement alone
- cQuestion answerable using both together, but not either alone
- dQuestion not answerable even using both statements
Show answer & explanationHide answer
Statement I alone fixes x = 29, which is prime, but Statement II alone allows x = 3, 9, 29 or 87, so only one statement is sufficient.
Statement-by-statement analysis
- Statement I: 116 = 2² × 29, and its divisors are 1, 2, 4, 29, 58 and 116. Since y > 1, y² must be a perfect-square divisor of 116 greater than 1, and the only one is 4. So y = 2 and x = 116 ÷ 4 = 29.
- 29 is prime, so Statement I gives a definite YES and is sufficient on its own.
- Statement II: 261 = 3² × 29, so (x, z) can be (3, 87), (9, 29), (29, 9) or (87, 3). x = 3 or 29 is prime, but x = 9 or 87 (87 = 3 × 29) is composite, so Statement II is insufficient. Exactly one statement works, which makes (a) correct.
- For (b) to be right, Statement II would also have to settle the question by itself.
- With x = 9, z = 29 the answer is NO, while with x = 29, z = 9 the answer is YES. Statement II gives conflicting answers, so (b) fails.
- Option (c) needs both statements together and neither alone, but Statement I is already sufficient by itself.
- Combining them only confirms x = 29, because 29 divides both 116 and 261. That is not needed, so (c) is wrong.
- Option (d) claims the data is insufficient even when combined.
- Statement I alone gives the unique value x = 29, so the question is clearly answerable and (d) is ruled out.
Concept to know
- In Data Sufficiency, a statement is sufficient only if it leads to one definite answer: a single value, or a consistent YES or NO for a yes/no question.
- For product equations with integers, write the number as a product of prime factors first. Here 116 = 2² × 29 and 261 = 3² × 29.
- When a variable appears squared (y²), only perfect-square divisors of the number are possible. List the divisors and keep only the squares that meet the given constraint (here y > 1).
- For yes/no questions, test the extreme or contrasting cases. One YES case and one NO case together prove a statement insufficient.
- Constraints such as 'each greater than 1' or 'integers' cut down the possible cases a lot, so apply them before concluding.
- Use the standard order: test Statement I alone, then Statement II alone, and combine them only if neither works alone.
Related facts for revision
- Variants ask 'Is x even?', 'Is x a perfect square?' or 'Is x divisible by 3?' using product equations. The method is the same: factorise and list the allowed cases.
- If the constraint were 'y ≥ 1' instead of 'y > 1', Statement I would also allow y = 1, x = 116 (not prime). The answer would then change, so always read the constraints carefully.
- Shortcut: a prime p appearing to the first power (like 29 here) cannot sit inside a square, so it must belong to the unsquared variable.
- In some DS questions the question asks for a value rather than yes/no. A statement giving two values is insufficient there, even if both values share some property.
- UPSC CSAT uses a four-option DS format (one alone, either alone, both together, neither). Memorise what each option means so you do not mix up (a) and (b).
Prime factorisation, divisibility with integer constraints, and the logic of deciding whether a statement is sufficient in a yes/no Data Sufficiency question.
Trap: Candidates often see 29 in the factorisation of 261 and assume x = 29, then choose (b). Others ignore the y > 1 condition and pick (c) or (d). To save time, factorise both numbers at once. A squared variable with a single perfect-square factor (4) gives a unique answer, while a two-variable linear product with several factors almost never does.
More Data Sufficiency PYQs
All Data Sufficiency questions →
Answer from the official UPSC answer key. Explanation by the EdiShorts editorial team.