Study guide

3.3 Coded and Direct Inequalities

SBI Clerk Junior Associate

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, Eligibility, Selection & Winning Strategy

1.1 SBI Clerk Overview, Eligibility & Two-Stage Selection 1.2 Exam Pattern, Sectional Timing & Negative Marking Mechanics 1.3 Time Allocation, Question Selection & Cutoff Strategy 1.4 Final Selection, Local Language Proficiency Test & Joining Formalities

2 Chapter 2: Reasoning — Coding, Series, Relations & Input-Output

2.1 Alphanumeric, Symbol & Number Sequences 2.2 Coding-Decoding Techniques 2.3 Blood Relations 2.4 Input-Output (Machine Input) Arrangements

3 Chapter 3: Reasoning — Direction, Ranking, Inequalities & Miscellaneous

3.1 Direction Sense & Distance 3.2 Order, Ranking & Comparison Tests 3.3 Coded and Direct Inequalities 3.4 Alphabet Test, Word Formation, Calendar & Clock

4 Chapter 4: Reasoning — Syllogisms, Critical Deduction & Data Sufficiency

4.1 Standard Syllogisms & Venn Diagram Foundations 4.2 Advanced Syllogism Cases: Only a Few & Possibility Models 4.3 Critical Reasoning for Mains Examination 4.4 Reasoning Data Sufficiency

5 Chapter 5: Reasoning — Seating Arrangements

5.1 Linear Seating Arrangements 5.2 Parallel Row Seating Arrangements 5.3 Circular & Square/Rectangular Seating Arrangements

6 Chapter 6: Reasoning — Puzzles & Complex Enigmas

6.1 Floor and Flat-Based Puzzles 6.2 Box-Based Puzzles & Vertical Stacks 6.3 Scheduling, Month-Date & Multi-Variable Matrix Puzzles

7 Chapter 7: Quantitative Aptitude: Speed Math & Number Foundations

7.1 Speed Math, Vedic Shortcuts & BODMAS Simplification 7.2 Approximation Strategies for High-Speed Calculations 7.3 Missing and Wrong Number Series

8 Chapter 8: Quantitative Aptitude: Equations & Percentage Mathematics

8.1 Quadratic Equations & Root Comparison 8.2 Percentages, Base Conversions & Successive Changes 8.3 Profit, Loss, Marked Price, Discount & Dishonest Seller Traps

9 Chapter 9: Quantitative Aptitude: Interest, Ratio & Partnership

9.1 Simple & Compound Interest Mechanics 9.2 Ratio, Proportion & Variation Techniques 9.3 Partnership Mathematics

10 Chapter 10: Quantitative Aptitude: Averages, Mixtures & Time-Work

10.1 Averages, Weighted Averages & Age Problems 10.2 Alligation Method & Solution Replacement Problems 10.3 Time & Work, Efficiency Ratios & Pipes and Cisterns

11 Chapter 11: Quantitative Aptitude: Speed, Motion & Applied Mathematics

11.1 Speed, Time & Distance Principles 11.2 Problems on Trains, Platforms, and Boats & Streams 11.3 2D/3D Mensuration & Banking Permutation, Combination, Probability

12 Chapter 12: Quantitative Aptitude: Data Interpretation & Sufficiency

12.1 Tabular, Bar & Line Graph Data Interpretation 12.2 Pie Charts & Paragraph-Based Caselet DI 12.3 Advanced Mains DI & Quantitative Data Sufficiency

13 Chapter 13: English Language: Grammar & Usage

13.1 Core Grammar Rules for Banking Exams 13.2 Tenses, Prepositional Usages & Conditional Clauses 13.3 Error Spotting & Sentence Correction Strategies

14 Chapter 14: English Language: Comprehension, Vocabulary, Idioms & Discourse

14.1 Phrase Replacement, Single/Double Fillers & Sentence Improvement 14.2 Reading Comprehension Mastery 14.3 Cloze Tests, Para Jumbles & Discourse Connectors 14.4 Vocabulary: Synonyms, Antonyms, One-Word Substitution & Word Usage 14.5 Idioms, Phrasal Verbs, Spelling & Odd Sentence Out

