Study guide

5.2 Coded & Mathematical Inequalities

SBI PO Probationary Officer

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & SBI PO Exam Architecture

1.1 SBI PO Exam Structure, Phases & Sectional Timing 1.2 Eligibility, Age Relaxation & Number of Attempts 1.3 Mark Calculation, One-Fourth Negative Marking & Cut-offs 1.4 Descriptive Communication Test (Email, Situation, Report/Précis) 1.5 Phase 3: Psychometric Test, Group Exercise & Interview Preparation 1.6 Recommended Study Plan & Mock Test Strategy

2 Chapter 2: Quantitative Aptitude — Foundation & Speed Math

2.1 Vedic Math, Fast Calculation & Approximation Techniques 2.2 Number Series (Missing & Wrong Number Patterns) 2.3 Quadratic Equations & Quantity Comparisons (Q1 vs Q2) 2.4 Simplification & Order of Operations 2.5 Data Sufficiency in Quantitative Aptitude

3 Chapter 3: Arithmetic & Applied Problem Solving

3.1 Percentages, Profit, Loss & Discount Calculations 3.2 Simple Interest & Compound Interest (Compounding Cycles & Differences) 3.3 Ratio & Proportion, Partnerships & Ages 3.4 Averages, Mixtures & Alligations 3.5 Time, Work, Efficiency & Pipes & Cisterns 3.6 Speed, Distance, Time, Trains & Boats/Streams 3.7 Permutation, Combination & Probability in Banking Exams

4 Chapter 4: Advanced Data Analysis & Data Interpretation (DI)

4.1 Table & Line Graph Data Interpretation 4.2 Bar Chart & Pie Chart Data Interpretation 4.3 Caselet Data Interpretation (Paragraph-based DI & Venn Caselets) 4.4 Missing Data DI & Radar/Spider Graph Interpretation 4.5 Arithmetic-based DI (Profit-Loss, Time-Work, TSD) & Funnel/Scatter DI

5 Chapter 5: Analytical Reasoning

5.1 Syllogisms (Only a few, Some not & Reverse Syllogism) 5.2 Coded & Mathematical Inequalities 5.3 Coding-Decoding (Coded Statements & Mains Patterns) 5.4 Blood Relations & Direction Sense 5.5 Input-Output Machine Rearrangement

6 Chapter 6: Puzzles & Seating Arrangement

6.1 Linear & Circular Seating Arrangement (Single/Parallel Rows & Variable Binding) 6.2 Floor & Box Puzzles (Multi-story, Vacant floor & Stacking Order) 6.3 Matrix & Category Puzzles (Department/Profession Allocation & Constraint Elimination) 6.4 Scheduling Puzzles (Day-Month-Year combinations & Time Slots)

7 Chapter 7: Critical Reasoning

7.1 Statement & Implicit Assumptions 7.2 Statement & Conclusions vs Strong/Weak Arguments 7.3 Statement & Course of Action 7.4 Cause & Effect Analysis 7.5 Critical Reasoning Passages (Strengthen/Weaken & Paradox Resolution)

8 Chapter 8: English Language

8.1 Reading Comprehension: Tone, Inference, Main Idea & Vocab in Context 8.2 Cloze Test & Double/Triple Fillers 8.3 Para Jumbles & Sentence Rearrangement 8.4 Error Spotting & Phrase Replacement (Grammar Rules) 8.5 Word Usage, Synonyms/Antonyms & Contextual Meaning 8.6 Match the Columns & Sentence Connectors/Starters

9 Chapter 9: Banking & Financial Awareness

9.1 Reserve Bank of India (RBI): History, Structure & Functions 9.2 Monetary Policy Framework: MPC, Repo Rate, SDF, MSF, CRR, SLR & Inflation Targeting 9.3 Indian Financial System: Commercial Banks, Small Finance Banks, Payment Banks & NBFCs 9.4 Financial Inclusion & Government Banking Schemes (PMJDY, PMSBY, PMJJBY, APY, MUDRA, KCC) 9.5 Banking Current Affairs & Financial News Dynamics

10 Chapter 10: General & Banking Awareness — Indian Economy, Financial Markets & Regulations

10.1 Economic Indicators: GDP, NNP, WPI, CPI, IIP & National Income 10.2 Forex & International Trade: Balance of Payments, LRS, NEER/REER & World Bank/IMF 10.3 Union Budget & Economic Survey: Fiscal Deficit, CapEx & Revenue Receipts 10.4 Money Market vs Capital Market: T-Bills, Commercial Paper, CD, Stocks, Bonds & SEBI 10.5 Priority Sector Lending (PSL), Non-Performing Assets (NPAs), SARFAESI, IBC & Basel III

11 Chapter 11: Computer Aptitude

11.1 Computer Fundamentals & Hardware Architecture 11.2 Operating Systems & System Software 11.3 Networking Concepts & Internet Protocols 11.4 Cybersecurity & Banking IT Security 11.5 Database Management Systems (DBMS) & MS Office Suite

5.2 Coded & Mathematical Inequalities

Key Takeaways Explain This Topic AI

