An Initiative by SAARTHI IAS
Maarg Manthan · Topic 20.6

Inequality-Based Data Sufficiency Problems

Reasoning › Inequality (Direct and Coded) · Topic 20.6

Inequality-based data sufficiency problems ask a yes-or-no question about two letters and give two statements, and you must decide whether statement I alone, statement II alone, both together, either alone, or neither is enough to answer. The rule is to test each statement on its own, then combine them into a chain, and call a statement sufficient only if it fixes the answer definitely, whether yes or no.

Share:
Inequality-Based Data Sufficiency Problems - Reasoning - MaargX UPSC Maarg Manthan

Quick Answer

Inequality-based data sufficiency problems ask a yes-or-no question about two letters and give two statements, and you must decide whether statement I alone, statement II alone, both together, either alone, or neither is enough to answer. The rule is to test each statement on its own, then combine them into a chain, and call a statement sufficient only if it fixes the answer definitely, whether yes or no.

At a Glance

  • Question type Is the answer fixed by the given statements?
  • Answer options used here (a) I alone, (b) II alone, (c) both together, (d) either alone, (e) not even together
  • Sufficient Gives a definite yes or a definite no
  • Insufficient Answer could be yes in one case and no in another
  • Method Test I, test II, then combine
  • Trap Treating a definite no as insufficient

Where Does It Fit?

This is the last topic of the Inequality macro. It uses the chain rules of Direct Inequality Problems (Combining Given Relations to Draw a Conclusion) and the either-or idea of Inequality Problems Involving ‘Either-Or’ Conclusions: a statement that leaves both answers possible is insufficient. The next macro, Clocks and Calendars, begins with Calendar Problems – Finding the Day of the Week for a Given Date.

What Does Sufficient Mean in Data Sufficiency?

In short: information is sufficient when it forces one answer to the question. The answer can be a definite yes or a definite no. If both yes and no are possible, the information is insufficient.

Situation Verdict
The statements prove A > C Sufficient: answer is yes to “Is A > C?”
The statements prove A < C Sufficient: answer is no to “Is A > C?”
The statements leave A and C unrelated Insufficient
The statements prove only A ≥ C when asked “Is A > C?” Insufficient

Ask whether the data is sufficient to answer the question, using statement I, statement II or both statements together. The fourth case shows that a non-strict relation cannot settle a strict question, because equality remains possible.

How Do You Decide Which Option Is Correct?

In short: test statement I alone, then statement II alone, then both together if needed. The pattern of results fixes the option.

  1. Test I alone. Does it give a definite yes or no?
  2. Test II alone. Same question.
  3. Combine. Do this only if neither alone is enough.
  4. Pick the option. I alone: (a). II alone: (b). Only together: (c). Each alone: (d). Not even together: (e).

Pattern guide

  • I sufficient, II not: option (a).
  • II sufficient, I not: option (b).
  • Neither alone, but together yes: option (c).
  • Each alone sufficient: option (d).
  • Not sufficient even together: option (e).

The chain method behind each test is that of Direct Inequality Problems (Combining Given Relations to Draw a Conclusion).

What Are the Common Traps?

In short: mistakes come from treating “no” as insufficient, assuming relations that are not in the statements, and forgetting to combine.

  • Definite no: if the statements prove A C?” is a definite no, which is sufficient.
  • Strictness: a non-strict chain cannot prove a strict result.
  • No outside facts: use only the statements and the question.
  • Opposite arrows: two statements pointing away from a letter give no relation, as the either-or case of Inequality Problems Involving ‘Either-Or’ Conclusions shows.

Mixed forms of the same chain method are practised in Inequality Problems Requiring Combination of Direct and Coded Relations.

Solved Examples

Example 1

Question: Is P > R? I. P > Q. II. Q > R.

  1. I alone: P > Q says nothing about R. Insufficient.
  2. II alone: Q > R says nothing about P. Insufficient.
  3. Together: P > Q > R, so P > R. Sufficient.

Answer: Option (c): both together are needed

Example 2

Question: Is X > Y? I. X > Z > Y. II. Z > Y.

  1. I alone: X > Z > Y gives X > Y. Sufficient.
  2. II alone: Z > Y says nothing about X. Insufficient.

Answer: Option (a): I alone is sufficient

Example 3

Question: Is A = B? I. A ≥ B. II. A ≤ B.

  1. I alone allows A > B or A = B. Insufficient.
  2. II alone allows A < B or A = B. Insufficient.
  3. Together A ≥ B and A ≤ B give A = B. Sufficient.

Answer: Option (c): both together

Example 4

Question: Is A > C? I. A > B ≥ C. II. A ≥ D > C.

  1. I alone: A > B ≥ C gives A > C. Sufficient.
  2. II alone: A ≥ D > C gives A > C. Sufficient.

Answer: Option (d): either statement alone is sufficient

