Gathering the Unknowns

Both sides of 5x + 2 = 3x + 10 hold x's, like two pans that both hold bags. You may remove the same amount from each pan — including the same number of bags. Take 3x from both sides: 2x + 2 = 10.

From there you know the road: subtract 2 to get 2x = 8, then divide by 2 to get x = 4. Check both sides: 5(4) + 2 makes 22, and 3(4) + 10 makes 22. The same number — which is exactly what a solution means.

The full method has three movements. First, simplify each side on its own: distribute any parentheses and combine like terms. Second, collect the variable terms with one balance move — subtracting the smaller variable term from both sides keeps the coefficient positive. Third, finish as the two-step equation it has become, and check in the original.

Sometimes the variable terms cancel entirely. Then the sentence left standing decides everything. If it is false — like 3 = 7 — no value of x could ever have worked: no solution. If it is true — like 3 = 3 — the equation never depended on x at all: every number is a solution.

An equation with x on both sides claims that two different recipes produce the same number, and solving asks: for which inputs? Collecting terms rewrites ax + b = cx + d as (a − c)x = d − b, and three cases fall out. If a ≠ c, exactly one solution. If a = c and b ≠ d, none. If a = c and b = d, every number.

The names are worth owning: an equation true for only some values is conditional, one true for all values is an identity, one true for none is a contradiction. When your x's vanish and leave 4 = 4, you have not failed — you have discovered the equation was an identity all along.

Two pans balance. Each pan holds bags — every bag hides the same number of blocks — and some loose blocks. Take one bag off each pan. It still balances.

Left pan: 2 bags and 1 block. Right pan: 1 bag and 4 blocks. Take one bag from each. Now one bag balances 3 blocks. Each bag holds 3.

The solution set of ax + b = cx + d over ℝ is empty, a single point, or all of ℝ — never anything else. The trichotomy is geometric: each side is a linear function, and their graphs are lines that cross once, run parallel, or coincide. Solving locates the intersection without drawing it.

Each balance move is an invertible transformation of the equation, which is why the solution set never changes as you work. Dividing by an expression that might be zero is precisely the non-invertible move — the classic way solutions get silently created or destroyed.

Over any field, a linear equation in one variable reduces to αx = β. Its solution set is a point when α ≠ 0, and when α = 0 it is empty or the whole line, according as β ≠ 0 or β = 0. The Algebra I trichotomy is rank–nullity accounting for the smallest possible linear system.

The working discipline — apply only equivalence transformations, invertible operations that preserve the solution set — is Gaussian elimination in one variable. Everything from here to numerical linear algebra scales that discipline up; nothing replaces it.