Study guide

2.4 Equations and Inequalities with Absolute Values

Bocconi Admission Test Online Bocconi Test for Bachelor Programs

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Structure, Scoring Mechanics & Test Strategy

1.1 Test Architecture, Timing & the Sequential Test Interface 1.2 Scoring System, Penalty Mathematics & Strategic Answering

2 Chapter 2: Mathematics — Algebra, Equations & Inequalities

2.1 Algebraic Expressions, Polynomials, Powers & Radicals 2.2 Linear & Quadratic Equations and Systems 2.3 Linear & Quadratic Inequalities and Sign Charts 2.4 Equations and Inequalities with Absolute Values

3 Chapter 3: Mathematics — Functions, Exponents & Logarithms

3.1 Function Concepts, Domain, Range & Inverses 3.2 Composition of Functions & Transformations 3.3 Exponential Functions, Properties & Equations 3.4 Logarithmic Functions, Laws & Equations

4 Chapter 4: Mathematics — Geometry, Analytic Geometry & Trigonometry

4.1 Plane Geometry: Polygons, Circles & Area Theorems 4.2 Analytic Geometry: Lines, Slopes & Distances in the Cartesian Plane 4.3 Conic Sections: Circles & Parabolas in the Coordinate Plane 4.4 Trigonometric Functions, Identities & Right-Triangle Applications

5 Chapter 5: Mathematics — Combinatorics, Probability, Statistics & Set Theory

5.1 Set Theory, Operations & Venn Diagrams 5.2 Combinatorics: Permutations, Combinations & Factorials 5.3 Probability Theory: Independent Events, Conditional Probability & Bayes' Basics 5.4 Descriptive Statistics: Central Tendency, Dispersion & Frequency Distributions

6 Chapter 6: Reading Comprehension — Business, Economic & Academic Analysis

6.1 Main Idea, Text Structure & Passage Mapping 6.2 Explicit Information Retrieval & Detail Verification 6.3 Inference, Implicit Meaning & Authorial Purpose 6.4 Tone, Rhetorical Devices & Vocabulary in Academic Context

7 Chapter 7: Numerical Reasoning — Charts, Tables & Data Interpretation

7.1 Data Tables & Multi-Series Matrices 7.2 Graphical Interpretation: Bar, Line, Pie & Composite Charts 7.3 Percentage Calculations, Changes & Financial Metrics 7.4 Ratios, Proportions, Rates & Weighted Averages

8 Chapter 8: Logic & Critical Thinking — Formal & Deductive Reasoning

8.1 Propositional Logic, Truth Tables & Logical Connectives 8.2 Conditional Reasoning, Contrapositives & Modus Ponens/Tollens 8.3 Syllogisms, Quantifiers & Venn Logic

9 Chapter 9: Critical Thinking — Argument Analysis, Assumptions & the Official Item Types

9.1 Argument Components, Premises & Unstated Assumptions 9.2 Strengthening, Weakening & Flaw Identification 9.3 Constraint Deduction Drills: Ordering, Arrangement & Assignment 9.4 The Two Official Critical-Thinking Item Types: Data Propositions & Deducibility

2.4 Equations and Inequalities with Absolute Values

Key Takeaways Explain This Topic AI

The absolute value |x| represents the Euclidean distance from x to 0 on the real number line, defined algebraically as |x| = x for x ≥ 0 and |x| = -x for x < 0.

Equations of the form |ax + b| = cx + d require the existence domain constraint cx + d ≥ 0; any algebraic candidate that violates this condition is extraneous and must be rejected.

The inequality |ax + b| < c represents a bounded conjunction -c < ax + b < c (for c > 0), whereas |ax + b| > c represents an unbounded disjunction ax + b < -c or ax + b > c.

When solving equations with multiple absolute values, find the critical points of all arguments, partition the real line into disjoint sub-intervals, and solve each piecewise branch separately.

The sum-of-distances function f(x) = |x - a| + |x - b| forms a flat trough between a and b where f(x) equals the constant distance |a - b|.

Last updated: September 2026

2.4 Equations and Inequalities with Absolute Values

Absolute value expressions are frequently tested on the Bocconi Admission Test, appearing both as standalone algebra problems and within function domain or calculus questions. Because modulus operations are piecewise non-linear, standard algebraic manipulation often introduces extraneous solutions or sign errors unless candidate domains are partitioned rigorously.

  • Definition and Geometric Interpretation
  • Formal Algebraic Definition

