Module 1 · IBPS PO Reasoning Ability

Inequalities

Updated 17 Nov 2026 · 4,305 words · illustrated
Updated 21 Nov 2026
Coded inequalities, direct inequalities, chain inequalities.
Direct Inequalities · Coded Inequalities · Chain Inequalities
🎯 Take Mock Test
CORE (Maharashtra,Gujarat, TamilNadu, Karnataka)SEMI-PERIPHERY(Punjab, Haryana,Kerala, Telangana)PERIPHERY (Bihar,UP, Odisha,Jharkhand, Chhattisgarh)High GSDP percapitaDiversified economyBetterinfrastructureLow GSDP per capitaPrimary sectordependenceOut-migration & lowinvestmentCapital,technology,skilled labourRaw materials,cheap labour,migrationFriedmann's Core-Periphery Model applied to Indian statesExam hook: Article 38(2) — minimise inequalities in income, status, facilities among regionsvlymbooq
Core-Periphery Model of Regional Inequality in India — Shows how economic activity concentrates in core regions creating structural disparities with periphery. · Open the full diagram →

Learning Objectives

  • Understand the fundamental concepts of Inequalities
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

What is Inequality?

Inequality questions in banking exams test your ability to compare quantities using mathematical inequality symbols and coded relationships. Given a set of statements with inequalities, you must determine which conclusions definitely follow. These are quick-scoring questions that appear regularly in prelims.

Basic Symbols

1. Greater Than (>): A > B means A is greater than B.

2. Less Than (<): A < B means A is less than B.

3. Equal To (=): A = B means A equals B.

4. Greater Than or Equal To (≥): A ≥ B means A is greater than or equal to B.

5. Less Than or Equal To (≤): A ≤ B means A is less than or equal to B.

Coded Inequalities

In banking exams, symbols are often replaced with codes (e.g., @, #, $, %, &). A key is provided showing what each symbol means. For example: P @ Q means P > Q, P # Q means P < Q, P $ Q means P = Q, P % Q means P ≥ Q, P & Q means P ≤ Q. You then use these coded relationships to evaluate conclusions.

Rules for Combining Inequalities

1. Transitive Property: If A > B and B > C, then A > C. Similarly for <, ≥, ≤.

2. Combining ≥ and >: If A ≥ B and B > C, then A > C (the ≥ gets 'absorbed' by >).

3. Combining > and ≥: If A > B and B ≥ C, then A > C.

4. Combining ≤ and <: If A ≤ B and B < C, then A < C.

5. Combining < and ≤: If A < B and B ≤ C, then A < C.

6. Non-Transitive Cases: If A > B and B < C, NO relationship between A and C can be determined. Similarly for A ≥ B and B ≤ C, or A > B and B = C and C < D, etc.

Solved Examples

Example 1 (Direct Inequality)
Statements: P > Q ≥ R < S = T ≤ U
Conclusions: I. P > R II. T < S

Options: a) Only I follows b) Only II follows c) Both follow d) Neither follows
Solution: a) Only I follows. I. P > Q ≥ R → P > R ✓ (transitive property). II. T ≤ U and S = T, so T = S. The conclusion says T < S which is false. Therefore only I follows.
Example 2 (Coded Inequality)
Key: A @ B means A > B; A # B means A < B; A $ B means A = B; A % B means A ≥ B; A & B means A ≤ B.
Statements: M @ N # P $ Q % R
Conclusions: I. M @ Q II. N & R

a) Only I follows b) Only II follows c) Both follow d) Neither follows
Solution: d) Neither follows. Convert statements: M > N < P = Q ≥ R. I. M @ Q means M > Q. From M > N and N < P = Q, M and Q cannot be compared because M > N and N < Q → M could be >, <, or = Q. II. N & R means N ≤ R. From N < P = Q ≥ R, we have N < Q ≥ R. N could be ≤ or > R. So neither conclusion follows.
Example 3 (Chain of Inequalities)
Statements: A ≥ B > C = D ≤ E < F
Conclusions: I. A > D II. C < F III. B ≤ E

