A system of inequalities gives conditions that must hold at the same time. When a question asks for every possible -coordinate, graph both conditions in Desmos to see their overlap. Then find its upper limit exactly: for each , use the smallest the system allows. Watch whether a strict inequality excludes the boundary.
Hints
- Hint 1
The feasible region is the part of the graph shaded by both inequalities. Look toward its highest edge. Which boundaries meet there, and does the strict inequality allow points on that edge?
- Hint 2
The condition gives a lower bound on : for each , cannot be smaller than . Why does that smallest give the other inequality its best chance to hold?
- Hint 3
After choosing the smallest , solve the resulting one-variable inequality for . Check that every below the bound works with that choice of , not only that values above it fail.
Step-by-step
Graph the overlap, then find its exact upper edge
Step 1See where both conditions hold
Type and on separate Desmos lines. The overlap is shaded by both, and it narrows upward toward where their boundaries meet. The boundary for is dashed, so points on it do not count.
- Step 2
Find the smallest allowed x
Add to both sides of : . So, for any fixed , is the smallest allowed . This is a lower bound: may be larger, but it cannot be smaller.
- Step 3
Test whether that x can satisfy the other inequality
The term grows when grows. So if the smallest allowed fails , every larger fails too. For each , test the smallest allowed . Substitute : . Distribute: . Combine like terms: . Subtract : . If this holds, satisfies both inequalities; if it fails, no can.
- Step 4
State the possible y-coordinates
Divide by the positive , which keeps the inequality pointing the same way: . Every below this value works with . The upper edge does not count because is strict. So this describes all possible -coordinates. Choice D.