Berikut adalah posting blog tentang menyelesaikan sistem persamaan linear dengan solusi tak hingga banyaknya:
Solving Systems of Linear Equations with Infinitely Many Solutions
Many students find solving systems of linear equations challenging, and for good reason. There's a lot to keep track of! But the core concept is straightforward: you're finding values for variables that simultaneously satisfy all equations in the system. This post focuses on a specific type of solution: systems with infinitely many solutions.
Understanding Infinitely Many Solutions
Unlike systems with a unique solution (one specific answer for each variable) or no solution (the equations are contradictory), a system with infinitely many solutions means there's a range of values that work. This typically happens when the equations are dependent. What does that mean? It means one equation can be obtained by multiplying another equation by a constant. Geometrically, this translates to lines (in a two-variable system) or planes (in a three-variable system) that overlap completely.
Identifying Dependent Equations
The key to solving systems with infinitely many solutions is identifying the dependent equations. Let's look at an example:
System 1:
- x + y = 5
- 2x + 2y = 10
Notice that the second equation is simply the first equation multiplied by 2. These equations are dependent. Graphically, they represent the same line. Any point on that line (x, y) is a solution.
System 2 (slightly more complex):
- x + y + z = 6
- 2x + 2y + 2z = 12
- x - y = 2
Again, the second equation is a multiple of the first. This shows dependence between the first two equations.
Solving Systems with Infinitely Many Solutions using Row Reduction (Gaussian Elimination)
A robust method for solving any system of linear equations, including those with infinitely many solutions, is row reduction (also known as Gaussian elimination). This method uses matrix operations to systematically simplify the system. Let's walk through System 2:
-
Write the augmented matrix:
[ 1 1 1 | 6 ] [ 2 2 2 | 12] [ 1 -1 0 | 2 ]
-
Perform row operations: The goal is to get the matrix into row-echelon form (or reduced row-echelon form). This involves elementary row operations: swapping rows, multiplying a row by a nonzero constant, and adding a multiple of one row to another.
For example, we can subtract twice the first row from the second row to eliminate the 'x' variable in the second row:
[ 1 1 1 | 6 ] [ 0 0 0 | 0 ] <-- Second row is now all zeros [ 1 -1 0 | 2 ]
Next, subtract the first row from the third row:
[ 1 1 1 | 6 ] [ 0 0 0 | 0 ] [ 0 -2 -1 | -4 ]
Finally, swap the second and third rows, and perform row operations to get to row-echelon form. This process will lead to a row of zeros, indicating infinitely many solutions.
-
Express the solution: From the row-echelon form, you'll have one or more free variables (variables without a leading 1). Express the dependent variables in terms of the free variables. This provides the general solution, representing the infinite set of solutions.
Example using System 2 (Continued):
After completing row reduction (the steps above are simplified for brevity), you will end up with a row-echelon matrix that implies:
x - 2y = -4, which translates to x = 2y -4
y is a free variable; z is a free variable.
The solution is expressed as: x = 2y - 4; y = y; z = z;
This shows that for any value of 'y' and 'z', you can calculate a corresponding value of 'x' that satisfies the original system. Therefore, the system has infinitely many solutions.
Conclusion
Solving systems of linear equations with infinitely many solutions requires careful analysis and a systematic approach, such as row reduction. Identifying dependent equations and expressing the solution set in terms of free variables are crucial steps to mastering this concept. Remember to practice different examples to build your understanding and proficiency!