a) Only I follows b) Only I and II follow c) Only II and III follow d) All follow
Solution: b) Only I and II follow. I. A ≥ B > C = D → A > D ✓. II. C = D ≤ E < F → C < F ✓. III. B > C = D ≤ E → B > D ≤ E, so B could be >, =, or < E. No definite relationship. So only I and II follow.

Shortcut Techniques

  • When combining inequalities, always chain them in one direction. Convert ≤ and ≥ to consistent direction before combining.
  • If two variables have opposite inequality signs between them (e.g., A > B < C), no relationship can be determined.
  • For coded inequalities, first convert all coded statements into symbols using the key, then evaluate.
  • In 'either-or' cases, check if the two conclusions cover all possibilities for the relationship.
Pro Tip
In prelims, 3-5 inequality questions appear. They are among the fastest to solve — each can be done in 15-20 seconds once you master the transitive and non-transitive rules. Always check the 'either-or' condition carefully as it is a common trap.

Advanced Problem Types

Competitive exams feature advanced variations combining multiple reasoning concepts. Master these to score high.

Multi-Step Problems

Some questions require applying multiple reasoning techniques sequentially. Break problems into clear steps.

Common Traps

  • Assuming a pattern continues without checking all elements
  • Misinterpreting negative statements in syllogisms
  • Forgetting wrapping in alphabet coding (Z to A transition)
  • Confusing directions (East vs West)
  • Overlooking either-or cases in syllogisms
  • Not considering all possible arrangements in puzzles
Pro Tip
For puzzles, start with the most concrete clue and build around it. Draw diagrams for seating arrangements and family trees for blood relations.

Transitive and Non‑Transitive Chains in Mixed Signs

When a chain contains only strict signs (> or <) or only non‑strict signs (≥ or ≤), the transitive property holds without exception: A > B > C implies A > C, and A ≥ B ≥ C implies A ≥ C. The difficulty appears when the chain mixes strict and non‑strict symbols, for example A > B ≥ C or A ≥ B > C. In the first case the overall relation between A and C is strict because the presence of a single strict link forces the whole chain to be strict: A > C. In the second case the chain is also strict: A ≥ B > C yields A > C. However, a chain such as A ≥ B ≤ C is non‑transitive; no definite relation between A and C can be deduced because the direction of the inequalities reverses. The examiner often builds statements like P ≥ Q > R ≤ S and asks whether P > S follows. The correct approach is to split the chain at the reversal point, treat each monotonic segment separately, and then check whether the two segments can be linked through a common variable. If the common variable appears with opposite senses (once as a lower bound, once as an upper bound), the conclusion is indeterminate unless an additional statement fixes the variable’s exact value.

A practical rule: write the chain in a single direction by converting every ≤ to ≥ (or vice‑versa) and reversing the order of the variables. For A ≥ B ≤ C rewrite as B ≤ A and B ≤ C. Now both statements give an upper bound for B; they do not relate A and C. This technique eliminates the visual trap of “mixed signs” and makes the transitive test mechanical. Remember that equality (=) behaves as both ≤ and ≥ simultaneously, so a chain containing A = B ≥ C can be reduced to A ≥ C (strictness depends on the other link). Mastery of this conversion is the single biggest time‑saver in high‑difficulty inequality sets.

Either‑Or and Neither‑Nor Conclusions

Examiners frequently frame two conclusions that are mutually exclusive but collectively exhaustive, for example “I. X > Y II. X ≤ Y”. Only one of them can be true for any concrete assignment, yet the logical structure of the statements may leave the relation between X and Y undetermined. In such a case the correct answer is “Either I or II follows”. The decision rule is: derive the strongest possible relation from the given statements; if that relation is a strict inequality (or a strict equality) then the corresponding conclusion follows and the opposite does not. If the strongest relation is a non‑strict inequality (≤ or ≥) then both the strict and the non‑strict versions are possible, so the either‑or pair is triggered. A third pattern is the “neither‑nor” pair where both conclusions are false under every admissible assignment; this occurs when the statements force a relation that contradicts both conclusions, e.g., statements give X > Y while conclusions are X < Y and X = Y.

