Linear inequalities
One and two variables, shaded regions, and the sign-flip that costs more points than anything else here.
~32 min · prequestion, worked examples, retrieval practice
An inequality is not an equation with a different symbol on it — it is a statement about which side of something you are on, and the only step in all of algebra that can silently reverse that statement is multiplying or dividing by a negative. Everything else on this topic follows from that one asymmetry: the flip rule in one variable, the shaded half-plane in two, and the overlap that defines a system. Get the direction wrong and every subsequent step is flawless work on a backwards claim.
Before you read on
Two or three questions on exactly what this lesson teaches. Being wrong here is fine — it's the fastest way to find out what to pay attention to next.
Before any teaching: which single step takes −2x < 6 to its correct solution?
A student begins graphing y ≥ 2x − 1 by drawing the line y = 2x − 1. What is left to decide, and how is it decided most reliably?
A point (x, y) satisfies the first inequality of a two-inequality system but not the second. Is it a solution to the system?
What the question is actually testing
This skill point covers linear inequalities in one and two variables: solving them, writing them from a described constraint, reading a solution set off a graph, and handling systems of them. The algebra is the same algebra as linear equations, with one extra rule and one extra kind of answer — a range or a region rather than a single number.
The Digital SAT asks it in four recognisable shapes. Solve-and-report: "which of the following gives all values of x." Translate: a scenario with a budget, a minimum, or a capacity, and four candidate inequalities or systems. Graph-read: an inequality or system with choices describing the boundary and the shading, or a set of candidate points. And the hard variant, which asks for the greatest or least value something can take inside a solution region.
College Board publishes the domain weight, not the skill weight: Algebra is about 35% of the scored Math questions — 13 to 15 of them — which makes it the largest domain on the section. How those split across the five Algebra skills is not published. The prep-industry figure of roughly one to three inequality questions per form is an inference from released material, not an official number; treat it as a rough prior rather than something to plan around.
One structural fact worth carrying into every item below: because the answer is a range or a region rather than a number, wrong answers on this topic are usually the right magnitude pointing the wrong way. That is a much harder error to notice than a wrong number, which is precisely why the test uses it.
Foundations — from zero (skip if this is already automatic)
If you can solve −3x + 7 < 1 without pausing over which way the symbol should end up, skip to the next block; nothing here will be new. If you can't, this is the block that matters most on the page, and it builds from nothing.
The four symbols, said out loud. x < 5 is "x is strictly less than 5" — 5 itself does not count. x ≤ 5 is "x is at most 5" — 5 does count. x > 5 is "strictly greater than." x ≥ 5 is "at least 5." The line under the symbol is the only thing that decides whether the endpoint is in or out, and on the SAT that single line is worth full marks or zero surprisingly often.
An inequality's answer is usually infinitely many numbers, not one. x > 3 names every number to the right of 3 on the number line: 3.001, 4, 900. On a number line you mark 3 with an open circle (not included) and shade to the right; for x ≥ 3 the circle is filled. Hold onto that open-versus-filled distinction — in two variables it becomes dashed versus solid, and it is the same idea both times.
Solving is the same procedure you already use on equations. Add or subtract anything from both sides. Multiply or divide both sides by any positive number. All of those steps leave the symbol exactly as it is, including when the number you add or subtract is itself negative — adding −7 to both sides never flips anything.
Exactly one step behaves differently: multiplying or dividing both sides by a negative number reverses the direction of the symbol. −2x < 6 becomes x > −3, not x < −3. Nothing else in the procedure has this property, and forgetting it is the single most common way this question type is missed.
The strong path avoids the rule instead of remembering it. Move the variable terms to whichever side keeps their coefficient positive, and you will never divide by a negative in the first place. Weak path: 4 − 3x > 10 → −3x > 6 → divide by −3 and remember to flip → x < −2. Strong path: 4 − 3x > 10 → 4 > 3x + 10 → −6 > 3x → −2 > x, which reads x < −2. Same answer, one fewer opportunity to be wrong. Use the strong path by default; know the rule for the times a question hands you the negative coefficient anyway.
The ten-second check that catches almost every direction error: take one number from inside your answer and one from outside, and substitute both into the original inequality. The inside number must satisfy it and the outside number must fail. For x < −2 above, test x = −3: 4 − 3(−3) = 13 > 10 ✓. Then test x = 0: 4 > 10 ✗. Both behaved correctly, so the direction is right.
Compound inequalities — a value trapped between two bounds, like −5 < 2x + 1 ≤ 9 — are solved by doing the same operation to all three parts at once: subtract 1 everywhere to get −6 < 2x ≤ 8, then divide by 2 everywhere to get −3 < x ≤ 4. If you ever divide all three parts by a negative, both symbols reverse and the two ends swap places.
Two variables: the answer is a region
y ≥ 2x − 1 has no single solution. It has a solution set: every ordered pair (x, y) that makes the statement true — (0, 0), (0, 5), (4, 100), infinitely many. Plotted, those points fill in a half of the plane, bounded by the line y = 2x − 1.
Drawing it is two decisions, taken separately. First, the boundary: replace the inequality symbol with = and graph that line. It is solid when the symbol is inclusive (≤ or ≥), because points on the line satisfy the statement, and dashed when the symbol is strict (< or >), because they don't. Second, the shading: which of the two sides is the solution set.
Settle the shading with a test point, never by staring at the symbol. Pick any point that is not on the boundary, substitute it into the original inequality, and see whether the statement comes out true. If it does, shade that point's side. If it doesn't, shade the other one. Use (0, 0) whenever the boundary doesn't pass through it — the arithmetic collapses to comparing 0 against a constant and there is nothing to slip on. If the line does run through the origin, pick something equally cheap, like (1, 0).
Mechanism: one test point is enough because a linear expression can only get from "less than" to "greater than" by passing through "equal to," and the set of points where it is equal to the constant is exactly the boundary line. Cross that line and the comparison flips; stay on one side and it never can. That is why the plane splits into precisely two regions, and why a single substitution settles an infinite set.
The reason the test point matters more than the symbol: the SAT frequently gives you the inequality in a form that is not solved for y, such as 4x − 2y > 10. Isolating y there means dividing by −2, which reverses the symbol to y < 2x − 5 — so a question with a > in it shades below. The symbol on the page is not the symbol that governs the picture until y is alone with a positive coefficient. A test point is immune to that entirely.
In Bluebook, the built-in Desmos calculator will shade a two-variable inequality, or an entire system, if you type it in. On "which point is in the solution set" and "which system is graphed" items that is a legitimate and often decisive move. It costs twenty to forty seconds of typing, so treat it as the tool for items you are unsure about rather than a default — and note that it offers no protection at all against answering a question about the wrong quantity, which is where most points on this topic are actually lost.
Systems, and the constraint language that produces them
A system of inequalities is a set of conditions that must all hold at once. Its solution set is the intersection of the individual regions — the overlap, and only the overlap. A point in the shaded area of one inequality and outside another is not a solution to anything.
The translation table earns more points on this topic than the algebra does. "At least" and "no less than" and "a minimum of" are ≥. "At most," "no more than," "cannot exceed," and "a maximum of" are ≤. "More than" and "fewer than" alone are strict, > and <. The two that get misread under time pressure are the double negatives: "no fewer than 12" means ≥ 12, and "not more than 12" means ≤ 12.
Building a system from a scenario is mechanical once you name the units. Each constraint is one sentence about one quantity: a total cost in dollars compared against a budget in dollars, a total number of people compared against a required headcount. Write each constraint separately, check that every term in it carries the same unit as the bound it is being compared to, and only then look at the choices.
On "which system is graphed here" items, run three independent checks per boundary: the line itself (slope and intercept), its style (solid or dashed), and which side is shaded. Answer choices in this family almost always agree on two of the three and differ on one. Find the axis they differ on before you start verifying anything, and one check eliminates two choices at once.
In real-world systems the quantities are often counts, which cannot be negative. Some items write x ≥ 0 and y ≥ 0 into the system explicitly and some leave it to context. If two answer choices differ only by including those constraints, the question is testing whether you noticed the quantities were counts.
Mechanism
Why the direction reverses, and when the step is illegal
An inequality is a claim about position on the number line: a < b says nothing more than "a sits to the left of b." Adding the same amount to both sides slides both numbers the same distance in the same direction, so their left-right order is untouched — which is exactly why adding and subtracting never flip anything, not even when the thing being added is negative. Multiplying both sides by a negative number does something categorically different: it reflects the whole number line through zero. Everything that was to the left of something is now to the right of it. 2 < 5, but multiply both by −1 and −2 > −5. Dividing by a negative is multiplying by a negative reciprocal, so it reflects too. The symbol reverses because the reflection reversed the order the symbol was describing — the flip is not a rule bolted onto the algebra, it is the algebra reporting what just happened. The same fact tells you when the step is not allowed at all: if you multiply or divide both sides by an expression whose sign you do not know, anything containing a variable, then you do not know whether you slid the line or reflected it, so you cannot know which symbol to write. That step is illegal rather than merely risky, and it is the failure mode that costs strong students this question type.
Worked examples
Fully worked — one variable, with the flip and the way around it
- 01Solve for x: 3(4 − 2x) ≥ 5x − 21.
- 02Distribute first, applying the 3 to both terms inside the parentheses: 12 − 6x ≥ 5x − 21.
- 03Strong path — move the variable to the side that keeps its coefficient positive. Add 6x to both sides: 12 ≥ 11x − 21.
- 04Add 21 to both sides: 33 ≥ 11x.
- 05Divide by 11. It is positive, so the symbol does not move: 3 ≥ x, which reads x ≤ 3.
- 06Weak path, for comparison: subtracting 5x and 12 instead gives −11x ≥ −33, and now dividing by −11 forces the flip to reach x ≤ 3. Same answer, one extra chance to be wrong.
- 07Check inside and outside. x = 0: 3(4 − 0) = 12 ≥ 5(0) − 21 = −21 ✓, and 0 is inside x ≤ 3. x = 4: 3(4 − 8) = −12 ≥ 5(4) − 21 = −1 is false ✓, and 4 is outside. Boundary x = 3: 3(4 − 6) = −6 ≥ 15 − 21 = −6 is true, so the endpoint is included — which is what ≥ promised.
One step hidden — a budget constraint with a whole-number answer
- 01A school club has $624 for a printing run. The printer charges a one-time $89 setup fee plus $7.25 per poster. What is the greatest number of posters the club can order?
- 02Translate before solving. Total spend must not exceed the budget, and "not exceed" includes spending exactly $624, so the symbol is ≤: 89 + 7.25p ≤ 624.
- 03Isolate p: subtract 89 to get 7.25p ≤ 535, then divide by 7.25 (positive, no flip) to get p ≤ 73.79…
Two steps hidden — graphing an inequality that is not solved for y
- 01Describe the graph of 3x − 4y > 12 in the xy-plane: the boundary's style, and which side is shaded.
- 02Boundary: replace > with = to get the line 3x − 4y = 12, which has x-intercept 4 and y-intercept −3. The symbol is strict, so the line is dashed — its points are not solutions.
- 03Choose a test point off the line. The origin works, since 3(0) − 4(0) = 0 ≠ 12. Substitute it into the original: 0 > 12 is false.
Solve alone
- 01A gym is planning a weekly class schedule. Each cycling class seats 22 people and each yoga class seats 14. The gym must seat at least 300 people per week and can run no more than 18 classes per week in total. Using c cycling classes and y yoga classes, write the system of inequalities, then determine whether c = 10, y = 8 satisfies it.
In your own words
In one sentence: why does multiplying both sides of an inequality by −1 reverse the direction of the symbol, while adding −1 to both sides does not?
Named traps
- The unflipped division
- Dividing or multiplying both sides by a negative number and leaving the symbol as it was — turning −14x ≤ −28 into x ≤ 2 rather than x ≥ 2. The result is a range of exactly the right size pointing the wrong way, which is far harder to notice than a wrong number.
- Flipping the number instead of the symbol
- Remembering that something has to flip and applying it to the constant: negating the right-hand side to get x ≥ −2 instead of reversing the direction to get x ≥ 2. The rule reverses the relationship between the two sides, never the value on either side.
- The phantom flip
- Reversing the symbol when adding or subtracting a negative number, because a minus sign appeared. Adding −7 to both sides slides both by the same amount and preserves the order; only multiplication and division by a negative reflect it.
- Solid/dashed mismatch
- Drawing a dashed boundary for ≤ or ≥, or a solid one for < or >. In point-testing form the same error is counting a point that lies exactly on the boundary as a solution to a strict inequality — and SAT items place a distractor precisely on that line often enough that it should be the first thing checked, not the last.
- Wrong half-plane from an unsolved form
- Reading the shading straight off the symbol when the inequality has not been solved for y, or when y's coefficient is negative. In 4x − 2y > 10 the > shades below, because isolating y divides by −2 and reverses it. A test point never makes this error.
- Union instead of overlap
- Accepting a point that satisfies one inequality of a system and never checking the rest, or shading everything either region covers. A system's solution set is the intersection — every condition, simultaneously — and the distractors are built from points that clear one constraint convincingly and fail another.
The 800-level margin
At 1500 the flip rule is not the problem; the edge cases and the execution are. The first edge case is the one the mechanism block named: multiplying or dividing both sides by an expression containing a variable. If the sign of that expression is unknown, the step has no defined effect on the symbol and cannot be taken. When a question appears to require it, the intended path is almost always different — clear the fraction by moving terms, or test the answer choices — because the SAT does not write items whose only route runs through an undefined step.
The second is answering the right question about the wrong quantity, which costs more points at the top of the scale than any misconception does. The item asks for the greatest number of hours and you report the cost. It asks for the maximum value of y and you report the x you solved for on the way. It asks how many more of one thing than another and you report a total. Before selecting, re-read the final clause of the prompt and say what the answer is a count of, and in what unit.
Third: boundary inclusion and rounding are two separate decisions that only interact in one place. Inclusion is settled by the symbol — ≤ includes the endpoint, < does not. Rounding is settled by the context — a "greatest number that fits inside a budget" rounds down, a "least number needed to reach a target" rounds up, regardless of what the decimal looks like. The one case where they collide is when the division lands on an exact integer: at 12.0 with ≤ the answer is 12, and with < it is 11. If your arithmetic comes out whole, the strict-versus-inclusive distinction has just become load-bearing.
Fourth, the maximum-and-minimum family. When a system's solution region is bounded and a question asks for the greatest or least value of a variable inside it, the answer sits at a corner — the intersection of two boundary lines — so drop the inequality symbols, solve those two boundaries as a system of equations, and you have the point. Then confirm the corner is actually included: if either boundary is strict, that exact point is outside the region and the question is either asking about a different corner or has been engineered so the extremum is approached but never reached.
Fifth, the slips that are not misconceptions at all. Distributing a negative across parentheses and missing the second term: −3(2x − 5) is −6x + 15, and the sign on the 15 is the one that gets dropped. A rate given per week when the variable counts days. A constraint stated in cents against answer choices in dollars. A system where the two variables are defined in the opposite order to the one the choices use. None of these are knowledge failures, which is why they survive to test day — they are caught only by a deliberate re-read of the setup, not by knowing more algebra.
Finally, on hard graph-reading items, remember that a strict boundary drawn as a dashed line changes which answer is correct without changing the picture much. Two answer choices differing only in ≤ versus < are not a formatting detail; they are the entire question, and the item was written by someone who knew exactly which one you would notice under time pressure.
Retrieval — with feedback on every choice
Which of the following gives all values of x that satisfy 5(3 − 2x) ≤ 4x − 13?
LINEAR INEQUALITIES — reference card Every equation step is legal. ONE exception: multiply or divide by a negative -> reverse the symbol. Adding or subtracting a negative never flips anything. Only multiplying/dividing by one does. Strong path: move variables to the side that keeps the coefficient positive, and never divide by a negative. Check in 10 seconds: one number inside your answer must satisfy the original; one outside must fail it. Two variables = a region. Boundary solid for ≤ and ≥, dashed for < and >. Which side? Test a point off the line — (0, 0) when the line misses the origin. True -> shade that side. Never read shading off the symbol unless y is alone with a positive coefficient. 4x - 2y > 10 shades BELOW. System = intersection of the regions. Every constraint, simultaneously. Overlap only. Language: at least / no fewer than = ≥. At most / no more than / cannot exceed = ≤. More than / fewer than = strict. Whole-number answers: round from the constraint (greatest that fits -> down; least that suffices -> up), not from the decimal. Max or min over a bounded region sits at a corner: drop the symbols and solve the two boundaries as equations. Never multiply or divide both sides by an expression whose sign you do not know.
Every item on this page is Meridian-original, written to match the Digital SAT's format and difficulty — it is not a real SAT question. The only source that matches the live test exactly is College Board's own Bluebook and Question Bank.
Which of the following gives all values of x that satisfy 5(3 − 2x) ≤ 4x − 13?
- Ax ≤ 2
This is the answer produced by dividing by a negative and leaving the symbol alone: 15 − 10x ≤ 4x − 13 collapses to −14x ≤ −28, and dividing by −14 without reversing gives x ≤ 2. Test x = 0, which this answer includes: 5(3) = 15 ≤ 4(0) − 13 = −13 is false, so 0 cannot be a solution.
- x ≥ 2
Correct. Distribute: 15 − 10x ≤ 4x − 13. Move the variable to the positive side by adding 10x: 15 ≤ 14x − 13. Add 13: 28 ≤ 14x, so 2 ≤ x, i.e. x ≥ 2 — no division by a negative anywhere. Check: x = 3 gives 5(3 − 6) = −15 ≤ 12 − 13 = −1 ✓; x = 0 gives 15 ≤ −13 ✗; and the endpoint x = 2 gives 5(3 − 4) = −5 ≤ 8 − 13 = −5, true, so 2 is included as ≤ requires.
- Cx ≥ −2
This comes from applying the flip to the numbers rather than to the symbol — rewriting −14x ≤ −28 as −14x ≤ 28 by negating the right side, then dividing and reversing to get x ≥ −2. Negating one side changes what the inequality claims; only the direction of the symbol is supposed to reverse.
- Dx ≤ −2
Both errors at once: the right-hand side was negated (−28 became 28) and the symbol was left unreversed, giving x ≤ −2. Substituting x = −3 into the original gives 5(3 + 6) = 45 ≤ −12 − 13 = −25, which is false — a single substitution rules this out.
Traps tested: Missing sign flip · Negated side not symbol
A field team has $1,480 budgeted for a season. A one-time research permit costs $250, and each day spent in the field costs $95 in supplies. What is the greatest number of whole days the team can spend in the field without exceeding the budget?
- 12
Correct. The constraint is 250 + 95d ≤ 1,480, so 95d ≤ 1,230 and d ≤ 12.94…. Days are whole, and the question asks for the greatest number that still fits, so round down to 12. Check both sides: 250 + 95(12) = $1,390, within budget, while 13 days would cost 250 + 95(13) = $1,485, which is over by $5.
- B13
This is 12.94… rounded to the nearest whole number rather than rounded by what the constraint permits. Rounding direction on this question type comes from the inequality, not from the decimal: 13 days costs $1,485 against a $1,480 budget, so it violates the very constraint being solved.
- C15
This is 1,480 ÷ 95 = 15.5…, rounded down — the permit was never subtracted. The $250 is a fixed cost that must come out of the same budget before any per-day spending is available, exactly as a signup fee does in a linear cost model.
- D18
This is (1,480 + 250) ÷ 95 = 18.2…, rounded down — the permit was added to the budget instead of charged against it. A sign error in the setup is invisible later, because every subsequent step is performed correctly on a constraint that describes the wrong situation.
Traps tested: Rounded to nearest · Ignored fixed component · Sign error in setup
Which of the following points (x, y) is a solution to the system of inequalities 2x + 3y ≤ 12 and y > 2x − 5?
- A(0, 5)
This clears the second inequality comfortably — 5 > 2(0) − 5 = −5 ✓ — which is why it looks safe. It fails the first: 2(0) + 3(5) = 15, and 15 ≤ 12 is false. A point must clear every constraint, so checking the one that is easiest to satisfy first is what makes this distractor work.
- B(3, 1)
This satisfies the first inequality (2(3) + 3(1) = 9 ≤ 12 ✓) and lands exactly on the boundary of the second: 2(3) − 5 = 1, so the claim becomes 1 > 1, which is false. The symbol is strict, so boundary points are excluded — had the system used y ≥ 2x − 5, this point would be a solution.
- (3, 2)
Correct. First inequality: 2(3) + 3(2) = 12, and 12 ≤ 12 is true because the symbol is inclusive — a boundary point counts here. Second: 2 > 2(3) − 5 = 1 ✓. Both hold simultaneously, so the point lies in the overlap.
- D(5, 0)
This satisfies the first inequality (2(5) + 3(0) = 10 ≤ 12 ✓) and fails the second: 2(5) − 5 = 5, and 0 > 5 is false. It is the mirror image of choice A — a point selected by verifying whichever constraint was checked first and stopping there.
Traps tested: Checked one constraint only · Boundary counts as solution
A caterer buys small trays, which cost $18 each and serve 8 people, and large trays, which cost $30 each and serve 15 people. The caterer must serve at least 120 people and can spend no more than $260 in total. If s is the number of small trays and t is the number of large trays, which system of inequalities represents these constraints?
- A18s + 30t ≥ 120 and 8s + 15t ≤ 260
The symbols are right and the coefficients are attached to the wrong constraints: the dollar prices ($18, $30) have been used to count people and the servings (8, 15) to count money. Each constraint has to be unit-consistent — the left side of the headcount inequality must be in people, and the left side of the budget inequality in dollars.
- 8s + 15t ≥ 120 and 18s + 30t ≤ 260
Correct. People served is 8 per small tray plus 15 per large tray, and "at least 120" is ≥ 120. Money spent is 18 per small tray plus 30 per large tray, and "no more than $260" is ≤ 260. Both sides of each inequality carry the same unit, which is the check that catches every other version of this item.
- C8s + 15t ≤ 120 and 18s + 30t ≥ 260
Both symbols are reversed. "At least 120" sets a floor on the number served, so 120 is a minimum and the symbol is ≥; "no more than $260" sets a ceiling on spending, so 260 is a maximum and the symbol is ≤. As written, this system requires the caterer to serve at most 120 people while spending at least $260.
- D8s + 15t ≥ 120 and 18s + 30t < 260
The headcount constraint is right; the budget uses a strict symbol. "No more than $260" permits spending exactly $260, so equality is allowed and the symbol must be ≤. This distinction is not cosmetic — a plan costing precisely $260 is a solution under the correct system and excluded under this one, and items in this family are frequently keyed on exactly that point.
Traps tested: Swapped constraint coefficients · Reversed inequality language · Strict boundary excluded
The inequality 4x − 2y > 10 is graphed in the xy-plane. Which statement correctly describes that graph?
- AThe boundary is a dashed line, and the region above it is shaded.
The boundary style is right and the shading is not. This is what you get by isolating y as though the −2 were positive: reading 4x − 2y > 10 as y > 2x − 5 keeps the symbol pointing the way it did on the page. Dividing by −2 reverses it.
- The boundary is a dashed line, and the region below it is shaded.
Correct, and the fastest route skips the rearrangement. The symbol is strict, so the boundary is dashed. Test (0, 0): 4(0) − 2(0) = 0, and 0 > 10 is false, so the origin's side is not shaded. The boundary line y = 2x − 5 passes through (0, −5), so the origin sits above it — which means the shaded side is the one below. Confirming algebraically: −2y > −4x + 10, divided by −2, reverses to y < 2x − 5 ✓.
- CThe boundary is a solid line, and the region below it is shaded.
The shading is right and the boundary is not. A solid line would mean points satisfying 4x − 2y = 10 are solutions, but the symbol is strictly greater than, so those points fail: at (4, 3), 4(4) − 2(3) = 10, and 10 > 10 is false.
- DThe boundary is a solid line, and the region above it is shaded.
Both decisions come out wrong: the strict symbol was read as inclusive, and the reversal from dividing by −2 was missed. Either error alone eliminates this choice, so a single test point plus a glance at the symbol rules it out without any rearrangement.
Traps tested: Missing sign flip · Strict boundary excluded · Shade rule without solving
In the xy-plane, the solution set of the system y ≤ −x + 9 and y ≤ 3x + 1 is a shaded region. Which of the following is the point of that region with the greatest y-coordinate?
- A(0, 9)
This maximises y using only the first constraint — on y ≤ −x + 9, pushing x down to 0 lifts y to 9. It is not in the region at all: the second constraint requires 9 ≤ 3(0) + 1 = 1, which is false. Whenever a question asks for an extreme value over a system, the constraint that is not binding at your candidate is the one that eliminates it.
- B(3, 6)
This point is genuinely in the region — 6 ≤ −3 + 9 = 6 ✓ and 6 ≤ 3(3) + 1 = 10 ✓ — which is exactly why it is a trap for a candidate-testing approach that stops at the first choice that works. Being in the region is not the question; having the greatest y-coordinate is, and 6 is beaten by 7.
- (2, 7)
Correct. Above the intersection the first constraint binds and y falls as x rises; below it the second binds and y falls as x drops, so the highest point of the region is where the two boundaries meet. Set them equal: −x + 9 = 3x + 1 gives 4x = 8, x = 2, and y = −2 + 9 = 7. Both symbols are inclusive, so that corner is part of the region: 7 ≤ 7 ✓ and 7 ≤ 3(2) + 1 = 7 ✓.
- D(7, 2)
These are the coordinates of the correct point in the wrong order. The intersection is at x = 2, y = 7; reporting (7, 2) answers with the maximum y-value in the x-slot. The point does lie in the region, so substitution alone will not flag the error — only re-reading which coordinate was asked for will.
Traps tested: Optimized one constraint · Stopped at first valid choice · Swapped coordinates
Up next
Algebra — module quiz
Interleaved across all five skills — no two consecutive items share a lesson.
1 min