Pair of Linear Equations

A pair of linear equations in two variables is a system of two equations of the form $a_{1} x + b_{1} y + c_{1} = 0$ and $a_{2} x + b_{2} y + c_{2} = 0$ , whose common solution is the point (or points) satisfying both simultaneously. Key result: geometrically each equation is a straight line, so the system has exactly one solution (intersecting lines), no solution (parallel lines), or infinitely many solutions (coincident lines), determined entirely by the ratios of coefficients. Where it applies: mixture problems, geometry, economics, age/cost word problems. Who/when: rooted in ancient Babylonian and Chinese algebra (200 BCE), formalised by Cramer, Gauss, and others in the 18th–19th centuries.

A pair of linear equations in two variables $x$ and $y$ consists of two first-degree equations that must be satisfied at the same time. Each equation, when plotted, is a straight line in the Cartesian plane, so solving the pair means finding the point(s) common to both lines. This topic matters because it is the first system of equations a student meets, and it introduces the central idea that algebraic conditions correspond to geometric configurations — a theme that recurs throughout mathematics. A surprising fact is that you can predict exactly how many solutions a system has, without solving it at all, just by comparing three simple ratios $\frac{a _{1}}{a _{2}}$ , $\frac{b _{1}}{b _{2}}$ , $\frac{c _{1}}{c _{2}}$ . This single criterion unifies algebra and geometry in a way that feels almost magical the first time it is understood.

The Core Insight

Two straight lines in a plane can relate in only three ways: they cross at one point, they never meet (parallel), or they lie exactly on top of each other (coincident). Solving a pair of linear equations is nothing more than identifying which of these three cases occurs and locating the common point(s). The entire theory — substitution, elimination, graphing, determinants — is just different machinery for answering this one geometric question.

Formal Statement

Pair of Linear Equations in Two Variables

A pair (or system) of linear equations in two variables $x$ and $y$ is written as

a_{1} x + b_{1} y + c_{1} = 0

⟳This is the general form of any straight line; "linear" means each variable appears to the first power only, with no products like

x y

a_{2} x + b_{2} y + c_{2} = 0

⟳A second independent line constraint; together [1] and [2] form the system.

where $a_{1}, b_{1}, c_{1}, a_{2}, b_{2}, c_{2}$ are real numbers, with $a_{1}, b_{1}$ not both zero and $a_{2}, b_{2}$ not both zero. A solution is an ordered pair $(x_{0}, y_{0})$ that makes both equations true simultaneously. The symbols mean:

$x, y$ — the unknown variables we wish to find,
$a_{1}, a_{2}$ — coefficients of $x$ ,
$b_{1}, b_{2}$ — coefficients of $y$ ,
$c_{1}, c_{2}$ — constant terms.

Consistency and the Coefficient-Ratio Criterion

Given the system [1]–[2] with $a_{2}, b_{2}, c_{2} \neq = 0$ , exactly one of the following holds:

\frac{a _{1}}{a _{2}} \neq = \frac{b _{1}}{b _{2}} ⟹ unique solution (lines intersect)

⟳Different slope ratios force the lines to have different directions, so they must cross at exactly one point.

\frac{a _{1}}{a _{2}} = \frac{b _{1}}{b _{2}} \neq = \frac{c _{1}}{c _{2}} ⟹ no solution (lines parallel)

⟳Equal coefficient ratios mean equal slopes; unequal constant ratio means different intercepts — parallel, never meeting.

\frac{a _{1}}{a _{2}} = \frac{b _{1}}{b _{2}} = \frac{c _{1}}{c _{2}} ⟹ infinitely many solutions (lines coincident)

⟳All three ratios equal means equation [2] is just a scalar multiple of [1] — the same line written twice.

A system with at least one solution is consistent; with no solution it is inconsistent. A consistent system with a unique solution is independent; with infinitely many it is dependent.

Why It Holds / Derivation

Elimination Yields the Solution and Reveals the Cases

We solve the general system [1]–[2] by elimination.

Step 1. Multiply [1] by

b_{2}

and [2] by

b_{1}

a_{1} b_{2} x + b_{1} b_{2} y + c_{1} b_{2} = 0, a_{2} b_{1} x + b_{1} b_{2} y + c_{2} b_{1} = 0

⟳Scaling each equation makes the

y

-coefficients identical (

b_{1} b_{2}

), preparing them for subtraction.

Step 2. Subtract the second from the first to eliminate

y

(a_{1} b_{2} - a_{2} b_{1}) x + (c_{1} b_{2} - c_{2} b_{1}) = 0

⟳The

b_{1} b_{2} y

