Many problems in science, business, and engineering boil down to a simple challenge: finding a set of unknown values that satisfy several conditions at once. Each condition can often be written as a linear equation, and when you have more than one, you have a system of linear equations.

A solution to a system is a specific set of values for the variables that makes every single equation in the system true. For example, consider this system:

$x + y = 3$ $2x - y = 0$

The solution is $x=1$ and $y=2$. If you plug these values in, both equations hold true. $1 + 2 = 3$, and $2(1) - 2 = 0$. Finding this solution is our goal.

When systems get bigger, with more equations and variables, we need a reliable strategy. The most common one is called Gaussian elimination. The idea is to transform the system into an equivalent, simpler one that's easy to solve, without changing the actual solution.

We do this using three basic moves, called elementary row operations:

1. Swap any two equations.
2. Multiply an entire equation by any non-zero number.
3. Add a multiple of one equation to another one.

Let's use these moves on a system with three variables.

Our goal is to eliminate the $x$ term from the second and third equations. First, we'll add -2 times the first equation to the second equation.

Next, we add -3 times the first equation to the third equation to eliminate the other $x$ term.

Now we focus on the smaller 2x2 system that's left. We want to eliminate the $y$ term from the last equation. This is trickier. Let's multiply the second equation by 7 and the third by -5 to make the $y$ coefficients match and cancel.

Now, add the new second equation to the new third equation.

This system looks much easier to solve! From the last equation, we can see that $-11z = -26$, so $z = 26/11$. Now we can work backward, a process called back-substitution. Plug $z = 26/11$ into the second equation to find $y$, and then plug both $y$ and $z$ into the first equation to find $x$. This step-by-step elimination and substitution process is the essence of Gaussian elimination.

Not every system has a nice, single solution. When you perform Gaussian elimination, the final form of the system tells you what kind of solution set to expect. There are only three possibilities.

1. A Unique Solution

This is what we saw above. The process leads to a specific value for each variable. Geometrically, this means the lines (or planes, in 3D) all intersect at a single point. A system with one or more solutions is called a consistent system.

2. Infinite Solutions

Sometimes, during elimination, an entire equation vanishes, turning into $0 = 0$. This is a true statement, but it gives us no information. It means one of our original equations was redundant—it was just a combination of the others.

When this happens, you don't have enough information to pin down a single solution. The system has infinite solutions. This is also a consistent system.

3. No Solution

The third possibility occurs when elimination leads to a contradiction, like $0 = 5$. This is clearly false. If you reach a nonsensical equation like this, it means the system has no solution. The original equations contradict each other. Such a system is called inconsistent.

Gaussian elimination is a powerful and systematic way to reveal the true nature of any system of linear equations, telling you whether there is one solution, many, or none at all.

Understanding these methods is the first major step into the world of linear algebra.