15 Chapter 15: General & Financial Awareness: Banking System, RBI & Capital Regulation

15.1 Structure of the Indian Banking System 15.2 Reserve Bank of India & Monetary Policy Framework 15.3 Banking Operations, Negotiable Instruments & KYC/AML 15.4 Basel III Capital Framework, Prompt Corrective Action & D-SIBs

16 Chapter 16: General & Financial Awareness: Digital Banking & Financial Inclusion

16.1 Payment Systems, NPCI & Digital Banking 16.2 Priority Sector Lending & Financial Inclusion Initiatives 16.3 Non-Performing Assets & Debt Recovery Mechanisms

17 Chapter 17: General & Financial Awareness: Financial Markets, Economy, Schemes & Current Affairs

17.1 Money Market & Capital Market Instruments 17.2 Flagship Government Social Security Schemes & Union Budget 17.3 Static Banking GK, Financial Regulators & Current Affairs Mastery 17.4 Indian Economy Essentials: National Income, Inflation, Fiscal Indicators, GST & External Sector

18 Chapter 18: Computer Aptitude

18.1 Computer Fundamentals: Hardware Architecture, Memory & OS 18.2 Networking Protocols, Cybersecurity & Microsoft Office 18.3 Number Systems, Logic Gates, Flowcharts & Computer Basics

3.3 Coded and Direct Inequalities

Key Takeaways Explain This Topic AI

Relational inequality operators follow a strict three-tier hierarchy: Priority 1 (Definite: >, <) overrules Priority 2 (Semi-definite: ≥, ≤), which overrules Priority 3 (Equivalence: =).

A conclusion A > B holds true if and only if all connecting operators face in the same direction with at least one Priority 1 operator present; if only Priority 2 and 3 operators exist, the conclusion resolves to A ≥ B.

The presence of opposing operators (e.g., A > B < C or X ≤ Y ≥ Z) blocks the path, rendering any definite direct deduction between the terminal variables logically unprovable.

The Either-Or condition requires both conclusions to share identical variables, both to be individually unverifiable, and together form an exhaustive complementary set (either two-sign A > B vs A = B under A ≥ B, or three-sign >, <, = under a blocked path).