terms cancel, leaving a single equation in

x

Step 3. Solve for

x

, provided

a_{1} b_{2} - a_{2} b_{1} \neq = 0

x = \frac{c _{2} b _{1} - c _{1} b _{2}}{a _{1} b _{2} - a _{2} b _{1}}, y = \frac{c _{1} a _{2} - c _{2} a _{1}}{a _{1} b _{2} - a _{2} b _{1}}

⟳Rearrange [7] for

x

; repeat the elimination on

x

to obtain

y

symmetrically — this is Cramer's Rule in disguise.

Step 4 (case analysis). The quantity

D = a_{1} b_{2} - a_{2} b_{1}

governs everything:

If $D \neq = 0$ , formulas [8] give a single $(x, y)$ — the unique solution, equivalent to condition [3].
If $D = 0$ but the numerators are nonzero, [7] becomes $(nonzero) = 0$ , a contradiction — no solution, condition [4].
If $D = 0$ and the numerators also vanish, [7] becomes $0 = 0$ , an identity — infinitely many solutions, condition [5].

This completes the proof, tying the algebraic determinant $D$ to the three geometric cases. $■$

Gabriel Cramer | 1704–1752

The Swiss mathematician Gabriel Cramer published, in his 1750 Introduction à l'analyse des lignes courbes algébriques, the rule that now bears his name. Cramer's Rule expresses the solution of a linear system as ratios of determinants — precisely formulas [8] above. Though Cramer worked with curves rather than pure linear algebra, his determinant-based method became the standard textbook approach to solving small systems and laid groundwork for the broader theory of matrices and determinants developed later by Cayley and Sylvester.

Building Intuition

Imagine each equation as a constraint — a rule that pins down a relationship between $x$ and $y$ . One equation alone leaves infinitely many possibilities (a whole line of points). The job of the second equation is to narrow those possibilities. If the second line genuinely points in a different direction, it slices through the first at exactly one spot — your answer. If it points in the same direction but sits elsewhere, the two constraints contradict each other and no point can satisfy both. If the second line is secretly the first one in disguise (just scaled up), it adds no new information at all, and every point on the line works. The three ratios $\frac{a _{1}}{a _{2}}, \frac{b _{1}}{b _{2}}, \frac{c _{1}}{c _{2}}$ are simply a quick way of asking: are these lines tilted the same way? And if so, are they in the same place?

The three configurations of a pair of linear equations

Worked Examples

Unique Solution by Elimination

Given: Solve

2 x + 3 y = 13 and 4 x - y = 5.

Step 1 — Check the case. Here

\frac{a _{1}}{a _{2}} = \frac{2}{4} = \frac{1}{2}

and

\frac{b _{1}}{b _{2}} = \frac{3}{- 1} = - 3

. Since

\frac{1}{2} \neq = - 3

, by [3] there is a unique solution. Step 2 — Eliminate $y$ . Multiply the second equation by 3:

12 x - 3 y = 15

. Add to the first:

2 x + 3 y + 12 x - 3 y = 13 + 15 \Rightarrow 14 x = 28 \Rightarrow x = 2.

Step 3 — Back-substitute. From

4 x - y = 5

4 (2) - y = 5 \Rightarrow y = 3.

Step 4 — Verify.

2 (2) + 3 (3) = 4 + 9 = 13

✓ and

4 (2) - 3 = 5

✓.

x = 2, y = 3

A Mixture Word Problem

Given: A shopkeeper sells 5 pens and 3 notebooks for ₹120, and 2 pens and 4 notebooks for ₹100. Find the price of one pen (

p

) and one notebook (

n

). Step 1 — Set up equations.

5 p + 3 n = 120, 2 p + 4 n = 100.

Step 2 — Eliminate $p$ . Multiply the first by 2 and the second by 5:

10 p + 6 n = 240, 10 p + 20 n = 500.

Subtract:

14 n = 260 \Rightarrow n = \frac{260}{14} = \frac{130}{7} \approx 18.57.

Let us instead use cleaner numbers: solve directly. Subtracting gives $14 n = 260$ , so $n = 18.57$ . Back-substitute into $2 p + 4 n = 100$ :

2 p + 4 (18.57) = 100 \Rightarrow 2 p = 100 - 74.29 = 25.71 \Rightarrow p = 12.86.

Step 3 — Verify.

5 (12.86) + 3 (18.57) = 64.3 + 55.7 = 120

✓.

p \approx ₹12.86 per pen, n \approx ₹18.57 per notebook

Common Misconceptions

"More equations always means a solution exists." False. Two equations may contradict each other (parallel lines, case [4]), giving no solution despite having "enough" equations. Conversely, two equations may be redundant (coincident lines, case [5]), giving infinitely many. Counting equations is not the same as counting independent constraints. Always check the ratios first. "You can divide by a coefficient without checking it is nonzero." When applying [3]–[5], if some coefficient like

a_{2}

c_{2}

equals zero, the ratio criterion needs careful handling — return to elimination via the determinant

D = a_{1} b_{2} - a_{2} b_{1}

, which is always valid.

Consider the apparently reasonable pair

3 x + 2 y = 6 and 6 x + 4 y = 7.

A student might expect a unique answer. But

\frac{a _{1}}{a _{2}} = \frac{3}{6} = \frac{1}{2}

\frac{b _{1}}{b _{2}} = \frac{2}{4} = \frac{1}{2}

, yet

\frac{c _{1}}{c _{2}} = \frac{6}{7} \neq = \frac{1}{2}

. By criterion [4] the lines are parallel — there is no solution at all. Elimination confirms it: doubling the first gives

6 x + 4 y = 12

, contradicting

6 x + 4 y = 7

. The system is inconsistent.

Connections

A pair of linear equations is the two-variable case of the general theory of Systems of Linear Equations, which extends to any number of variables and is handled by Matrices and Determinants and Gaussian Elimination. The determinant $D$ in formula [8] is precisely the $2 \times 2$ determinant studied in Cramer's Rule. Geometrically the subject belongs to Coordinate Geometry, since each equation is a line analysed via slope and intercept; the slope condition for parallelism links directly to Equation of a Straight Line. When inequalities replace equalities, the topic generalises to Linear Programming, the foundation of optimisation.

Real-World Applications

Economics — supply and demand equilibrium. Setting a supply line equal to a demand line is solving a pair of linear equations; the intersection gives the market-clearing price and quantity.
Chemistry — mixture and concentration problems. Determining how to combine two solutions of known concentration to reach a target uses a two-equation system in the unknown volumes.
Navigation and GPS triangulation. Position estimates from two linear distance constraints reduce to intersecting lines.
Engineering — electrical circuits. Applying Kirchhoff's voltage and current laws to a simple two-loop circuit yields a pair of linear equations in the loop currents.
Business — break-even analysis. The break-even point is where a cost line meets a revenue line — a unique-solution case.
Diet and nutrition planning. Meeting two nutrient requirements from two foods is a linear pair in the food quantities.
Geometry and computer graphics. Finding where two line segments intersect on screen is solved by [1]–[2] thousands of times per frame in rendering and collision detection.

Historical Development

c. 1800 BCE — Babylonia. Clay tablets show solutions to simultaneous linear (and quadratic) problems using rhetorical, word-based methods.
c. 200 BCE — China. The Nine Chapters on the Mathematical Art presents the fangcheng method, an array-based elimination essentially identical to modern Gaussian elimination, for solving simultaneous linear equations.
3rd century CE — Diophantus of Alexandria develops symbolic techniques for indeterminate and determinate equations in his Arithmetica.
9th century CE — al-Khwārizmī systematises algebra (al-jabr), giving general procedures that underlie linear equation solving.
1545 — Gerolamo Cardano and Renaissance algebraists advance symbolic manipulation, enabling cleaner treatment of systems.
1683 — Seki Takakazu (Japan) and 1693 — Gottfried Leibniz (Europe) independently introduce determinants for solving linear systems.
1750 — Gabriel Cramer publishes Cramer's Rule, expressing solutions as determinant ratios (formulas [8]).
1809 — Carl Friedrich Gauss formalises systematic elimination while computing the orbit of Ceres, giving "Gaussian elimination" its name.
1850s — Cayley and Sylvester create matrix theory, embedding the humble pair of equations within a vast general framework.

Subtleties & Limits

The two-variable case is completely understood, but it opens onto deeper questions. Numerical conditioning: when the determinant $D$ is very small but nonzero (lines almost parallel), tiny measurement errors in the coefficients produce wildly different solutions — a phenomenon of ill-conditioning that dominates real-world computational linear algebra. Higher dimensions: with $n$ variables and $m$ equations, the geometry becomes intersections of hyperplanes, and questions of existence and uniqueness require the rank of matrices; deciding solvability efficiently for huge sparse systems remains an active engineering challenge. Integer constraints: if $x$ and $y$ must be whole numbers, the problem becomes a Diophantine system, and its higher-dimensional generalisation (integer linear programming) is NP-hard — among the hardest computational problems known. Thus a topic that looks "finished" at high school becomes, with small twists, a frontier of computational mathematics.