Inequality evaluation strictly follows a three-tier priority hierarchy: Priority 1 (> or <) overrides Priority 2 (>= or <=), which overrides Priority 3 (=).

An inequality chain breaks completely whenever opposite-facing operators (e.g., > and <, or >= and <=) appear between two variables.

Coded inequalities can be solved rapidly by constructing a 3x3 symbol decoding box mapping problem code symbols to standard operators.

Either-Or in inequalities occurs under two distinct scenarios: Definite Equal Split (A >= B yields A > B or A = B) and Broken Chain Full Coverage (opposite signs yield A > B or A <= B).

Mains-level blank-filling inequalities require verifying that candidate operator sequences maintain strict priority conditions across all target variables.

Last updated: July 2026

Coded & Mathematical Inequalities

Mathematical Inequalities and Coded Inequalities form one of the highest-yield scoring topics in the SBI PO examination. In Prelims, candidates routinely encounter 5 direct or coded inequality questions that must be solved in under 2 minutes. In Mains, inequalities appear as conditional statements, blank-filling expressions, or reverse inequalities. Success depends on mastering the operator priority hierarchy and using a symbol priority box to avoid rewriting full expressions.

Operator Priority Hierarchy

Mathematical inequalities are governed by five basic symbols: Greater than ( > > > ), Less than ( < < < ), Greater than or equal to ( ≥ \ge ≥ ), Less than or equal to ( ≤ \le ≤ ), and Equal to ( = = = ). These symbols are categorized into three distinct priority levels:

Priority Level Left-Facing Operators Right-Facing Operators Priority Description

Priority 1 (Strict) > > > (Greater Than) < < < (Less Than) Highest priority. If present anywhere in a unbroken chain, the final relation must be Priority 1.

Priority 2 (Slack) ≥ \ge ≥ (Greater than or Equal) ≤ \le ≤ (Less than or Equal) Medium priority. Valid only if ALL operators in the unbroken chain are Priority 2 or Priority 3.

Priority 3 (Neutral) = = = (Equal To) = = = (Equal To) Lowest priority. Acts as a transparent bridge; does not change the priority of surrounding operators.

Chain Continuity Rule

For a conclusion between two variables X X X and Y Y Y to be valid, all operators along the path from X X X to Y Y Y must point in the same direction (either all left-facing > , ≥ , = > , \ge, = > , ≥ , = or all right-facing < , ≤ , = <, \le, = < , ≤ , = ).

Unbroken Chain Example: A ≥ B = C > D ≥ E ⟹ A > E A \ge B = C > D \ge E \implies A > E A ≥ B = C > D ≥ E ⟹ A > E (Valid, Priority 1 operator > > > dictates the relationship).

Broken Chain Example: A ≥ B > C ≤ D = E ⟹ A \ge B > C \le D = E \implies A ≥ B > C ≤ D = E ⟹ Relation between A A A and D D D is Undetermined due to opposite operators ( > > > and ≤ \le ≤ ).

The Symbol Priority Box Technique