To evaluate an either‑or pair quickly, construct the tightest bound for each variable using the chain‑combining rules. Then test each conclusion against that bound. If exactly one conclusion is compatible with the bound, that conclusion follows. If both are compatible (which can happen only when the bound is non‑strict), the answer is “Either I or II follows”. If none is compatible, the answer is “Neither I nor II follows”. A common pitfall is to treat “≥” as “>” when checking the strict conclusion; always keep the distinction because a single equality case can flip the answer from “Only I follows” to “Either I or II follows”.

Either‑Or Evaluation
Statements: A ≥ B > C = D ≤ E. Conclusions: I. A > D II. A ≤ D. Choose the correct option.
Combine the chain: A ≥ B > C = D gives A > D (strict because B > C). The second part D ≤ E does not affect the relation between A and D. The strongest derived relation is A > D. Conclusion I matches this strict relation, so I follows. Conclusion II (A ≤ D) contradicts the derived strict relation, therefore II does not follow. Since only one conclusion follows, the answer is “Only I follows”.
Exam‑Day Shortcut
When you see an either‑or pair, first write the combined chain in one direction. Identify the tightest bound for the two variables involved. If the bound is strict, the matching strict conclusion is the sole follower. If the bound is non‑strict, mark “Either I or II follows” without further calculation. This eliminates the need to test both conclusions separately.

Inequalities with Variables on Both Sides

Standard textbook problems place all variables on the left and constants on the right, but competitive exams often present statements such as 2X + 3 ≥ 5Y – 1 or P – Q > R + S. The presence of variables on both sides does not change the logical engine; it only requires an algebraic rearrangement before the transitive rules can be applied. The first step is to isolate each variable on a separate side of the inequality, preserving the direction of the sign. For 2X + 3 ≥ 5Y – 1, subtract 5Y and 3 from both sides to obtain 2X – 5Y ≥ –4. This is now a linear inequality in two variables. If a second statement provides another linear relation, e.g., X – Y ≤ 2, the two can be combined by eliminating one variable (multiply the second by 2 and subtract) to derive a bound on the remaining variable. The elimination method mirrors solving simultaneous equations, but the inequality sign must be tracked carefully: multiplying by a negative number reverses the sign.

When the statements are purely relational (no numeric coefficients), treat each variable as a node in a directed graph where an edge A → B means A > B (or ≥). Variables on both sides simply create edges in both directions, e.g., P – Q > R yields P > Q + R, which can be split into P > Q and P > R only if Q and R are known to be non‑negative. In the absence of sign information, the safe approach is to keep the compound inequality intact and use it as a single constraint during chain combination. The examiner’s favourite trap is to give A + B > C and C > D and then ask whether A > D follows. Without knowing the sign of B, the conclusion is indeterminate; the correct answer is “Neither follows”. Always check for hidden sign assumptions before splitting compound inequalities.

Application of Inequalities in Data Sufficiency

Data sufficiency questions embed inequality statements inside a “statement‑1 / statement‑2” framework. The task is to decide whether each statement alone, or both together, provide enough information to answer a target inequality such as “Is X > Y?”. The solving template is identical to the chain‑combination method, but the decision points are different. First, translate each statement into a set of relational edges. Then, for each statement individually, attempt to derive a definite relation between the target variables. If a single statement yields a strict or non‑strict bound that answers the question, that statement is sufficient. If not, combine the edges from both statements and test again. The crucial nuance is that a statement may be sufficient even when it does not give a direct comparison; for example, “X ≥ 5” and “Y ≤ 4” together imply X > Y, but each alone is insufficient. The examiner often includes a statement that gives a range (e.g., 3 ≤ X ≤ 7) and another that gives a point value (Y = 5). The combination may still be insufficient if the ranges overlap.

