Question 161·200 Super-Hard SAT Math Questions·Algebra
Consider the system of inequalities below:
Which choice gives all possible values of for which the system has no solution?
Treat this as a linear-programming style question: the first inequalities create a polygonal feasible region, and the last inequality asks whether the linear expression can exceed . Find the maximum of by checking the vertices (intersections of boundary lines and axes), then use the strict sign to decide whether equality at the maximum still allows a solution.
Hints
Focus on what controls
The only place appears is in . Think about how large can get while still satisfying the other inequalities.
Use corner points
For a region defined by linear inequalities, a linear expression like reaches its maximum at a vertex (intersection of boundary lines).
Find an important intersection
One key vertex comes from solving the two equations and together.
Watch the strict sign
Because the inequality is (not ), be careful about what happens when equals the maximum value.
Desmos Guide
Graph the feasible region
Enter the first five inequalities:
-
x+y<=7 -
2x+y<=11 -
x+3y<=12 -
x>=0 -
y>=0
Desmos will shade the feasible region.
Identify the vertices
Graph the boundary lines as equalities (you can reuse the same expressions without the inequality signs). Click on intersection points that form the corners of the shaded region to read their coordinates (such as intersections with the axes and where two boundary lines cross).
Compute at each vertex
For each vertex you found, evaluate 3x+2y (you can type it into Desmos and substitute the vertex coordinates or create points and then compute 3*A.x+2*A.y, etc.). Find the greatest value among the vertices.
Connect the maximum to
Create a slider by typing k=. Then graph 3x+2y>k and adjust .
Observe the largest slider value where the shaded overlap still exists; because the inequality is strict (>), the system stops having solutions when reaches that maximum value or higher.
Step-by-step Explanation
Relate the parameter to a maximum
The first five inequalities define a feasible region in the -plane. To satisfy the last inequality , the value of must be less than some value that can actually attain in that region.
So, find the maximum of on the feasible region. If is at least that maximum, the system will have no solution.
Find the vertices (corner points) of the feasible region
Because is linear and the region is formed by linear inequalities, the maximum occurs at a vertex.
Relevant vertices come from intersections of boundary lines and the axes:
- From and : .
- From and : , so .
- The origin .
A key vertex comes from intersecting and :
Multiply the first equation by and subtract the second:
Then , giving the vertex .
(Each of these points satisfies , so they are feasible.)
Evaluate at each vertex
Compute :
- At : .
- At : .
- At : .
- At :
So the maximum value of on the feasible region is .
Use the strict inequality to decide when solutions are impossible
The system requires .
- If is at least the maximum value of on the feasible region, then cannot happen anywhere in the region, so there is no solution.
- If is less than that maximum value, then at least one feasible point has , so a solution exists.
State the condition on
Since the maximum of is , the system has no solution when .