y = 2x + 1
y = -x + 4
System of Linear Equations: Two or more linear equations with the same variables. The solution is the point where the lines intersect.
- Convert each equation to slope-intercept form (y = mx + b)
- Plot the y-intercepts
- Use slopes to plot additional points
- Draw the lines
- Identify the intersection point
y = -x + 4
Line 1: y = 2x + 1 → y-intercept = 1, slope = 2
Line 2: y = -x + 4 → y-intercept = 4, slope = -1
Plot (0, 1) for first line and (0, 4) for second line
For y = 2x + 1: from (0, 1), move up 2, right 1 → (1, 3)
For y = -x + 4: from (0, 4), move down 1, right 1 → (1, 3)
Connect points for each line
Lines intersect at (1, 3)
The solution to the system is (1, 3). This means x = 1 and y = 3 satisfy both equations simultaneously.
• Slope-Intercept Form: y = mx + b, where m is slope and b is y-intercept
• Intersection Point: The solution to the system
• Verification: Substitute solution back into both equations
y ≤ 2x + 1
y > -x + 2
System of Linear Inequalities: Two or more linear inequalities with the same variables. The solution is the region where all conditions are satisfied.
y > -x + 2
y = 2x + 1 (solid line, ≤ means include boundary)
y = -x + 2 (dashed line, > means exclude boundary)
For y ≤ 2x + 1: shade below the line
For y > -x + 2: shade above the line
The solution is where both shaded regions overlap
Test (0, 3): 3 ≤ 2(0) + 1 → 3 ≤ 1 (False), try another point
Test (1, 2): 2 ≤ 2(1) + 1 → 2 ≤ 3 ✓, 2 > -1 + 2 → 2 > 1 ✓
The solution is the region where both inequalities are satisfied. This is the overlapping shaded area on the graph.
• Solid/Dashed Lines: ≤ or ≥ → solid, < or > → dashed
• Shading Direction: Test a point to determine correct side
• Feasible Region: Area satisfying all constraints
y = 3x - 2
y = 3x + 1
Special Cases: Systems can have one solution (intersecting lines), no solution (parallel lines), or infinitely many solutions (same line).
y = 3x + 1
Both equations have the same slope (m = 3) but different y-intercepts
Since slopes are equal but y-intercepts differ, lines are parallel
Line 1: y = 3x - 2, y-intercept = -2
Line 2: y = 3x + 1, y-intercept = 1
Parallel lines never intersect, so there is no solution
This system has no solution because the lines are parallel and never intersect.
• Parallel Lines: Same slope, different y-intercepts → no solution
• Same Line: Same slope and y-intercept → infinite solutions
• Intersecting Lines: Different slopes → one solution
Linear Equation: An equation of degree one, representing a straight line when graphed
Linear Inequality: An inequality of degree one, representing a half-plane when graphed
System of Equations: A set of equations with the same variables
System of Inequalities: A set of inequalities with the same variables
- For Equations: Graph each line and find intersection point(s)
- For Inequalities: Graph boundary lines and shade appropriate regions
- For Systems: Find region/points satisfying all conditions simultaneously
• Slope-Intercept: y = mx + b
• Standard Form: Ax + By = C
• Point-Slope: y - y₁ = m(x - x₁)
• Parallel Lines: Same slope, different y-intercept
• Perpendicular Lines: Slopes are negative reciprocals
Real-world constraints: Variables represent quantities that must satisfy practical limitations.
x ≥ 20
x ≥ 0, y ≥ 0
Let x = number of units of Product A, y = number of units of Product B
Production cost: 3x + 2y ≤ 100 (cannot exceed $100)
Minimum A: x ≥ 20 (must spend at least $60 on A, so at least 20 units)
Non-negativity: x ≥ 0, y ≥ 0
3x + 2y ≤ 100 → boundary line: 3x + 2y = 100
x ≥ 20 → vertical line: x = 20
x ≥ 0, y ≥ 0 → first quadrant
The region satisfying all constraints simultaneously
The feasible region is bounded by the constraints. Any point within this region represents a valid combination of products A and B that meets all requirements.
• Modeling: Translate word problems into mathematical constraints
• Linear Programming: Optimization within feasible regions
• Constraint Satisfaction: All conditions must be met simultaneously
2x + 4y = 8
x + 2y = 4
Dependent System: A system where both equations represent the same line, resulting in infinitely many solutions.
x + 2y = 4
First equation: 2x + 4y = 8 → divide by 2 → x + 2y = 4
Second equation: x + 2y = 4 (already simplified)
Both equations are identical: x + 2y = 4
Only one line exists since both equations represent the same line
Every point on the line is a solution, so there are infinitely many solutions
This system has infinitely many solutions because both equations represent the same line. Any point on the line x + 2y = 4 is a solution.
• Dependent System: Equations are multiples of each other
• Equivalent Equations: Represent the same geometric line
• Infinitely Many Solutions: Every point on the line satisfies both equations
Linear Equation: An equation that forms a straight line when graphed, typically in the form y = mx + b or Ax + By = C.
Linear Inequality: Similar to an equation but uses inequality symbols (≤, ≥, <, >), representing a half-plane.
System of Equations: A collection of equations with the same variables that must be satisfied simultaneously.
System of Inequalities: A collection of inequalities with the same variables defining a feasible region.
- For Systems of Equations: Graph each equation, find intersection point(s)
- For Systems of Inequalities: Graph boundary lines, shade appropriate regions, find overlap
- Verification: Always substitute solutions back into original equations
• Slope-Intercept: y = mx + b
• Standard Form: Ax + By = C
• Point-Slope: y - y₁ = m(x - x₁)
• Parallel Lines: Same slope, different y-intercept → no solution
• Perpendicular Lines: Slopes are negative reciprocals
Type A: Intersecting lines (one solution)
Type B: Parallel lines (no solution)
Type C: Same line (infinite solutions)
Analysis: Different system types produce different solution behaviors.
- Type A: Different slopes → One intersection point
- Type B: Same slope, different intercepts → No intersection
- Type C: Same slope and intercept → Infinite intersections