Coded inequalities in SBI Clerk Mains encode relational operators into arbitrary symbols (@, #, $, %, ©) that are resolved using the Magic Box coordinate matrix before chain evaluation.

Last updated: September 2026

3.3 Coded and Direct Inequalities

Mathematical Inequalities represent one of the highest return-on-investment topics in the SBI Clerk examination. In Prelims, a set of 5 direct inequality questions can be solved accurately in under 90 to 120 seconds using visual priority inspection. In Mains, the topic resurfaces as coded inequalities , where mathematical operators are disguised behind arbitrary symbols and combined with conditional constraints.

Fundamental Operators & The Priority Hierarchy

Every inequality statement evaluates comparative relationships across mathematical variables using five foundational symbols:

  • Strict / Definite Greater Than ( > > > )
  • Strict / Definite Less Than ( < < < )
  • Semi-Definite Greater Than or Equal To ( ≥ \ge ≥ )
  • Semi-Definite Less Than or Equal To ( ≤ \le ≤ )
  • Equivalence / Equal To ( = = = )
  • The Three Tiers of Relational Operators

To determine which conclusion holds true across a connected path of variables, operators are ranked into a strict three-tier hierarchy:

Priority 1 (Definite / King Operators) : Strict inequality symbols: > > > and < < < .

Priority 2 (Semi-Definite / Soldier Operators) : Conditional inequality symbols: ≥ \ge ≥ and ≤ \le ≤ .

Priority 3 (Equivalence / Citizen Operator) : Equality symbol: = = = .

The Priority Operator Table

Operator Tier Symbol Logical Meaning Precedence Rule

Tier 1 (Priority 1) > > > or < < < Strictly greater than; Strictly less than Overrules Tier 2 and Tier 3 operators

Tier 2 (Priority 2) ≥ \ge ≥ or ≤ \le ≤ Greater than or equal to; Less than or equal to Overrules Tier 3; overridden by Tier 1

  • Tier 3 (Priority 3) = = = Equal to Overridden by both Tier 1 and Tier 2
  • Golden Rules of Path Evaluation

For a conclusion between variable X X X and variable Y Y Y to be definitely true:

Unidirectional Flow : All operators along the path connecting X X X to Y Y Y must face the same direction (all facing right, or all facing left).

Priority Resolution :

If at least one Priority 1 operator ( > > > or < < < ) appears in the uninterrupted unidirectional path, the resultant conclusion must be Priority 1 ( X > Y X > Y X > Y or X < Y X < Y X < Y ).

If the path contains only Priority 2 and Priority 3 operators (e.g., ≥ \ge ≥ and = = = ), the resultant conclusion must be Priority 2 ( X ≥ Y X \ge Y X ≥ Y or X ≤ Y X \le Y X ≤ Y ).

If the path consists exclusively of Priority 3 operators ( = = = ), the resultant conclusion is Priority 3 ( X = Y X = Y X = Y ).

Loading diagram... Inequality Priority Hierarchy and Path Decision Engine

Statement Combining & Multi-Statement Linking

SBI Clerk questions rarely provide a single unbroken chain. Instead, 2 to 4 fragmented statements are given, separated by semicolons. Candidates must synthesize these fragments by identifying common bridging variables.

Rules for Variable Inversion

When reversing the reading direction of a relational statement to link variables, the operator must be inverted:

  • A <= B <=> B >= A
  • A < B <=> B > A
  • A >= B <=> B <= A
  • A > B <=> B < A
  • A = B <=> B = A
  • Step-by-Step Statement Linking Strategy

Identify the Target Boundary Variables : Look at the conclusion (e.g., Is P > U?).

Locate Common Bridge Elements : Find intermediate variables present in both statements containing P and U.

Re-orient Fragments Without Reversing Logic : Invert operators if reading backwards.

Inspect for Blocking Signs : Check whether any opposing operators clash along the synthesized route.

Worked Example: Synthesizing Disparate Credit Underwriting Chains

Given Statements :

  • P > Q >= R
  • S < T <= Q
  • R >= U = V

Evaluate Conclusions :

  • Conclusion I : P > U
  • Conclusion II : T <= P
  • Conclusion III : S < R

Step-by-Step Evaluation :

Evaluating Conclusion I (P > U) : Trace from P to U through bridge Q and bridge R: P > Q >= R >= U. All signs point in the same direction (>= and >), and strict operator > (Priority 1) is present between P and Q. Thus, Conclusion I (P > U) definitely follows .

Evaluating Conclusion II (T <= P) : Trace from P to T through bridge Q: From Statement 2, T <= Q => Q >= T. From Statement 1, P > Q. Linking yields P > Q >= T, which proves P > T (Priority 1 overrules Priority 2). Because P is strictly greater than T, T cannot be equal to P. Thus, Conclusion II (T <= P) is FALSE .

Evaluating Conclusion III (S < R) : Trace from S to R through bridge Q: S < T <= Q >= R. Observe the signs between S and R: < and >=. These operators face in opposite directions . The path is blocked. No definite relationship can be established between S and R. Thus, Conclusion III is FALSE (cannot be determined).

The Blocking Condition (Opposing Operators)

Whenever a traversal encounters opposing directional signs (e.g., > ... < or < ... > or >= ... <=), the chain is broken:

A > B < C or A <= B >= C

Under a blocking condition, no direct definite conclusion between A and C can ever be valid. All three fundamental outcomes are simultaneously possible:

  • A > C
  • A < C
  • A = C

Caution

A widespread exam fallacy is assuming that A > B and C > B implies A = C or A > C. Both A and C are simply larger than B; whether A is 100 and C is 10, or A is 10 and C is 100, or both are 50 is completely unknown.

The "Either-Or" Case: Complete Rules & Verification

In SBI Clerk exams, the option "Either Conclusion I or Conclusion II follows" is a high-frequency trap. An Either-Or relationship indicates that while neither conclusion can be proven independently, the two conclusions form a logically exhaustive complementary pair such that exactly one of them must be true.

The Mandatory 3-Point Either-Or Checklist

All three conditions must be satisfied simultaneously:

Identical Elements : Both conclusions must feature the exact same subject and predicate variables (or variables proven strictly equal via an equivalence relation, e.g., X = Y).

Individually False / Indeterminate : Both individual conclusions must be independently unprovable from the given statements.

Exhaustive Complementary Coverage : The combination of relational operators in the two conclusions must cover all possible mathematical states between the variables.

Case A: The Two-Sign Complementary Pair (Semi-Definite Chain)

Occurs when the path between A and B is unbroken and unidirectional , resolving to a Priority 2 semi-definite relation (>= or <=):

  • Derived Statement : A >= B
  • Conclusion I: A > B
  • Conclusion II: A = B

Analysis : Neither is certain on its own, but together they completely cover >=. Hence, Either I or II follows .

  • Derived Statement : A <= B
  • Conclusion I: A < B
  • Conclusion II: A = B

Analysis : Both are uncertain alone, but together they cover <=. Hence, Either I or II follows .

Case B: The Three-Sign Complementary Set (Blocked / Indeterminate Path)

Occurs when the path between A and B is blocked by opposing operators (A > X < B). Here, because no relation exists, all three mathematical possibilities (>, <, =) must be covered by the two conclusions:

Valid Pair 1 : Conclusion I: A > B; Conclusion II: A <= B (covers < and =).

Valid Pair 2 : Conclusion I: A < B; Conclusion II: A >= B (covers > and =).

Valid Pair 3 : Conclusion I: A = B; Conclusion II: A != B (where A != B splits into A > B or A < B).

Warning

If the chain between A and B is blocked by opposing signs, conclusions A > B and A = B do NOT form an Either-Or pair! They only cover 2 of the 3 required states (leaving out A < B). In that scenario, the correct answer is Neither I nor II follows .

Coded Inequalities (SBI Clerk Mains Pattern)

In SBI Clerk Mains, direct relational operators are replaced by code keys that must be systematically translated before chain evaluation.

The Magic Box Decoding Technique

The Magic Box is a 2x2 coordinate grid with an equality center that organizes symbols by hierarchy:

  • Top-Left : Greater Than (>) | Top-Right : Greater Than or Equal To (>=)
  • Center : Equal To (=)
  • Bottom-Left : Less Than (<) | Bottom-Right : Less Than or Equal To (<=)
  • Coded Inequality Translation Matrix
  • Coded Statement Stated Meaning Translated Mathematical Operator Magic Box Position
  • P @ Q P is neither smaller than nor equal to Q > Top-Left (Definite)
  • P $ Q P is not smaller than Q >= Top-Right (Semi-Definite)
  • P # Q P is neither greater than nor smaller than Q = Center (Equivalence)
  • P % Q P is neither greater than nor equal to Q < Bottom-Left (Definite)
  • P & Q P is not greater than Q <= Bottom-Right (Semi-Definite)
  • Worked Example: Comprehensive Coded Evaluation
  • Statements : M $ N, N @ O, O # P, P $ Q
  • Translate to Direct Form: M >= N > O = P >= Q

Conclusions to Evaluate :

Conclusion I : M @ P => M > P. Tracing from M to P: M >= N > O = P. Because strict operator > (Tier 1) is present, M > P is DEFINITELY TRUE .

Conclusion II : N % Q => N < Q. Tracing from N to Q: N > O = P >= Q => N > Q. The conclusion asserts N < Q, which directly contradicts N > Q. Thus, Conclusion II is FALSE .

Final Answer : Only Conclusion I follows.