A systematic approach: draw a number line for each variable based on the information in the statements. Mark the known bounds. The question “Is X > Y?” is answered “Yes” only if the minimum possible value of X exceeds the maximum possible value of Y. It is answered “No” only if the maximum possible X is ≤ the minimum possible Y. Any overlap means the data are insufficient. This visual method eliminates algebraic errors and works equally well for coded inequalities once the code is decoded. Practice converting each statement into a pair of bounds (lower, upper) for every variable; then the sufficiency test becomes a simple interval comparison.

Complex Coded Inequalities with Multiple Symbol Sets

Advanced papers sometimes present two or three independent coding keys in the same question, for instance: “@ means >, # means <, $ means ≥” for the first set, and “% means ≤, & means =, * means ≠” for the second set. The statements then mix symbols from both sets, e.g., “A @ B # C $ D % E”. The first step is to build a master translation table that maps every symbol to its standard relation. Write the decoded chain in a single line, preserving the order of variables. Next, apply the chain‑combination rules exactly as for direct inequalities. Because the symbols are arbitrary, the examiner can hide a reversal of direction inside the code; for example, “#” might be defined as “<” in the first set but “>” in the second set. Always verify the key for each symbol before decoding; a single mis‑read symbol flips the entire chain.

When multiple keys exist, it is helpful to colour‑code or bracket the symbols belonging to each key while decoding. After translation, treat the resulting chain as a normal mixed‑sign chain. The presence of “≠” (not equal) introduces a non‑transitive element: from A ≠ B and B ≠ C no relation between A and C can be inferred. However, if a strict inequality also connects the same variables, the “≠” becomes redundant. The examiner may ask “Which of the following must be true?” and provide options that include “A ≠ C”. The correct answer is “Cannot be determined” unless a strict chain forces inequality. Practise decoding at least three different keys in a single sitting to build speed; the pattern recognition of symbol‑to‑relation mapping is the only skill that separates a 15‑second solution from a 60‑second one.

  • Assuming a mixed‑sign chain is transitive without checking for a reversal point.
  • Treating “≥” as “>” when evaluating an either‑or pair, missing the equality case.
  • Splitting a compound inequality with variables on both sides without confirming sign constraints.
  • Ignoring the interval‑overlap test in data‑sufficiency and declaring sufficiency prematurely.
  • Mis‑reading a coded symbol because two different keys are used in the same question.
  • Overlooking that “≠” provides no transitive information unless paired with a strict inequality.
  • Failing to convert all ≤ to ≥ (or vice‑versa) before chaining, leading to direction errors.

Inequalities Involving Absolute Values and Modulus

Absolute value inequalities appear frequently when a problem asks for the range of a variable that satisfies a distance condition. The definition |x| = x for x ≥ 0 and |x| = –x for x < 0 splits every absolute inequality into two linear cases. For |x| < a with a > 0 the solution is –a < x < a; for |x| > a the solution is x < –a or x > a. When the expression inside the modulus is linear, such as |2x – 3| ≤ 5, rewrite as –5 ≤ 2x – 3 ≤ 5, then isolate x to obtain –1 ≤ x ≤ 4. If the constant on the right side is negative, e.g. |x + 2| < –3, the inequality has no solution because an absolute value is never negative. Compound absolute inequalities like |x – 1| + |x + 2| ≤ 7 require a case analysis based on the critical points where each inner expression changes sign (x = 1 and x = –2). The number line is divided into intervals (–∞, –2], [–2, 1], [1, ∞); on each interval the absolute signs are removed with a known sign, producing a simple linear inequality. The union of the valid sub‑intervals gives the final answer. A common examiner twist is to embed an absolute inequality inside a coded statement, for example “@ means |x| > 3”. Decoding must be done before any case splitting.