Example 5

Question: Is A > C? I. A > B. II. C > B.

  1. I alone: A > B says nothing about C. Insufficient.
  2. II alone: C > B says nothing about A. Insufficient.
  3. Together: A > B < C has opposite arrows, so A and C are not related. Still insufficient.

Answer: Option (e): not sufficient even together

Example 6

Question: Is X > Z? I. X < Y. II. Y ≤ Z.

  1. Neither statement alone relates X to Z.
  2. Together: X < Y ≤ Z gives X Z is false.
  3. A definite no is a definite answer.

Answer: Option (c): both together give a definite no

Shortcuts and Tricks

  • A definite no counts as sufficient.
  • Test I and II separately before combining.
  • Look at the arrows: opposite arrows from a common letter give no relation.
  • A strict question needs a strict link somewhere in the proof.
  • Do not use facts from outside the two statements.

Common Mistakes

  • Calling a definite no insufficient.
  • Combining the statements before testing them separately.
  • Assuming A and C are related when the chain has opposite arrows.
  • Letting a non-strict chain answer a strict question.
  • Using real-world values for the letters.

Practice Questions

  1. Is A > C? I. A > B. II. B > C.
  2. Is P < R? I. P S.
  3. Is X = Y? I. X ≥ Y. II. Y ≥ X.
  4. Is A > D? I. A > B > D. II. A > C > D.
  5. Is M > N? I. M > P. II. N > P.
  6. Is T < V? I. T V.

Answers: 1) (c) both together; 2) (a) I alone; 3) (c) both together; 4) (d) either alone; 5) (e) not even together; 6) (e) not even together.

Why Is This Topic Important?

  • Exam use Data sufficiency features in bank mains and aptitude tests.
  • Logic Teaches what a set of facts does and does not prove.
  • Precision Builds care about strict and non-strict relations.
  • Link to other topics Extends Direct Inequality Problems (Combining Given Relations to Draw a Conclusion) and Inequality Problems Involving ‘Either-Or’ Conclusions.

What Comes Next?

The next macro is Clocks and Calendars, beginning with Calendar Problems – Finding the Day of the Week for a Given Date. It moves from relations to dates and times.

Key Terms and Formulas

  • Sufficient Fixes the answer to a definite yes or no
  • Insufficient Leaves both answers possible
  • Statement I The first piece of given information
  • Statement II The second piece of given information
  • Combined Both statements used together
  • Definite no A proved denial, which is sufficient

Study this topic together with these linked topics from other subjects.

Exam Corner

Points to Remember

  • Sufficient means one definite answer, yes or no.
  • Test I, test II, then combine.
  • A definite no is sufficient.
  • Opposite arrows give no relation.
  • A strict question needs strict proof.

Do Not Confuse With

  • Sufficient vs true Sufficient means decided, not that the answer is yes.
  • Either alone vs both together Either alone means each works without the other.
  • Insufficient vs false Insufficient means undecided; false would be a definite no.
  • Statement vs question The question is what is asked; statements are the facts.

Memory Hook

Test each alone, then together, and remember a definite no is also an answer.

GS Relevance

Appears in IBPS PO mains, SBI PO, CSAT-style logical reasoning and management aptitude papers as a test of knowing exactly what the given information proves.

Frequently Asked Questions

What is data sufficiency in inequality reasoning?

Data sufficiency in inequality gives a yes-or-no question about two letters and two statements, and asks whether statement I alone, II alone, both together, either alone or neither is enough. A statement is sufficient only if it fixes the answer definitely.

How do you solve inequality data sufficiency questions?

Test statement I alone to see if it proves a definite yes or no, then test statement II alone, and then combine them into a chain if neither is enough. The pattern of results tells you which option applies: I alone, II alone, both, either or neither.

Is a definite no sufficient in data sufficiency?

Yes. If the statements prove that the relation asked about is false, the question is answered with a definite no, and the data is sufficient. Only when the answer could be yes in one case and no in another is the data insufficient.

Why can a non-strict chain not answer a strict question?

If the statements prove only that A is at least C, then A may be equal to C or greater than C. A question asking whether A is greater than C is then undecided, so the data is insufficient. A strict link is needed to answer a strict question.

What does not sufficient even together mean?

It means that combining both statements still leaves the relation between the two letters unproved, usually because the arrows point in opposite directions from a common letter. For example, A greater than B and C greater than B do not settle whether A is greater than C.

PYQ Practice — Statement Analysis

1 A definite no to the question counts as sufficient data.
True

The answer is fixed.

2 A > B and C > B together prove A > C.
False

The arrows point away from B, so A and C are unrelated.

3 A ≥ B alone answers the question "Is A > B?".
False

Equality remains possible.

4 X < Y and Y ≤ Z together prove X > Z is false.
True

They give X < Z.

Share: