Study guide

9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)

TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy

1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing

2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic

2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators

3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out

3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)

4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic

4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections

6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic

6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings

7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic

7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals

8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)

9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities

9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)

10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems

10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems

11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics

11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas

12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus

12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment

13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons

13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares

14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry

14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles

9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)

Key Takeaways Explain This Topic AI

For a two-line linear system, a nonzero coefficient determinant gives one solution; dependent rows require checking the constants to distinguish coincidence from contradiction.

The inequality x 2 < x x^2 < x x 2 < x forces 0 < x < 1 0 < x < 1 0 < x < 1 , and squaring any interval − a < x < b -a < x < b − a < x < b that crosses zero yields 0 ≤ x 2 < max ⁡ ( a 2 , b 2 ) 0 \le x^2 < \max(a^2, b^2) 0 ≤ x 2 < max ( a 2 , b 2 ) .

When x , y ∈ Z x, y \in \mathbb{Z} x , y ∈ Z are restricted to integers, select discrete integer values from the intervals; when x , y ∈ R x, y \in \mathbb{R} x , y ∈ R , construct the full algebraic interval and complete the square before squaring quadratics.

In an absolute value equation ∣ f ( x ) ∣ = g ( x ) \lvert f(x) \rvert = g(x) ∣ f ( x )∣ = g ( x ) , every candidate root from f ( x ) = ± g ( x ) f(x) = \pm g(x) f ( x ) = ± g ( x ) must satisfy g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0 or be rejected as extraneous.

By the triangle inequality, the minimum of ∣ x − a ∣ + ∣ x − b ∣ \lvert x - a \rvert + \lvert x - b \rvert ∣ x − a ∣ + ∣ x − b ∣ is ∣ a − b ∣ \lvert a - b \rvert ∣ a − b ∣ , and the extrema of ∣ x − a ∣ − ∣ x − b ∣ \lvert x - a \rvert - \lvert x - b \rvert ∣ x − a ∣ − ∣ x − b ∣ are ± ∣ a − b ∣ \pm \lvert a - b \rvert ± ∣ a − b ∣ .

Last updated: October 2026

  • Linear Systems, Simple Inequalities ( Basit Eşitsizlikler ) & Absolute Value ( Mutlak Değer )
  • First-Degree Linear Equations & 2 × 2 2 \times 2 2 × 2 Systems ( Birinci Dereceden Denklemler )
  • 1. Parametric Single-Variable Equations ( a x + b = 0 ax + b = 0 a x + b = 0 )

The solution set ( çözüm kümesi , C \c K ÇK C \c ​ K ) of a x + b = 0 ax + b = 0 a x + b = 0 over R \mathbb{R} R depends entirely on whether the coefficient of x x x vanishes:

Unique Solution ( Tek Elemanlı Çözüm Kümesi ): a ≠ 0 ⟹ x = − b a a \ne 0 \implies x = -\frac{b}{a} a  = 0 ⟹ x = − a b ​ .

Empty Solution Set ( C \c K = ∅ ÇK = \varnothing C \c ​ K = ∅ ): a = 0 a = 0 a = 0 and b ≠ 0 b \ne 0 b  = 0 (reduces to the contradiction 0 ⋅ x + b = 0 0 \cdot x + b = 0 0 ⋅ x + b = 0 ).

Infinite Solutions ( C \c K = R ÇK = \mathbb{R} C \c ​ K = R ): a = 0 a = 0 a = 0 and b = 0 b = 0 b = 0 (reduces to the identity 0 = 0 0 = 0 0 = 0 , satisfied by every x ∈ R x \in \mathbb{R} x ∈ R ).

2. Two-Variable Linear Systems ( İki Bilinmeyenli Denklem Sistemleri )

For the system of two lines a 1 x + b 1 y = c 1 a_1 x + b_1 y = c_1 a 1 ​ x + b 1 ​ y = c 1 ​ and a 2 x + b 2 y = c 2 a_2 x + b_2 y = c_2 a 2 ​ x + b 2 ​ y = c 2 ​ : { 1. Unique Intersection Point: a 1 a 2 ≠ b 1 b 2 2. Infinite Solutions (Coincident Lines): a 1 a 2 = b 1 b 2 = c 1 c 2 3. Empty Solution Set ∅ (Parallel Lines): a 1 a 2 = b 1 b 2 ≠ c 1 c 2 \begin{cases} \text{1. Unique Intersection Point:} & \frac{a_1}{a_2} \ne \frac{b_1}{b_2} \\ \text{2. Infinite Solutions (Coincident Lines):} & \frac{a_1}{a_2} = \frac{b_1}{b_2} = \frac{c_1}{c_2} \\ \text{3. Empty Solution Set } \varnothing \text{ (Parallel Lines):} & \frac{a_1}{a_2} = \frac{b_1}{b_2} \ne \frac{c_1}{c_2} \end{cases} ⎩ ⎨ ⎧ ​ 1. Unique Intersection Point: 2. Infinite Solutions (Coincident Lines): 3. Empty Solution Set ∅ (Parallel Lines): ​ a 2 ​ a 1 ​ ​  = b 2 ​ b 1 ​ ​ a 2 ​ a 1 ​ ​ = b 2 ​ b 1 ​ ​ = c 2 ​ c 1 ​ ​ a 2 ​ a 1 ​ ​ = b 2 ​ b 1 ​ ​  = c 2 ​ c 1 ​ ​ ​

  • Simple Inequalities ( Basit Eşitsizlikler ) & Sign Traps
  • 1. Core Inequality Operations & Reciprocals

Multiplying or dividing both sides of an inequality by a negative number reverses the inequality sign: if a < b a < b a < b and c < 0 c < 0 c < 0 , then a c > b c a c > b c a c > b c .

Reciprocal Rule: If a a a and b b b have the same sign ( 0 < a < b 0 < a < b 0 < a < b or a < b < 0 a < b < 0 a < b < 0 ), taking reciprocals reverses the inequality sign: 1 a > 1 b \frac{1}{a} > \frac{1}{b} a 1 ​ > b 1 ​ . If a a a and b b b have opposite signs ( a < 0 < b a < 0 < b a < 0 < b ), taking reciprocals preserves the sign: 1 a < 0 < 1 b \frac{1}{a} < 0 < \frac{1}{b} a 1 ​ < 0 < b 1 ​ .

3. Squaring an Interval That Crosses Zero

Same-sign bounds: If 2 < x < 5 2 < x < 5 2 < x < 5 , then 4 < x 2 < 25 4 < x^2 < 25 4 < x 2 < 25 . If − 5 < x ≤ − 2 -5 < x \le -2 − 5 < x ≤ − 2 , squaring reverses the order: 4 ≤ x 2 < 25 4 \le x^2 < 25 4 ≤ x 2 < 25 .

Opposite-sign bounds (crossing 0 0 0 ): If − a < x < b -a < x < b − a < x < b with a , b > 0 a, b > 0 a , b > 0 , then x = 0 x = 0 x = 0 lies inside the interval, so the minimum possible value of x 2 x^2 x 2 is 0 2 = 0 0^2 = 0 0 2 = 0 ! The upper bound is max ⁡ ( a 2 , b 2 ) \max(a^2, b^2) max ( a 2 , b 2 ) : − 4 < x < 3 ⟹ 0 ≤ x 2 < 16 ( NEVER 9 < x 2 < 16 ! ) -4 < x < 3 \implies 0 \le x^2 < 16 \qquad (\text{NEVER } 9 < x^2 < 16!) − 4 < x < 3 ⟹ 0 ≤ x 2 < 16 ( NEVER 9 < x 2 < 16 !)

4. The Domain Trap: Integer Selection ( Z \mathbb{Z} Z ) vs. Real Interval Expansion ( R \mathbb{R} R )

Before touching an inequality range question, check the opening declaration of the variables:

If x , y ∈ Z x, y \in \mathbb{Z} x , y ∈ Z (Integers): Never multiply and add the inequalities! Pick discrete extreme integers directly from each interval. For example, if x , y ∈ Z x, y \in \mathbb{Z} x , y ∈ Z with − 2 < x < 4 -2 < x < 4 − 2 < x < 4 ( x ∈ { − 1 , 0 , 1 , 2 , 3 } x \in \{-1, 0, 1, 2, 3\} x ∈ { − 1 , 0 , 1 , 2 , 3 } ) and 1 < y < 6 1 < y < 6 1 < y < 6 ( y ∈ { 2 , 3 , 4 , 5 } y \in \{2, 3, 4, 5\} y ∈ { 2 , 3 , 4 , 5 } ), the maximum value of 2 x − 3 y 2x - 3y 2 x − 3 y uses the largest integer x = 3 x = 3 x = 3 and smallest integer y = 2 y = 2 y = 2 : 2 ( 3 ) − 3 ( 2 ) = 0 2(3) - 3(2) = 0 2 ( 3 ) − 3 ( 2 ) = 0 .

If x , y ∈ R x, y \in \mathbb{R} x , y ∈ R (Real Numbers, or no integer condition is stated): You must expand the continuous intervals algebraically: − 4 < 2 x < 8 -4 < 2x < 8 − 4 < 2 x < 8 and − 18 < − 3 y < − 3 -18 < -3y < -3 − 18 < − 3 y < − 3 , which sum to − 22 < 2 x − 3 y < 5 -22 < 2x - 3y < 5 − 22 < 2 x − 3 y < 5 , so the maximum integer value of 2 x − 3 y 2x - 3y 2 x − 3 y is 4 4 4 !

Quadratic Range Trap on R \mathbb{R} R : To bound x 2 + 2 b x + c x^2 + 2bx + c x 2 + 2 b x + c on an interval of x ∈ R x \in \mathbb{R} x ∈ R , never bound x 2 x^2 x 2 and 2 b x 2bx 2 b x separately and add them (because x x x cannot attain two different values simultaneously). Always complete the square as ( x + b ) 2 + ( c − b 2 ) (x + b)^2 + (c - b^2) ( x + b ) 2 + ( c − b 2 ) first, then shift and square the interval for x x x .

  • Absolute Value ( Mutlak Değer ): Equations, Inequalities & Extrema
  • 1. Piecewise Sign-Peeling ( Mutlak Değerden Çıkarma )

To remove absolute value bars from ∣ E ∣ \lvert E \rvert ∣ E ∣ , determine the sign of the interior expression E E E : ∣ E ∣ = { E , E ≥ 0 − E , E < 0 \lvert E \rvert = \begin{cases} E, & E \ge 0 \\ -E, & E < 0 \end{cases} ∣ E ∣ = { E , − E , ​ E ≥ 0 E < 0 ​

For example, if a < 0 < b a < 0 < b a < 0 < b , then a − b < 0 ⟹ ∣ a − b ∣ = − ( a − b ) = b − a a - b < 0 \implies \lvert a - b \rvert = -(a - b) = b - a a − b < 0 ⟹ ∣ a − b ∣ = − ( a − b ) = b − a , while b − a > 0 ⟹ ∣ b − a ∣ = b − a b - a > 0 \implies \lvert b - a \rvert = b - a b − a > 0 ⟹ ∣ b − a ∣ = b − a . Also use scaling and symmetry: ∣ − x ∣ = ∣ x ∣ \lvert -x \rvert = \lvert x \rvert ∣ − x ∣ = ∣ x ∣ , ∣ a − b ∣ = ∣ b − a ∣ \lvert a - b \rvert = \lvert b - a \rvert ∣ a − b ∣ = ∣ b − a ∣ , and ∣ k x − k a ∣ = ∣ k ∣ ⋅ ∣ x − a ∣ \lvert k x - k a \rvert = \lvert k \rvert \cdot \lvert x - a \rvert ∣ k x − ka ∣ = ∣ k ∣ ⋅ ∣ x − a ∣ .

2. Absolute Value Equations & The Extraneous Root Trap

Constant Right Side ( ∣ f ( x ) ∣ = c \lvert f(x) \rvert = c ∣ f ( x )∣ = c with c > 0 c > 0 c > 0 ): Splits into f ( x ) = c f(x) = c f ( x ) = c or f ( x ) = − c f(x) = -c f ( x ) = − c .

Two Absolute Values ( ∣ f ( x ) ∣ = ∣ g ( x ) ∣ \lvert f(x) \rvert = \lvert g(x) \rvert ∣ f ( x )∣ = ∣ g ( x )∣ ): Splits 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 ) .

Variable Right Side ( ∣ f ( x ) ∣ = g ( x ) \lvert f(x) \rvert = g(x) ∣ f ( x )∣ = g ( x ) ) — Extraneous Root Trap: Because ∣ f ( x ) ∣ ≥ 0 \lvert f(x) \rvert \ge 0 ∣ f ( x )∣ ≥ 0 , any valid root must satisfy g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0 . Solve both f ( x ) = g ( x ) f(x) = g(x) f ( x ) = g ( x ) and f ( x ) = − g ( x ) f(x) = -g(x) f ( x ) = − g ( x ) , then substitute each root back into g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0 and discard any root where g ( x ) < 0 g(x) < 0 g ( x ) < 0 !

3. Absolute Value Inequalities & Triangle Inequality Extrema

Upper Bound ( ∣ f ( x ) ∣ ≤ k \lvert f(x) \rvert \le k ∣ f ( x )∣ ≤ k for k ≥ 0 k \ge 0 k ≥ 0 ): Equivalent to the single sandwich interval − k ≤ f ( x ) ≤ k -k \le f(x) \le k − k ≤ f ( x ) ≤ k .

Lower Bound ( ∣ f ( x ) ∣ ≥ k \lvert f(x) \rvert \ge k ∣ f ( x )∣ ≥ k ): Equivalent to the two-ray union f ( x ) ≥ k f(x) \ge k f ( x ) ≥ k or f ( x ) ≤ − k f(x) \le -k f ( x ) ≤ − k .

Sum & Difference Extrema of Two Absolute Values ( a ≠ b a \ne b a  = b ):

Sum S ( x ) = ∣ x − a ∣ + ∣ x − b ∣ S(x) = \lvert x - a \rvert + \lvert x - b \rvert S ( x ) = ∣ x − a ∣ + ∣ x − b ∣ : Measures the sum of distances from x x x to a a a and b b b . Its minimum value is ∣ a − b ∣ \lvert a - b \rvert ∣ a − b ∣ , attained for every x x x between a a a and b b b . (It has no maximum on R \mathbb{R} R .)

Difference D ( x ) = ∣ x − a ∣ − ∣ x − b ∣ D(x) = \lvert x - a \rvert - \lvert x - b \rvert D ( x ) = ∣ x − a ∣ − ∣ x − b ∣ : Satisfies − ∣ a − b ∣ ≤ ∣ x − a ∣ − ∣ x − b ∣ ≤ ∣ a − b ∣ -\lvert a - b \rvert \le \lvert x - a \rvert - \lvert x - b \rvert \le \lvert a - b \rvert − ∣ a − b ∣ ≤ ∣ x − a ∣ − ∣ x − b ∣ ≤ ∣ a − b ∣ . Thus its maximum value is + ∣ a − b ∣ +\lvert a - b \rvert + ∣ a − b ∣ and its minimum value is − ∣ a − b ∣ -\lvert a - b \rvert − ∣ a − b ∣ .

Summary Table of Systems, Inequalities & Absolute Value Rules

Topic / Expression Rule / Equivalent Condition Key Exam Trap

2 × 2 2 \times 2 2 × 2 Parallel vs. Coincident a 1 a 2 = b 1 b 2 ≠ c 1 c 2 \frac{a_1}{a_2} = \frac{b_1}{b_2} \ne \frac{c_1}{c_2} a 2 ​ a 1 ​ ​ = b 2 ​ b 1 ​ ​  = c 2 ​ c 1 ​ ​ ( ∅ \varnothing ∅ ) vs. = c 1 c 2 = \frac{c_1}{c_2} = c 2 ​ c 1 ​ ​ ( ∞ \infty ∞ ) Always verify the third ratio c 1 c 2 \frac{c_1}{c_2} c 2 ​ c 1 ​ ​ before declaring ∅ \varnothing ∅ .

Power Inequality x 2 < x x^2 < x x 2 < x 0 < x < 1 0 < x < 1 0 < x < 1 Never leave x x x unbounded; immediately use x ∈ ( 0 , 1 ) x \in (0, 1) x ∈ ( 0 , 1 ) .

Zero-Crossing Square − a < x < b ⟹ 0 ≤ x 2 < max ⁡ ( a 2 , b 2 ) -a < x < b \implies 0 \le x^2 < \max(a^2, b^2) − a < x < b ⟹ 0 ≤ x 2 < max ( a 2 , b 2 ) Lower bound is 0 0 0 (with ≤ \le ≤ ), never min ⁡ ( a 2 , b 2 ) \min(a^2, b^2) min ( a 2 , b 2 ) .

Equation ∣ f ( x ) ∣ = g ( x ) \lvert f(x) \rvert = g(x) ∣ f ( x )∣ = g ( x ) f ( x ) = ± g ( x ) f(x) = \pm g(x) f ( x ) = ± g ( x ) and g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0 Candidate roots that make g ( x ) < 0 g(x) < 0 g ( x ) < 0 are extraneous.

Distance Sum / Diff Extrema min ⁡ ( ∣ x − a ∣ + ∣ x − b ∣ ) = ∣ a − b ∣ \min(\lvert x - a \rvert + \lvert x - b \rvert) = \lvert a - b \rvert min (∣ x − a ∣ + ∣ x − b ∣) = ∣ a − b ∣ ; max ⁡ ( ∣ x − a ∣ − ∣ x − b ∣ ) = ∣ a − b ∣ \max(\lvert x - a \rvert - \lvert x - b \rvert) = \lvert a - b \rvert max (∣ x − a ∣ − ∣ x − b ∣) = ∣ a − b ∣ Factor out common coefficients ∣ k x − c ∣ = ∣ k ∣ ∣ x − c / k ∣ \lvert kx - c \rvert = \lvert k \rvert \lvert x - c/k \rvert ∣ k x − c ∣ = ∣ k ∣ ∣ x − c / k ∣ first.

  • Worked Examples
  • Worked Example 1: Quadratic Range Over a Zero-Crossing Real Interval

Problem: Given that x ∈ R x \in \mathbb{R} x ∈ R and − 2 < x ≤ 4 -2 < x \le 4 − 2 < x ≤ 4 , find the interval of all possible values of A = x 2 − 2 x + 3 A = x^2 - 2x + 3 A = x 2 − 2 x + 3 .

Solution:

Because x ∈ R x \in \mathbb{R} x ∈ R appears in both x 2 x^2 x 2 and − 2 x -2x − 2 x , complete the square first: A = ( x 2 − 2 x + 1 ) + 2 = ( x − 1 ) 2 + 2 A = (x^2 - 2x + 1) + 2 = (x - 1)^2 + 2 A = ( x 2 − 2 x + 1 ) + 2 = ( x − 1 ) 2 + 2

Shift the given interval − 2 < x ≤ 4 -2 < x \le 4 − 2 < x ≤ 4 by subtracting 1 1 1 : − 3 < x − 1 ≤ 3 -3 < x - 1 \le 3 − 3 < x − 1 ≤ 3

Since ( − 3 , 3 ] (-3, 3] ( − 3 , 3 ] crosses 0 0 0 , squaring sets the minimum to 0 2 = 0 0^2 = 0 0 2 = 0 and the maximum to 3 2 = 9 3^2 = 9 3 2 = 9 (included because x − 1 = 3 x - 1 = 3 x − 1 = 3 is included): 0 ≤ ( x − 1 ) 2 ≤ 9 → + 2 2 ≤ ( x − 1 ) 2 + 2 ≤ 11 0 \le (x - 1)^2 \le 9 \xrightarrow{+2} 2 \le (x - 1)^2 + 2 \le 11 0 ≤ ( x − 1 ) 2 ≤ 9 + 2 ​ 2 ≤ ( x − 1 ) 2 + 2 ≤ 11

Thus A A A lies in the closed interval [ 2 , 11 ] [2, 11] [ 2 , 11 ] .

Worked Example 2: Filtering Extraneous Roots in ∣ f ( x ) ∣ = g ( x ) \lvert f(x) \rvert = g(x) ∣ f ( x )∣ = g ( x )

Problem: Find the real solution set of ∣ 2 x − 3 ∣ = x + 3 \lvert 2x - 3 \rvert = x + 3 ∣ 2 x − 3 ∣ = x + 3 .

Solution:

Impose the non-negativity condition on the right side: x + 3 ≥ 0 ⟹ x ≥ − 3 x + 3 \ge 0 \implies x \ge -3 x + 3 ≥ 0 ⟹ x ≥ − 3 .

Solve both linear branches:

Branch 1: 2 x − 3 = x + 3 ⟹ x = 6 2x - 3 = x + 3 \implies x = 6 2 x − 3 = x + 3 ⟹ x = 6 (satisfies 6 ≥ − 3 6 \ge -3 6 ≥ − 3 , valid).

Branch 2: 2 x − 3 = − ( x + 3 ) = − x − 3 ⟹ 3 x = 0 ⟹ x = 0 2x - 3 = -(x + 3) = -x - 3 \implies 3x = 0 \implies x = 0 2 x − 3 = − ( x + 3 ) = − x − 3 ⟹ 3 x = 0 ⟹ x = 0 (satisfies 0 ≥ − 3 0 \ge -3 0 ≥ − 3 , valid).

Both roots pass the right-hand sign check, so the solution set is C \c K = { 0 , 6 } ÇK = \{0, 6\} C \c ​ K = { 0 , 6 } . (By contrast, if the right side had been x − 6 x - 6 x − 6 , requiring x ≥ 6 x \ge 6 x ≥ 6 , the candidate roots x = − 3 x = -3 x = − 3 and x = 3 x = 3 x = 3 would both fail x ≥ 6 x \ge 6 x ≥ 6 , leaving C \c K = ∅ ÇK = \varnothing C \c ​ K = ∅ !)

Linear Systems Without Division by Zero

The displayed ratio tests assume their denominators are nonzero and each equation defines a line. A safer general method is elimination. Compute D = a 1 b 2 − a 2 b 1 D=a_1b_2-a_2b_1 D = a 1 ​ b 2 ​ − a 2 ​ b 1 ​ . If D ≠ 0 D\ne0 D  = 0 , there is one solution. If D = 0 D=0 D = 0 , compare proportional coefficient rows and constants: a proportional full row gives the same equation, while mismatched constants give a contradiction. Treat rows such as 0 x + 0 y = 0 0x+0y=0 0 x + 0 y = 0 as unrestricted and 0 x + 0 y = c 0x+0y=c 0 x + 0 y = c with c ≠ 0 c\ne0 c  = 0 as impossible. This also handles horizontal and vertical lines.

Piecewise Absolute-Value Equations Can Have Intervals of Answers

Consider ∣ x − 1 ∣ + ∣ x − 5 ∣ = 8 |x-1|+|x-5|=8 ∣ x − 1∣ + ∣ x − 5∣ = 8 . The sign-change points are 1 and 5, so divide the number line into three regions before removing the absolute-value bars. For x < 1 x<1 x < 1 , the left side is ( 1 − x ) + ( 5 − x ) = 6 − 2 x (1-x)+(5-x)=6-2x ( 1 − x ) + ( 5 − x ) = 6 − 2 x , which equals 8 at x = − 1 x=-1 x = − 1 . This candidate belongs to the region and is valid. Between 1 and 5, the expression is ( x − 1 ) + ( 5 − x ) = 4 (x-1)+(5-x)=4 ( x − 1 ) + ( 5 − x ) = 4 , so no point in that interval solves the equation with right side 8. For x > 5 x>5 x > 5 , it is ( x − 1 ) + ( x − 5 ) = 2 x − 6 (x-1)+(x-5)=2x-6 ( x − 1 ) + ( x − 5 ) = 2 x − 6 , giving the valid solution x = 7 x=7 x = 7 . Substitution confirms both values.

Change the right side to 4 and the solution changes qualitatively: every real number in the closed interval [ 1 , 5 ] [1,5] [ 1 , 5 ] works, including the endpoints. If the problem instead restricts x x x to integers, there are five solutions: 1, 2, 3, 4 and 5. Thus an absolute-value equation need not have only one or two isolated roots. Always retain the domain and test the boundary points rather than relying on the apparent shape of an equation.

Review the Method

By the triangle inequality, the minimum of ∣ x − a ∣ + ∣ x − b ∣ \lvert x - a \rvert + \lvert x - b \rvert ∣ x − a ∣ + ∣ x − b ∣ is ∣ a − b ∣ \lvert a - b \rvert ∣ a − b ∣ , and the extrema of ∣ x − a ∣ − ∣ x − b ∣ \lvert x - a \rvert - \lvert x - b \rvert ∣ x − a ∣ − ∣ x − b ∣ are ± ∣ a − b ∣ \pm \lvert a - b \rvert ± ∣ a − b ∣ .

Loading diagram... TR-YÖS Decision Protocol for Inequality & Quadratic Range Questions