Graphical interpretation reinforces the algebraic method: |x – c| represents the distance between x and c on the real line. The inequality |x – c| ≤ r describes the closed interval [c – r, c + r]. This visual cue helps avoid sign errors when the centre c is negative. When two absolute expressions are compared, such as |x – 2| < |x + 4|, square both sides (both sides are non‑negative) to obtain (x – 2)² < (x + 4)², which simplifies to a linear inequality after expansion. Squaring is legitimate only because both sides are ≥ 0; if one side could be negative, the step would be invalid. Always verify non‑negativity before squaring.

In data‑sufficiency format, a statement like “|X – 5| ≤ 2” gives a precise interval for X (3 ≤ X ≤ 7). Combined with another statement that bounds Y, the interval‑overlap test decides sufficiency. The examiner may also ask for the number of integer solutions; counting integers in the final interval is a quick arithmetic step after the algebraic work.

Key takeaway: treat every absolute inequality as a piecewise linear problem, identify critical points, solve on each piece, and recombine. The piecewise approach is systematic and eliminates the most frequent error — forgetting to flip the inequality when removing a negative modulus.

Quadratic Inequalities and Sign Analysis

A quadratic inequality has the form ax² + bx + c > 0 (or ≥, <, ≤) with a ≠ 0. The sign of the quadratic expression is determined by the leading coefficient a and the real roots of the corresponding equation ax² + bx + c = 0. Compute the discriminant Δ = b² – 4ac. If Δ < 0 the quadratic has no real roots; its sign is the sign of a for all real x. Thus ax² + bx + c > 0 is either always true (a > 0) or never true (a < 0). If Δ = 0 there is a double root r = –b/(2a). The expression touches zero at r and keeps the sign of a elsewhere; the strict inequality > 0 holds for all x ≠ r when a > 0, and has no solution when a < 0. If Δ > 0 there are two distinct roots r₁ < r₂. The quadratic factors as a(x – r₁)(x – r₂). A sign chart on the number line with the roots as boundaries shows that the expression is positive outside the interval (r₁, r₂) when a > 0, and positive inside the interval when a < 0. The solution set for > 0 is therefore (–∞, r₁) ∪ (r₂, ∞) for a > 0, and (r₁, r₂) for a < 0. For ≥ 0 include the endpoints.

When the inequality is not in standard form, first bring all terms to one side. For example, x² – 5x + 6 < 2x becomes x² – 7x + 6 < 0. Factor or use the quadratic formula to find roots 1 and 6. Since the leading coefficient is positive, the expression is negative between the roots, giving 1 < x < 6. If the quadratic does not factor nicely, the quadratic formula with exact radicals is acceptable; the final answer can be left in radical form or as a decimal approximation depending on the question’s instruction.

Rational inequalities that reduce to quadratic forms, such as (x² – 4)/(x – 1) ≥ 0, require a combined sign chart for numerator and denominator. Identify zeros of numerator (x = –2, 2) and the point where denominator vanishes (x = 1). The sign of the whole fraction changes at each of these points. Test intervals to determine where the fraction is non‑negative, remembering that x = 1 is excluded from the domain. The final solution is a union of intervals that may include endpoints where the numerator is zero but never the denominator zero.

Examiners often combine quadratic inequalities with coded symbols. A statement like “# means x² – 3x + 2 > 0” must be decoded first, then solved using the sign‑chart method. The presence of a parameter (e.g., kx² + 5x + 6 > 0 for all x) turns the problem into a condition on the parameter: discriminant < 0 and leading coefficient > 0. This yields k > 25/24. Recognising the parameter‑type question saves time because the discriminant test replaces a full interval analysis.