The absolute value of a real number x x x is defined piecewise: ∣ x ∣ = { x if x ≥ 0 − x if x < 0 |x| = \begin{cases} x & \text{if } x \ge 0 \\ -x & \text{if } x < 0 \end{cases} ∣ x ∣ = { x − x ​ if x ≥ 0 if x < 0 ​

The output is always non-negative: ∣ x ∣ ≥ 0 |x| \ge 0 ∣ x ∣ ≥ 0 for all x ∈ R x \in \mathbb{R} x ∈ R .

Geometric Distance on the Real Line

Geometrically, ∣ x ∣ |x| ∣ x ∣ is the Euclidean distance from coordinate x x x to the origin 0 0 0 . For any two coordinates x x x and a a a , the distance between them is: Distance ( x , a ) = ∣ x − a ∣ \text{Distance}(x, a) = |x - a| Distance ( x , a ) = ∣ x − a ∣

This geometric viewpoint solves many problems by inspection:

∣ x − 3 ∣ = 5 |x - 3| = 5 ∣ x − 3∣ = 5 : Points x x x at distance 5 5 5 from 3 3 3 , yielding 3 + 5 = 8 3 + 5 = 8 3 + 5 = 8 and 3 − 5 = − 2 3 - 5 = -2 3 − 5 = − 2 .

∣ x − 4 ∣ < 2 |x - 4| < 2 ∣ x − 4∣ < 2 : Points x x x within distance 2 2 2 of 4 4 4 , yielding open interval ( 4 − 2 , 4 + 2 ) = ( 2 , 6 ) (4 - 2, 4 + 2) = (2, 6) ( 4 − 2 , 4 + 2 ) = ( 2 , 6 ) .

Fundamental Properties of Modulus

For all real numbers x , y x, y x , y :

Property Mathematical Formulation Operational Significance

Non-Negativity ∣ x ∣ ≥ 0 \vert x\vert\ge 0 ∣ x ∣ ≥ 0 ; ∣ x ∣ = 0 ⟺ x = 0 \vert x\vert= 0 \iff x = 0 ∣ x ∣ = 0 ⟺ x = 0 ∣ f ( x ) ∣ = negative \vert f(x)\vert= \text{negative} ∣ f ( x ) ∣ = negative has no real solution immediately.

Symmetry ∣ − x ∣ = ∣ x ∣ \vert-x\vert= \vert x\vert ∣ − x ∣ = ∣ x ∣ and ∣ x − y ∣ = ∣ y − x ∣ \vert x - y\vert= \vert y - x\vert ∣ x − y ∣ = ∣ y − x ∣ Distance is invariant under order of subtraction.

Multiplicative ∣ x y ∣ = ∣ x ∣ ⋅ ∣ y ∣ \vert xy\vert= \vert x\vert\cdot \vert y\vert ∣ x y ∣ = ∣ x ∣ ⋅ ∣ y ∣ Modulus distributes across products.

Quotient ∣ x y ∣ = ∣ x ∣ ∣ y ∣ ( y ≠ 0 ) \left\vert\frac{x}{y}\right\vert= \frac{\vert x\vert}{\vert y\vert} \; (y \neq 0) ​ y x ​ ​ = ∣ y ∣ ∣ x ∣ ​ ( y  = 0 ) Modulus distributes across quotients.

Square / Radical ∣ x ∣ 2 = x 2 \vert x\vert^2 = x^2 ∣ x ∣ 2 = x 2 and x 2 = ∣ x ∣ \sqrt{x^2} = \vert x\vert x 2 ​ = ∣ x ∣ Squaring eliminates modulus bars: ( ∣ x ∣ ) 2 = x 2 (\vert x\vert)^2 = x^2 ( ∣ x ∣ ) 2 = x 2 .

Triangle Inequality ∣ x + y ∣ ≤ ∣ x ∣ + ∣ y ∣ \vert x + y\vert\le \vert x\vert+ \vert y\vert ∣ x + y ∣ ≤ ∣ x ∣ + ∣ y ∣ Equality holds if and only if x , y x, y x , y share the same sign ( x y ≥ 0 xy \ge 0 x y ≥ 0 ).

  • Absolute Value Equations: Solution Strategies
  • Form 1: ∣ f ( x ) ∣ = c |f(x)| = c ∣ f ( x ) ∣ = c (Constant Right Side)

If c < 0 c < 0 c < 0 : No solution ( S = ∅ S = \emptyset S = ∅ ).

If c = 0 c = 0 c = 0 : Single linear equation f ( x ) = 0 f(x) = 0 f ( x ) = 0 .

If c > 0 c > 0 c > 0 : Disjunction of two branches: f ( x ) = c f(x) = c f ( x ) = c or f ( x ) = − c f(x) = -c f ( x ) = − c .

Form 2: ∣ f ( x ) ∣ = g ( x ) |f(x)| = g(x) ∣ f ( x ) ∣ = g ( x ) (Variable Right Side)

Because the left side is non-negative, real solutions require the existence constraint g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0 . Under this condition, split into f ( x ) = g ( x ) f(x) = g(x) f ( x ) = g ( x ) or f ( x ) = − g ( x ) f(x) = -g(x) f ( x ) = − g ( x ) . Any algebraic candidate causing g ( x ) < 0 g(x) < 0 g ( x ) < 0 is extraneous and must be rejected.

Form 3: ∣ f ( x ) ∣ = ∣ g ( x ) ∣ |f(x)| = |g(x)| ∣ f ( x ) ∣ = ∣ g ( x ) ∣ (Modulus on Both Sides)

Both sides are non-negative, so no extraneous sign contradictions arise. The equation is directly equivalent to f ( x ) = g ( x ) f(x) = g(x) f ( x ) = g ( x ) or f ( x ) = − g ( x ) f(x) = -g(x) f ( x ) = − g ( x ) , or by squaring: [ f ( x ) − g ( x ) ] [ f ( x ) + g ( x ) ] = 0 [f(x) - g(x)][f(x) + g(x)] = 0 [ f ( x ) − g ( x )] [ f ( x ) + g ( x )] = 0 .

Absolute Value Inequalities: Conjunction vs. Disjunction

For any positive constant c > 0 c > 0 c > 0 :

Bounded Form ∣ f ( x ) ∣ < c |f(x)| < c ∣ f ( x ) ∣ < c or ≤ c \le c ≤ c (Conjunction / AND)

Confines f ( x ) f(x) f ( x ) within a single bounded interval: − c < f ( x ) < c ( or − c ≤ f ( x ) ≤ c ) -c < f(x) < c \quad (\text{or } -c \le f(x) \le c) − c < f ( x ) < c ( or − c ≤ f ( x ) ≤ c )

Unbounded Form ∣ f ( x ) ∣ > c |f(x)| > c ∣ f ( x ) ∣ > c or ≥ c \ge c ≥ c (Disjunction / OR)

Pushes f ( x ) f(x) f ( x ) into two disjoint unbounded rays: f ( x ) < − c or f ( x ) > c f(x) < -c \quad \text{or} \quad f(x) > c f ( x ) < − c or f ( x ) > c

The solution is the union of two intervals: ( − ∞ , x 1 ) ∪ ( x 2 , ∞ ) (-\infty, x_1) \cup (x_2, \infty) ( − ∞ , x 1 ​ ) ∪ ( x 2 ​ , ∞ ) .

Inequality Form Condition on c c c Equivalent System Geometric Solution Topology

∣ f ( x ) ∣ < c \vert f(x)\vert< c ∣ f ( x ) ∣ < c c > 0 c > 0 c > 0 − c < f ( x ) < c -c < f(x) < c − c < f ( x ) < c Single open bounded interval

∣ f ( x ) ∣ ≤ c \vert f(x)\vert\le c ∣ f ( x ) ∣ ≤ c c > 0 c > 0 c > 0 − c ≤ f ( x ) ≤ c -c \le f(x) \le c − c ≤ f ( x ) ≤ c Single closed bounded interval

∣ f ( x ) ∣ > c \vert f(x)\vert> c ∣ f ( x ) ∣ > c c > 0 c > 0 c > 0 f ( x ) < − c f(x) < -c f ( x ) < − c or f ( x ) > c f(x) > c f ( x ) > c Union of two disjoint open rays

∣ f ( x ) ∣ ≥ c \vert f(x)\vert\ge c ∣ f ( x ) ∣ ≥ c c > 0 c > 0 c > 0 f ( x ) ≤ − c f(x) \le -c f ( x ) ≤ − c or f ( x ) ≥ c f(x) \ge c f ( x ) ≥ c Union of two disjoint closed rays

∣ f ( x ) ∣ < c \vert f(x)\vert< c ∣ f ( x ) ∣ < c c ≤ 0 c \le 0 c ≤ 0 No solution ( S = ∅ S = \emptyset S = ∅ ) Empty set

∣ f ( x ) ∣ > c \vert f(x)\vert> c ∣ f ( x ) ∣ > c c < 0 c < 0 c < 0 All real numbers ( S = R S = \mathbb{R} S = R ) Entire real number line

Multi-Absolute-Value Expressions and Interval Decomposition

For equations with multiple modulus terms, apply the Method of Sub-Intervals :

Set each modulus argument to zero to identify critical points: r 1 < r 2 < ⋯ < r n r_1 < r_2 < \dots < r_n r 1 ​ < r 2 ​ < ⋯ < r n ​ .

Partition the real line into n + 1 n + 1 n + 1 sub-intervals.

Replace each modulus term with + ( … ) +(\dots) + ( … ) or − ( … ) -(\dots) − ( … ) based on its sign in that interval.

Solve the algebraic equation on each sub-interval.

Intersect candidate solutions with the active sub-interval; discard any lying outside.

Take the set union of all valid solutions.

  • Worked Step-by-Step Examples
  • Example 1: Variable Right-Hand Side with Extraneous Root

Solve ∣ 2 x − 5 ∣ = 3 x − 10 |2x - 5| = 3x - 10 ∣2 x − 5∣ = 3 x − 10 for real x x x :

State existence condition: 3 x − 10 ≥ 0 ⟹ x ≥ 10 / 3 ≈ 3.33 3x - 10 \ge 0 \implies x \ge 10/3 \approx 3.33 3 x − 10 ≥ 0 ⟹ x ≥ 10/3 ≈ 3.33 .

Branch 1: 2 x − 5 = 3 x − 10 ⟹ − x = − 5 ⟹ x = 5 2x - 5 = 3x - 10 \implies -x = -5 \implies x = 5 2 x − 5 = 3 x − 10 ⟹ − x = − 5 ⟹ x = 5 . Since 5 ≥ 10 / 3 5 \ge 10/3 5 ≥ 10/3 , x = 5 x = 5 x = 5 is valid.

Branch 2: 2 x − 5 = − ( 3 x − 10 ) ⟹ 5 x = 15 ⟹ x = 3 2x - 5 = -(3x - 10) \implies 5x = 15 \implies x = 3 2 x − 5 = − ( 3 x − 10 ) ⟹ 5 x = 15 ⟹ x = 3 . Since 3 = 9 / 3 < 10 / 3 3 = 9/3 < 10/3 3 = 9/3 < 10/3 , x = 3 x = 3 x = 3 is extraneous.

Check: At x = 5 x = 5 x = 5 , ∣ 2 ( 5 ) − 5 ∣ = 5 = 3 ( 5 ) − 10 |2(5) - 5| = 5 = 3(5) - 10 ∣2 ( 5 ) − 5∣ = 5 = 3 ( 5 ) − 10 . Valid! Solution set: S = { 5 } S = \{5\} S = { 5 } .

Example 2: Bounded Modulus Inequality and Integer Counting

Solve ∣ 4 − x ∣ ≤ 6 |4 - x| \le 6 ∣4 − x ∣ ≤ 6 and count integer solutions:

By symmetry: ∣ x − 4 ∣ ≤ 6 |x - 4| \le 6 ∣ x − 4∣ ≤ 6 .

Double inequality: − 6 ≤ x − 4 ≤ 6 -6 \le x - 4 \le 6 − 6 ≤ x − 4 ≤ 6 .

Add 4: − 2 ≤ x ≤ 10 -2 \le x \le 10 − 2 ≤ x ≤ 10 , giving closed interval [ − 2 , 10 ] [-2, 10] [ − 2 , 10 ] .

Integer count: 10 − ( − 2 ) + 1 = 13 10 - (-2) + 1 = 13 10 − ( − 2 ) + 1 = 13 integers.

Example 3: Multi-Modulus Equation

Solve ∣ x + 2 ∣ + ∣ x − 4 ∣ = 8 |x + 2| + |x - 4| = 8 ∣ x + 2∣ + ∣ x − 4∣ = 8 :

Critical points: x = − 2 x = -2 x = − 2 and x = 4 x = 4 x = 4 , creating three intervals: ( − ∞ , − 2 ) (-\infty, -2) ( − ∞ , − 2 ) , [ − 2 , 4 ] [-2, 4] [ − 2 , 4 ] , and ( 4 , ∞ ) (4, \infty) ( 4 , ∞ ) .

Interval x < − 2 x < -2 x < − 2 : − ( x + 2 ) − ( x − 4 ) = 8 ⟹ − 2 x + 2 = 8 ⟹ x = − 3 -(x + 2) - (x - 4) = 8 \implies -2x + 2 = 8 \implies x = -3 − ( x + 2 ) − ( x − 4 ) = 8 ⟹ − 2 x + 2 = 8 ⟹ x = − 3 (in interval, valid).

Interval − 2 ≤ x ≤ 4 -2 \le x \le 4 − 2 ≤ x ≤ 4 : ( x + 2 ) − ( x − 4 ) = 8 ⟹ 6 = 8 (x + 2) - (x - 4) = 8 \implies 6 = 8 ( x + 2 ) − ( x − 4 ) = 8 ⟹ 6 = 8 (false, no solution).

Interval x > 4 x > 4 x > 4 : ( x + 2 ) + ( x − 4 ) = 8 ⟹ 2 x − 2 = 8 ⟹ x = 5 (x + 2) + (x - 4) = 8 \implies 2x - 2 = 8 \implies x = 5 ( x + 2 ) + ( x − 4 ) = 8 ⟹ 2 x − 2 = 8 ⟹ x = 5 (in interval, valid).

Solution set: S = { − 3 , 5 } S = \{-3, 5\} S = { − 3 , 5 } . Solution sum: − 3 + 5 = 2 -3 + 5 = 2 − 3 + 5 = 2 .