In Coded Inequalities, standard operators are replaced by arbitrary symbols (e.g., @ , # , $ , % , & @, \#, \text{\textdollar}, \%, \& @ , # , $ , % , & ). Rather than wasting time converting every symbol in every option back into standard math notation, construct a Symbol Priority Box . [ Top Left: > ] --- (Priority 1) --- [ Top Right: < ]

  • |
  • [ Mid Left: >= ] --- (Priority 2) --- [ Mid Right: <= ]
  • |
  • [ Center: = ] (Priority 3)
  • Constructing the Box from Statements

Suppose the question gives the following code key:

' P @ Q P @ Q P @ Q ' means ' P P P is not smaller than Q Q Q ' ⟹ P ≥ Q \implies P \ge Q ⟹ P ≥ Q (Mid Left)

' P # Q P \# Q P # Q ' means ' P P P is neither smaller than nor equal to Q Q Q ' ⟹ P > Q \implies P > Q ⟹ P > Q (Top Left)

' P $ Q P \text{\textdollar} Q P $ Q ' means ' P P P is neither greater than nor smaller than Q Q Q ' ⟹ P = Q \implies P = Q ⟹ P = Q (Center)

' P % Q P \% Q P % Q ' means ' P P P is not greater than Q Q Q ' ⟹ P ≤ Q \implies P \le Q ⟹ P ≤ Q (Mid Right)

' P & Q P \& Q P & Q ' means ' P P P is neither greater than nor equal to Q Q Q ' ⟹ P < Q \implies P < Q ⟹ P < Q (Top Right)

Rules for Box Navigation

Forward Movement (Left to Right): If reading variables in original left-to-right order (e.g., A → B → C A \to B \to C A → B → C ), retain the operator's exact position in the box.

Backward Movement (Right to Left): If reading variables backwards (e.g., C → B → A C \to B \to A C → B → A ), flip the operator across the box diagonal (Top Left # [ > ] \# [>] # [ > ] flips to Top Right & [ < ] \& [<] & [ < ] ; Mid Left @ [ ≥ ] @ [\ge] @ [ ≥ ] flips to Mid Right % [ ≤ ] \% [\le] % [ ≤ ] ).

Combining Symbols: The resultant symbol between two variables is the highest priority symbol along the path. If symbols lie on opposite sides of the box (e.g., Top Left and Top Right), the chain is broken.

Definite vs. Either-Or Cases

An inequality conclusion pair can result in an 'Either-Or' determination under two distinct structural conditions:

Type 1: Definite Relation Split

Occurs when the combined unbroken chain yields a Priority 2 relation ( ≥ \ge ≥ or ≤ \le ≤ ), and the two conclusions split this relation into its strict components.

  • Given Chain Result: A ≥ B A \ge B A ≥ B
  • Conclusion I: A > B A > B A > B
  • Conclusion II: A = B A = B A = B

Evaluation: Since A A A must be either strictly greater than B B B OR equal to B B B , the pair forms a Type 1 Either-Or .

Type 2: Broken Chain Full Coverage (No-Relation Either-Or)

Occurs when the chain between two variables is broken (opposite operators), making all relations undetermined, BUT the two conclusions collectively cover all three possible mathematical states ( > , < , = > , <, = > , < , = ):

Given Chain Result: A A A and B B B have a broken chain ( A A A ? B B B ).

Conclusion I: A > B A > B A > B

Conclusion II: A ≤ B A \le B A ≤ B (which incorporates both < < < and = = = ).

Evaluation: Because A A A must be either greater than, smaller than, or equal to B B B , and these two statements cover all three possibilities without overlap, the pair forms a Type 2 Either-Or .

Advanced Mains Patterns: Blank-Filling Inequalities

In Mains exams, you are presented with an incomplete expression containing blanks, such as: M ___ N ___ O ___ P ___ Q M \text{ \_\_\_ } N \text{ \_\_\_ } O \text{ \_\_\_ } P \text{ \_\_\_ } Q M ___ N ___ O ___ P ___ Q

You are asked to find the sequence of operators from the options that simultaneously satisfies two target conditions, e.g., Condition 1: M > O M > O M > O is Definitely True, and Condition 2: N ≤ O N \le O N ≤ O is Definitely False.

Step-by-Step Solution Algorithm

Isolate First Condition ( M > O M > O M > O ): Examine the first two blanks between M , N , M, N, M , N , and O O O . To make M > O M > O M > O definitely true, the sequence of the first two operators must contain at least one Priority 1 left-facing operator ( > > > ) and no right-facing operators ( < , ≤ <, \le < , ≤ ). Eliminate options violating this.

Isolate Second Condition ( N ≤ Q N \le Q N ≤ Q Definitely False): Examine the remaining blanks between N , O , P , N, O, P, N , O , P , and Q Q Q . For N ≤ Q N \le Q N ≤ Q to be definitely false, either N > Q N > Q N > Q must be definitely true OR the relationship must be completely broken such that N ≤ Q N \le Q N ≤ Q cannot be proven.

Test Remaining Candidate Sequences: Plug candidate sequences into the full chain to verify both conditions.

Step-by-Step Worked Example

Decoded Symbol Key:

  • # ⟹ > \# \implies > # ⟹ >
  • @ ⟹ ≥ @ \implies \ge @ ⟹ ≥
  • $ ⟹ = \text{\textdollar} \implies = $ ⟹ =
  • % ⟹ ≤ \% \implies \le % ⟹ ≤
  • & ⟹ < \& \implies < & ⟹ <
  • Given Statements: H @ I $ J # K % L H @ I \$ J \# K \% L H @ I $ J # K % L
  • Combined Decoded Expression: H ≥ I = J > K ≤ L H \ge I = J > K \le L H ≥ I = J > K ≤ L

Conclusions to Evaluate:

  • Conclusion I: H # J H \# J H # J ( H > J H > J H > J )
  • Conclusion II: H $ J H \text{\textdollar} J H $ J ( H = J H = J H = J )
  • Conclusion III: I # K I \# K I # K ( I > K I > K I > K )
  • Conclusion IV: H # L H \# L H # L ( H > L H > L H > L )
  • Step-by-Step Evaluation

Evaluate H H H vs J J J : The path from H H H to J J J is H ≥ I = J H \ge I = J H ≥ I = J . Combining ≥ \ge ≥ and = = = yields H ≥ J H \ge J H ≥ J . This is Priority 2. Conclusion I ( H > J H > J H > J ) and Conclusion II ( H = J H = J H = J ) split this Priority 2 relation. Therefore, Conclusion I or II follows (Type 1 Either-Or) .

Evaluate I I I vs K K K : The path from I I I to K K K is I = J > K I = J > K I = J > K . Combining = = = and > > > yields I > K I > K I > K (Priority 1). Conclusion III states I # K I \# K I # K ( I > K I > K I > K ). Therefore, Conclusion III is Definitely True .

Evaluate H H H vs L L L : The path from H H H to L L L is H ≥ I = J > K ≤ L H \ge I = J > K \le L H ≥ I = J > K ≤ L . The chain breaks between J J J and L L L due to > > > and ≤ \le ≤ . Conclusion IV ( H > L H > L H > L ) cannot be determined. Therefore, Conclusion IV is False .

Final Result: Either Conclusion I or II follows, and Conclusion III follows definitely.