Worked Example: Quadratic Inequality with Parameter
Find the range of k for which the inequality kx² – 4x + 3 > 0 holds for every real x.
For the quadratic to be strictly positive for all x, two conditions are necessary: (1) the leading coefficient k must be positive, and (2) the discriminant must be negative so that the graph never touches the x‑axis. The discriminant Δ = (–4)² – 4·k·3 = 16 – 12k. Require Δ < 0 ⇒ 16 – 12k < 0 ⇒ 12k > 16 ⇒ k > 4/3. Together with k > 0, the final condition is k > 4/3. Any k in (4/3, ∞) satisfies the requirement.
Exam‑Day Strategy
When a quadratic inequality appears, instantly write down the discriminant and the sign of the leading coefficient. If the question asks “for all x”, the discriminant test is the fastest route. For “there exists x”, check whether the vertex value satisfies the inequality. Keep a mental checklist: Δ sign, a sign, interval direction. This avoids re‑deriving the sign chart under time pressure.

Inequalities in Multi‑Variable Optimization Scenarios

Many reasoning questions present a set of linear inequalities that define a feasible region for two or three variables. The typical format: “If 2x + 3y ≤ 12, x – y ≥ 1, x ≥ 0, y ≥ 0, what is the maximum value of 5x + 4y?” This is a linear programming problem in disguise. The feasible region is a convex polygon (or polyhedron) bounded by the lines corresponding to each inequality. The objective function 5x + 4y is linear, so its maximum and minimum over a convex polygon occur at vertices (corner points). The solving steps: (1) convert each inequality to an equation to draw boundary lines; (2) find intersection points of every pair of lines that satisfy all inequalities; (3) evaluate the objective at each feasible vertex; (4) pick the largest (or smallest) value. Because the number of variables is small, the vertex enumeration can be done algebraically without graph paper. For the example, the vertices are (0,0), (0,4), (3,0), and the intersection of 2x+3y=12 with x–y=1 which gives x=3, y=2. Evaluating 5x+4y yields 0, 16, 15, and 23 respectively; the maximum is 23 at (3,2).

When the objective is to decide whether a target inequality such as “5x + 4y > 20” can be true, it suffices to check the maximum possible value of the left side. If the maximum exceeds 20, the statement can be true; if the maximum is ≤ 20, it can never be true. This transforms a data‑sufficiency question into a simple vertex check. The examiner may also ask for the number of integer points inside the feasible region. After identifying the polygon, use Pick’s theorem or direct counting for small coordinates.

If the constraints include a strict inequality (e.g., 2x + 3y < 12), the boundary line is not part of the feasible set. The maximum of a linear objective over an open region may not be attained; the supremum is the value at the excluded vertex. In such cases the answer “cannot be determined” or “no maximum” is correct. Always note whether the inequalities are strict or non‑strict.

Three‑variable problems extend the same principle: the feasible region is a convex polyhedron, and the optimum lies at a vertex where three planes intersect. Solving three equations simultaneously is manageable with substitution or matrix methods. However, reasoning exams rarely go beyond two variables because of time constraints. When three variables appear, the question usually asks only for a logical deduction (e.g., “If x + y + z ≤ 10 and x, y, z ≥ 2, what is the maximum possible value of x?”) which reduces to a single‑variable bound after substituting the minimum values of the other variables.

Conditional Inequalities and Logical Dependencies

Conditional inequalities take the form “If P then Q”, where P and Q are inequality statements. In logical notation this is P → Q. The truth table for implication shows that the only false case is when P is true and Q is false. Therefore, to disprove a conditional statement it is enough to find a single assignment that makes P true and Q false. Conversely, to prove it, one must show that whenever P holds, Q automatically holds. This is equivalent to proving that the set of solutions of P is a subset of the solutions of Q. For example, “If x² – 4 > 0 then |x| > 2” is true because the solution set of the antecedent is (–∞, –2) ∪ (2, ∞), which is exactly the solution set of the consequent.

When multiple conditionals are chained, such as “If A > B then B > C; if B > C then C > D”, the transitive property of implication allows the combined statement “If A > B then C > D”. However, the underlying inequalities must be compatible; a chain that mixes strict and non‑strict signs may break transitivity at the point where equality is possible. The safe method is to convert each conditional into a set inclusion of solution intervals and then verify the inclusion.

Examiners often embed conditionals in coded form: “@ means ‘if x > 3 then x² > 9’”. Decoding yields a true statement because the antecedent interval (3, ∞) maps into (9, ∞) under squaring. A false coded conditional could be “# means ‘if x² > 9 then x > 3’”, which fails for x = –4. Recognising the direction of implication is crucial; the converse of a true conditional is not automatically true.

In data‑sufficiency, a statement may be a conditional: “Statement 1: If X > 5 then Y < 10”. To test sufficiency for “Is Y < 10?”, check whether Statement 1 alone guarantees Y < 10. It does not, because the antecedent might be false, leaving Y unrestricted. Only when the antecedent is known to be true (perhaps from another statement) does the conditional become useful. The combination of statements often supplies the missing antecedent, turning a conditional into a definite bound.

Inequalities with Floor, Ceiling and Integer Constraints

The floor function ⌊x⌋ returns the greatest integer ≤ x; the ceiling function ⌈x⌉ returns the smallest integer ≥ x. Inequalities involving these functions are solved by translating them into double inequalities on x. For example, ⌊x⌋ = 3 means 3 ≤ x < 4. The inequality ⌊2x – 1⌋ ≤ 5 becomes 2x – 1 < 6 (since floor ≤ 5 ⇔ argument < 6) and 2x – 1 ≥ 5 (since floor ≥ 5 ⇔ argument ≥ 5). Combining gives 5 ≤ 2x – 1 < 6 ⇒ 3 ≤ x < 3.5. Similarly, ⌈x/2⌉ ≥ 4 translates to x/2 > 3 (since ceiling ≥ 4 ⇔ argument > 3) and x/2 ≤ 4 (since ceiling ≤ 4 ⇔ argument ≤ 4). The result is 6 < x ≤ 8.

When floor and ceiling appear together, treat each separately and intersect the resulting intervals. For instance, ⌊x⌋ + ⌈x⌉ = 7. For non‑integer x, ⌊x⌋ = n and ⌈x⌉ = n+1, so 2n+1 = 7 ⇒ n = 3, giving 3 < x < 4. For integer x, floor = ceiling = x, so 2x = 7 has no integer solution. Hence the solution set is (3, 4). This case analysis (integer vs non‑integer) is a standard technique.

Integer constraints such as “x, y are positive integers satisfying 3x + 5y ≤ 20” are solved by enumerating possible values of one variable. Because the coefficients are small, the number of feasible pairs is limited. For each integer x from 1 to floor(20/3)=6, compute the maximum integer y = floor((20 – 3x)/5). Count the pairs or find the maximum of an objective like x + y. This discrete optimisation mirrors the continuous vertex method but uses integer bounds.

Examiners may combine floor/ceiling with coded symbols: “$ means ⌊x⌋ > 2”. Decoding gives x ≥ 3. The presence of a strict inequality on the floor (>) translates to a non‑strict bound on x because ⌊x⌋ > 2 ⇔ ⌊x⌋ ≥ 3 ⇔ x ≥ 3. Always convert the floor/ceiling inequality to a simple interval before chaining with other relations.

  • Assuming the solution of |x| < a is x < a only, forgetting the lower bound –a < x.
  • Applying the sign chart for a quadratic without checking the leading coefficient sign, reversing the interval direction.
  • Treating a strict inequality boundary as included when evaluating the maximum of a linear objective over an open feasible region.
  • Confusing the direction of a conditional inequality and accepting the converse as valid.
  • Neglecting the integer‑versus‑non‑integer case split when floor and ceiling appear together, leading to missing or extra solutions.
  • Forgetting that a discriminant test for “positive for all x” requires both a > 0 and Δ < 0, not just Δ < 0.
  • Misreading a coded symbol because two different keys are used in the same question, causing an entire chain to be decoded incorrectly.

Practice Questions

← Direction & Distance Data Sufficiency →