Inequalities: Chapter Test
20 multiple-choice questions and 10 free-response questions, drawn from across the chapter and mixed together.
Multiple choice
Answer in any order and change your mind as often as you like. When you submit, your answers lock and every question shows its worked solution.
Free response
10 questions in parts, 112 points in total. Work them out on paper. There are no hints here: reveal each question's answer, worked solution, and rubric when you are ready to mark that one.
Reset the free-response section?
This re-seals every answer you have revealed and clears your flags.
-
1. One rule, and three ways of writing the same set . 10 points. Question 1 of 10.
A cold-storage log flags a reading whenever the recorded temperature , in degrees Celsius, is at most .
- Part A.
Write the flagging rule as an inequality in , and then as an interval.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part B.
Decide for each of , and whether the log flags it, and name the one of the three that sits exactly at the boundary.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Describe the number-line picture of the flagged readings: which value carries a circle, whether that circle is open or filled, and which way the shading runs. Then name a single change to the wording of the rule that would change the circle while leaving the shading exactly where it is.
Carry your own answer forward Describe the picture that belongs to whichever rule you wrote in part A, even if it was not the expected one. The credit here is for matching the circle to the symbol and the shading to the direction, not for one particular boundary value.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 4 points
The answer
Part A
, which as an interval is .
- says the same thing read from the other end; what is not the same is , which shuts the boundary out
Part B
The readings and are flagged; is not. The one sitting exactly at the boundary is .
Part C
A circle on , filled, with the shading running left across the colder readings. Rewriting "at most " as "below " opens the circle and leaves the shading untouched.
Worked solution
Part A
"At most" admits the boundary as well as everything below it, so the symbol carries the bar. Nothing in the rule limits how cold a flagged reading may be, so the set runs on downward, and an infinite end always takes a parenthesis while the finite endpoint takes a bracket.
Part B
Compare each reading with , remembering that among negative numbers the one nearer zero is the larger.
So sits above the boundary and escapes the flag, while sits below it and is caught. The reading is the boundary itself, and it is flagged because the rule admits equality.
Part C
The symbol admits equality, so the boundary belongs to the set and its circle is filled. The flagged readings are the ones below the boundary, and smaller numbers lie to the left, so the shading runs leftward under an arrowhead.
The circle answers only one question: does the boundary itself belong? Rewriting the rule as "below " gives , which removes exactly one number from the set and so opens the circle. Which way the shading runs is decided by the direction of the relation, and that has not been touched.
In one line
The rule is , the interval . It flags and but not , and is the boundary reading, admitted because the symbol carries the bar. The picture is a filled circle on with the shading running left; rewriting the rule as "below " opens that circle without moving the shading.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Chooses a symbol that admits the boundary, matching the wording "at most". . Worth 2 points.
Writes the interval with a bracket at the finite end and a parenthesis at the unbounded end. . Worth 1 point.
Part B 3 points
Judges all three readings against the rule, comparing negative numbers in the right order. . Worth 2 points.
Identifies the reading that sits at the boundary and states whether the rule admits it. . Worth 1 point.
Part C 4 points
Matches the circle to the strictness of the symbol and the direction of the shading to the relation. . Worth 2 points.
Names a change of wording that alters only the strictness, and says the shading is left where it was. . Worth 2 points.
-
-
2. Solving it, and then finding out what a test can prove . 11 points. Question 2 of 10.
Consider the inequality .
- Part A.
Clear the parentheses and solve for , showing each step. Report the solution as a set.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part B.
Test and in the ORIGINAL inequality, and report a verdict for each.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Decide whether the two tests in part B are enough on their own to establish both where the boundary is and whether the boundary itself belongs. Justify your verdict, and say what a further test at the boundary value would add.
Carry your own answer forward Argue from whichever boundary your part A produced and whichever verdicts your part B reached. The credit here is for what a test can and cannot establish, not for one particular number.
Justify your claim State the claim, then give the reason it has to be true. 4 points
The answer
Part A
, the interval .
- is the same set read from the other end; is not, since it names the opposite half of the line
Part B
satisfies it, since the two sides come to and and . does not, since the two sides come to and and is false.
Part C
No. The two tests fix only the direction, since any boundary between and would give the same pair of verdicts, and neither test touches the boundary itself. Substituting the boundary makes both sides equal, so the strict comparison fails, and that is what shows the boundary is excluded.
Worked solution
Part A
Distribute the across both terms inside the parentheses, then combine the constants on the left.
Collect the variable terms on the right, where the coefficient stays positive, so the final division needs no reversal.
Read from the other end, that is . No step multiplied or divided by a negative number, so the symbol never reversed.
Part B
Evaluate the two sides separately, then compare them.
One value inside the solution set and one outside it, which is what a solution of predicts.
Part C
The two verdicts are consistent with the answer from part A, but they do not pin it down. A solution set of , or , would have given exactly the same pair of results, so the tests establish the direction (smaller values in, larger values out) without establishing where the change happens.
They are also silent about the boundary, because neither test value is the boundary. Substituting it is the only way to settle that question:
That is false, so is not a solution, which is exactly what the strict symbol in records. A test at the boundary is the only test that can tell a strict solution set from an inclusive one.
In one line
The inequality solves to , the interval . In the original, gives , true, and gives , false. Those two verdicts fix the direction but not the boundary, since any boundary between the two test values would produce them; only a test at , where both sides come to , shows that the boundary itself is excluded.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Distributes across both terms in the parentheses and combines the constants correctly. . Worth 2 points.
Isolates the variable and reports a solution set rather than a single value. . Worth 2 points.
Part B 3 points
Substitutes each value into both sides of the original inequality and evaluates them correctly. . Worth 2 points.
States a verdict for each value rather than leaving two numbers side by side uncompared. . Worth 1 point.
Part C 4 points
Reaches a verdict on whether two off-boundary tests locate the boundary, and supports it by noting that other boundaries would give the same verdicts. . Worth 2 points. needs an explanation, not just an answer
Says what substituting the boundary value settles that the other two tests cannot. . Worth 2 points. needs an explanation, not just an answer
-
-
3. Reading a picture back into symbols . 11 points. Question 3 of 10.
The graph below shows the solution of one two-variable linear inequality. Every point of the shaded region satisfies it, and no point outside the shaded region does.
One boundary line on a unit grid, with the region on one side of it shaded. Text description of this figure
A coordinate grid ruled in single units. One straight line climbs steeply from the lower left to the upper right, crossing the vertical axis one unit below the origin and passing through the grid corner two units right and three units up. It is drawn as a continuous unbroken stroke. The whole region on the lower right side of that line is shaded, and the region on the upper left side is left plain.
- Part A.
Write down an inequality whose graph is exactly this picture. Give the boundary's equation, and say which feature of the drawing fixed the direction of your symbol and which fixed whether it admits equality.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part B.
Test and against your inequality and give each a verdict. One of the two sits exactly on the boundary; say which, and name the feature of the drawing that decides its verdict.
Carry your own answer forward Test the two points against whichever inequality you wrote in part A, even if it was not the expected one. The credit here is for substituting correctly and for spotting which point produces an equality, not for one particular symbol.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Suppose the same picture were redrawn with a broken boundary line and the same side shaded. Explain what would change about your answer to part A and what would not, and say exactly which points would leave the solution set.
Carry your own answer forward Answer for whichever inequality you wrote in part A and whichever verdicts you reached in part B. The credit here is for identifying what a change of line style does and does not affect, not for one particular boundary.
Explain why it works A sentence or two. Reasons, not steps. 4 points
The answer
Part A
, with boundary . The shaded lower side fixed the direction, and the unbroken line fixed that the symbol admits equality.
- is the same inequality rearranged; is not, since it would need a broken boundary
Part B
Both are solutions: gives and gives . The point on the boundary is , and the unbroken line is what admits it.
Part C
Only the strictness would change, giving . The boundary equation is untouched and so is the shaded side. The points that leave the set are exactly the points of the line itself.
Worked solution
Part A
Read the boundary first. The line crosses the vertical axis one unit below the origin and climbs two units for every unit to the right, so
Two separate features of the drawing then fix the symbol, and they answer two different questions. The line is unbroken, so its own points are solutions and the symbol admits equality. The shading lies on the lower side, where a point's height falls short of the line's height at the same input, so the direction is "at most". Together they give , and a shaded point agrees: gives .
Part B
Substitute each pair and judge the statement that results.
The second substitution comes out as an equality, which is the signature of a point lying on the boundary itself. An equality passes exactly when the symbol admits it, and the unbroken line says that it does here.
Part C
The symbol carries two independent decisions, and a change of line style touches only one of them. The direction comes from which side is shaded, and that side has not moved; the equation of the line has not moved either. What changes is whether the line's own points count:
So exactly the points satisfying leave the solution set, and no others do. Part B's two points show it concretely: was a solution and now is not, while , which lies strictly below the line, is unaffected.
In one line
The graph is , whose boundary is : the shaded lower side fixes the direction and the unbroken line admits equality. Both and are solutions, the second because it lands on the boundary, which an unbroken line includes. Redrawing that boundary broken changes the symbol to and removes exactly the points of the line, leaving the equation and the shaded side alone.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Reads the boundary equation off the picture with both the intercept and the steepness correct. . Worth 2 points.
Fixes the direction of the symbol from the shaded side, naming that feature. . Worth 1 point.
Fixes whether the symbol admits equality from the way the line is drawn, naming that feature. . Worth 1 point.
Part B 3 points
Substitutes both points and evaluates each side correctly. . Worth 2 points.
Identifies the point that produces an equality and names the line's style as what decides its verdict. . Worth 1 point.
Part C 4 points
Separates the strictness of the symbol from the direction and from the boundary equation, and says only the first changes. . Worth 2 points. needs an explanation, not just an answer
Names the points of the boundary line as exactly those that leave the solution set. . Worth 2 points.
-
-
4. A coefficient whose sign you were never told . 11 points. Question 4 of 10.
An inequality reads , where is a fixed nonzero number whose value has not been given.
- Part A.
Write the solution for when is positive, and separately when is negative.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part B.
Take , and then . Give the solution set in each case as an interval, and name one value of that satisfies the first but not the second.
Carry your own answer forward Substitute the two values of into whichever pair of case solutions you wrote in part A. The credit here is for producing two intervals and a value that tells them apart, not for one particular formula.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Explain why cannot be written as a single inequality in without splitting into cases on the sign of , and say what that shows in general about multiplying or dividing both sides of an inequality by a quantity whose sign is unknown.
Carry your own answer forward Argue from whichever case solutions and intervals you produced in parts A and B. The credit here is for locating the difficulty in the undetermined direction, not for one particular pair of intervals.
Explain why it works A sentence or two. Reasons, not steps. 4 points
The answer
Part A
For : . For : .
- the second case may be written with the fraction left negative, or with the sign moved out front; what is not the same is keeping in both cases
Part B
For the set is ; for it is . The value lies in the first and not in the second.
Part C
Dividing by forces a choice between reversing the symbol and leaving it, and only the sign of settles that choice, so the result cannot be written as one inequality without splitting into cases. In general the move is blocked not because a letter is involved but because the direction of the result is undetermined.
Worked solution
Part A
Isolating means dividing both sides by , and the sign of alone governs that step: a positive divisor leaves the direction alone, a negative one reverses it.
The bound is written by the same expression in both cases. What differs is which half of the line it cuts off.
Part B
The two sets agree only on the numbers from to , so anything below separates them. Checking against the two originals: holds, while does not.
Part C
Every other move on an inequality has one outcome, but scaling has two, and the sign of the multiplier selects between them. Part B shows the two outcomes are genuinely different sets rather than two spellings of one set, since and share only the numbers between and :
So with the sign of withheld, "solve for " has no single answer, and the honest response is a pair of cases. The same holds whenever both sides are scaled by any quantity of unknown sign: the objection is not that the multiplier is a letter, because a letter known to be positive causes no trouble at all. It is that the direction of the result is undetermined until the sign is fixed.
In one line
For the solution is and for it is . With that is and with it is , two different sets told apart by any value below , such as . So has no single solution until the sign of is fixed: scaling both sides by a quantity of unknown sign leaves the direction of the answer undetermined.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Divides by in each case and attaches the reversal to the negative case only. . Worth 2 points.
Reports two cases rather than one solution meant to cover both. . Worth 1 point.
Part B 4 points
Produces both solution sets and writes each as an interval with the correct fence at its finite end. . Worth 2 points.
Names a value that lies in one set and not the other, and checks it against the originals. . Worth 2 points.
Part C 4 points
Locates the difficulty in the undetermined direction of the result rather than in the presence of a letter. . Worth 2 points. needs an explanation, not just an answer
States the general lesson for scaling both sides by a quantity whose sign is unknown. . Worth 2 points. needs an explanation, not just an answer
-
-
5. Two conditions, and only one of them doing any work . 11 points. Question 5 of 10.
A number has to satisfy both of these at the same time: and .
- Part A.
Solve each condition separately.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Write the set of numbers satisfying both conditions, as an inequality and as an interval, and say which of the two conditions is deciding it.
Carry your own answer forward Combine whichever two sets you produced in part A. The credit here is for taking the overlap of two conditions and naming which one binds, not for one particular boundary.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part C.
Decide whether removing the second condition would change which numbers are admissible, and justify your verdict. Then describe, in general, what has to be true of two conditions like these for one of them to be removable with no effect at all.
Carry your own answer forward Argue from whichever sets you produced in part A and whichever overlap you wrote in part B. The credit here is for the containment argument and the general statement, not for one particular pair of numbers.
Justify your claim State the claim, then give the reason it has to be true. 4 points
The answer
Part A
The first gives and the second gives .
Part B
, the interval . The first condition decides it, being the tighter of the two.
- or ; what is not the same is , which admits numbers the first condition rejects
Part C
Removing it changes nothing: every number satisfying already satisfies , so the overlap is untouched. In general a condition is removable exactly when its own solution set contains the other's entirely, which for two rays running the same way means it carries the looser boundary.
Worked solution
Part A
Both divisions were by positive numbers, so neither symbol reversed.
Part B
A number satisfies both conditions exactly when it lies in both sets, so the combined set is the overlap. Both rays run leftward from their boundaries, so the one that stops sooner cuts the other short.
The first condition is the one doing the work, because every number it admits is already admitted by the second.
Part C
Take any with . Since , transitivity carries the comparison through, so the second condition holds by itself and adds no restriction:
Dropping it therefore leaves the admissible set at . The general statement is a containment: a condition can be removed without effect exactly when its solution set contains the other condition's set, so that nothing it would have excluded was ever admitted. For two rays running the same way that means the removable one carries the looser boundary. The converse direction is worth checking too, because it is where the rule stops: if the two rays ran in opposite directions, neither set would contain the other, and dropping either one would enlarge the admissible set.
In one line
The two conditions solve to and , and together they admit , the interval , decided by the first. Removing the second changes nothing, since every number at most is already at most . In general a condition can be dropped without effect exactly when its solution set contains the other's, which for two rays running the same way means it carries the looser boundary.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Solves each condition correctly, with no reversal at either division. . Worth 2 points.
Reports each result as a set of values for rather than a single number. . Worth 1 point.
Part B 4 points
Takes the overlap of the two sets rather than combining their boundaries some other way. . Worth 2 points.
Writes the combined set both as an inequality and as an interval, and names the condition that decides it. . Worth 2 points.
Part C 4 points
Reaches a verdict on removal and supports it by showing one solution set sits inside the other. . Worth 2 points. needs an explanation, not just an answer
States a general containment condition rather than a rule tied to these two numbers. . Worth 2 points. needs an explanation, not just an answer
-
-
6. One extra limit that costs nothing, and one that costs plenty . 12 points. Question 6 of 10.
A feasible region is given by , and , and the objective to be maximized over it is .
- Part A.
List the corners of the region and find the maximum of .
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part B.
A further limit, , is now imposed on the same region. List the corners of the new region and find the maximum of over it.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Suppose the further limit had instead been , with the original three constraints unchanged. Find the maximum in that case. Then say which of the two extra limits changed the answer and which did not, and what distinguishes them.
Carry your own answer forward Compare with whichever maxima you found in parts A and B. The credit here is for attributing the change to what happened to whichever corner won in each case, not for one particular value.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 4 points
The answer
Part A
The corners are , and , where takes the values , and . The maximum is , at .
Part B
The corners are , , and , where takes the values , , and . The maximum is , at , unchanged.
Part C
With the corners are , , and , and the maximum drops to at . So changed the answer and did not: the first removes the corner that was winning, while the second leaves that corner inside the region.
Worked solution
Part A
The three boundaries meet in pairs at , and , and each of those crossings satisfies the remaining constraint, so all three are corners of the region.
The largest of the three is , reached at . The heavier weight on is what sends the optimum to the wide corner rather than the tall one.
Part B
The new boundary meets at and meets at . The old corner is cut away, since fails there.
The maximum is again, at , a corner the new limit never touched.
Part C
The limit meets at and meets at , and it removes , since fails there.
The maximum is , at , down from . What distinguishes the two extra limits is not how tight either looks but whether it reaches the corner that was winning: satisfies comfortably, so that limit costs nothing here, and it fails , so that limit forces the optimum onto a new corner. This is a verdict about this objective rather than about the two limits in general, since an objective weighted toward could be cut by and left alone by .
In one line
The original region has corners , and , and reaches at . Adding gives corners , , and and leaves the maximum at . Adding instead gives corners , , and and drops the maximum to at . The limit that mattered is the one that removed the winning corner ; the other left it in the region.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Finds all three corners as crossings of pairs of boundaries. . Worth 2 points.
Evaluates the objective at every corner rather than at a chosen few. . Worth 1 point.
Reports both the maximum value and the corner that achieves it. . Worth 1 point.
Part B 4 points
Rebuilds the corner list under the new limit, dropping the corner it cuts away and adding the two it creates. . Worth 2 points.
Evaluates the objective at every corner of the new region. . Worth 1 point.
States the maximum and where it sits. . Worth 1 point.
Part C 4 points
Rebuilds the corners under the second extra limit and evaluates the objective at them. . Worth 2 points.
Attributes the change to whether the extra limit removes the corner that was winning, rather than to how tight the limit looks. . Worth 2 points.
-
-
7. Two endless conditions meeting at one number . 12 points. Question 7 of 10.
Here is a claim about conditions on a single number : if each of two conditions is satisfied by infinitely many numbers, then the numbers satisfying both of them are infinitely many too.
- Part A.
Refute the claim. Give two specific conditions, each satisfied by infinitely many numbers, whose combined solution set is a single number, and name that number.
Construct a counterexample Give one specific case, and show it breaks the claim. 4 points
- Part B.
Write each of your two conditions in interval notation, and describe in words what the overlap of the two intervals is.
Carry your own answer forward Write whichever two conditions you gave in part A as intervals. The credit here is for the fences and for describing the overlap, not for one particular boundary value.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part C.
Change one of your two conditions so that the combined set becomes empty instead, and explain in general what has to be true of two conditions of this kind for their overlap to be exactly one number rather than empty or infinite.
Carry your own answer forward Modify whichever pair of conditions you have been working with, and state the general rule in terms of directions, boundaries and strictness rather than in terms of your particular numbers.
Explain why it works A sentence or two. Reasons, not steps. 4 points
The answer
Part A
The conditions and each admit infinitely many numbers, and the only number satisfying both of them is .
Part B
and . The overlap is the single shared endpoint, the number , which survives because each interval closes that end with a bracket.
- the two intervals may be written in either order; what is not the same is a parenthesis at the shared endpoint, which would leave the overlap empty
Part C
Changing to empties it. In general the two rays must point toward each other and share one boundary value, and both must admit that value: if either excludes it the overlap is empty, and if the boundaries are placed so the rays run past each other the overlap is infinite.
Worked solution
Part A
Each condition on its own is an unbounded ray. The first admits , , and every larger number; the second admits , , and every smaller one. A number satisfying both must be at least and at most at once, and only one number manages that.
So the combined set holds exactly one number while each condition holds infinitely many, and the claim is refuted.
Part B
Each ray is unbounded at one end and closed at the other, since both conditions admit their boundary.
The first covers everything from rightward and the second everything from leftward, so the only place they meet is the endpoint they share. Both write that endpoint with a bracket, which is exactly why it survives the overlap.
Part C
Strengthen one end and the only candidate falls out:
Nothing is left, because the shared boundary was the only number in the set and one condition now refuses it.
Three things decide the size of the overlap of two rays, and all three have to be right for the answer to be exactly one. First the directions: two rays pointing the same way give an infinite overlap, since one set contains the other. Second, when they do point toward each other, the placement of the boundaries: if they run past each other they share a whole band, again infinite, and if they stop short of each other they share nothing. Third, when the two boundaries coincide, the strictness decides between one number and none, and only when both conditions admit the shared value does exactly one number survive.
In one line
The claim is false: and each admit infinitely many numbers, yet together they admit only . As intervals they are and , meeting at the endpoint they share, which survives because each closes that end with a bracket. Changing the first to empties the set. In general two such rays overlap in exactly one number only when they point toward each other, share a boundary value, and both admit it.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Offers two conditions each of which admits infinitely many numbers. . Worth 2 points.
Shows that the combined set holds exactly one number, and names it. . Worth 2 points.
Part B 4 points
Writes both intervals with a bracket at the finite end and a parenthesis at the unbounded end. . Worth 2 points.
Describes the overlap as the single shared endpoint rather than as an interval with width. . Worth 2 points.
Part C 4 points
Produces a change that empties the combined set, and says which single value it removed. . Worth 2 points. needs an explanation, not just an answer
States the general requirements on direction, boundary placement and strictness that leave exactly one number. . Worth 2 points. needs an explanation, not just an answer
-
-
8. Where the edges meet, and what the region actually holds . 11 points. Question 8 of 10.
A system reads , and .
- Part A.
The three boundary lines meet in pairs at three points. Find all three, saying which pair of boundaries meets at each.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Decide, for each of the three meeting points and also for , whether it belongs to the region the system describes.
Carry your own answer forward Test whichever three meeting points you found in part A, along with . The credit here is for checking a point against every condition and for reading the verdict of a point that lands on a boundary, not for one particular list.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Compare this region with the one obtained by changing to , leaving the other two conditions alone. Say exactly which points are added, and which of the four points from part B change verdict.
Carry your own answer forward Compare against whichever verdicts you reached in part B. The credit here is for identifying the added points as a segment of one boundary and for saying which verdicts can move, not for one particular list.
Compare the two methods Say what each one costs you, and when you would reach for it. 4 points
The answer
Part A
meets at ; meets at ; and meets at .
Part B
and do not belong, since each has equal to while the condition demands more than . and both belong.
Part C
The change adds exactly the segment of the line running from to , endpoints included, and nothing else. Of the four points, and move from outside to inside; and are unaffected.
Worked solution
Part A
Solve each pair of boundary equations in turn.
Each of the three also satisfies the boundary it did not come from: has , at most ; has , at least ; and has , above . So all three lie on the edge of the region rather than outside it.
Part B
Test each point against all three conditions, stopping only when one fails.
The two failures sit on the boundary , and that condition is strict, so the line is drawn broken and its own points are excluded. The two successes also sit on boundaries, on two of them and on , but those conditions admit equality, so lying on the line costs them nothing.
Part C
Only the strictness of one condition changed, so the boundary line is in the same place and the shaded side is the same side. The only points whose status can move are those lying on that line, and which of them are admitted is settled by the other two conditions:
So the added points form the segment from to , ends included. The two points of part B that sat on that line change verdict, and the two that did not sit on it cannot be touched by a change to that line's own status. The added segment is also where the region gains two corners it did not have: under the original system the edges run toward and without ever reaching them.
In one line
The boundary pairs meet at , and . Of those, only belongs to the region, along with ; the other two fail because they sit on that strict boundary. Changing to adds exactly the segment of from to , endpoints included, so those two points join the region while and are unaffected.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Solves all three boundary pairs correctly. . Worth 2 points.
Says which pair of boundaries produces each point. . Worth 1 point.
Part B 4 points
Tests each point against every condition rather than stopping at the first one it passes. . Worth 2 points.
Explains the failures by the strictness of the boundary the failing points sit on. . Worth 2 points.
Part C 4 points
Identifies the added points as a segment of the changed boundary, with its two ends worked out from the other conditions. . Worth 2 points.
Says which of the four points change verdict and why the others cannot be affected. . Worth 2 points.
-
-
9. Feeding a plot for the least money . 12 points. Question 9 of 10.
A gardener buys two soil additives by the bag. Each bag of additive A supplies units of nitrogen and unit of potash, and costs dollars. Each bag of additive B supplies unit of nitrogen and units of potash, and costs dollars. The plot needs at least units of nitrogen and at least units of potash.
- Part A.
Name what each variable counts, write every constraint the situation imposes, and write the quantity to be made as small as possible.
Model the situation Name your unknown first, then write every other quantity in terms of that one letter. 4 points
- Part B.
Find every corner of the feasible region and the cost at each, then state the cheapest purchase.
Carry your own answer forward Work from whichever constraints and objective you wrote in part A. The credit here is for finding the corners, discarding crossings that fail a constraint, and comparing the objective across them, not for one particular set of numbers.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
A supplier offers a promotion on exactly bags of A and bags of B. Decide whether that purchase would meet the plot's needs, and compare its cost with your answer to part B. Then decide whether any purchase cheaper than your part B answer could exist anywhere in the region, and justify that.
Carry your own answer forward Compare the promotion against whichever constraints you wrote in part A, and against whichever cheapest cost you found in part B. The credit here is for testing admissibility before price, and for your justification for the verdict you reach.
Justify your claim State the claim, then give the reason it has to be true. 4 points
The answer
Part A
Let be the bags of A and the bags of B. Then , , and , and the cost to be made small is dollars.
Part B
The corners are , and , costing , and dollars. The cheapest purchase is bags of A and bags of B, at dollars.
Part C
Not admissible: it supplies units of potash against a requirement of , and at dollars it is dearer than the in any case. No cheaper admissible purchase exists, because the region runs on only in directions that raise a bag count, and each of those raises the bill.
Worked solution
Part A
Each bag of A brings units of nitrogen and each bag of B brings , and the plot needs at least units, so that sentence is a lower limit rather than a cap. The potash sentence reads the same way, and neither count of bags can be negative.
The quantity being pushed down is the bill, dollars. Note which way the resource inequalities point: a plot that needs feeding sets a floor, not a ceiling, which is what makes this a minimization.
Part B
The boundary meets at , which also clears the potash limit since . The boundary meets at , which clears the nitrogen limit since . The two slanted boundaries meet where
The two remaining crossings are not corners: with gives , whose nitrogen is only , and with gives , whose potash is only .
The smallest is dollars, at : three bags of A and four of B.
Part C
Check the promotion against both requirements before looking at its price.
It clears the nitrogen requirement and falls one unit short on potash, so it is not an allowed purchase at all. Its price, dollars, is higher than the from part B as well, but that is beside the point: a purchase that does not feed the plot is out whatever it costs.
Could anything beat ? The region is unbounded, so the corner comparison deserves a second look rather than a reflex. Every direction the region runs on increases , or , or both, and both prices are positive, so travelling outward can only raise the bill. That leaves the corners as the only candidates, and the smallest value among them is . So dollars is the least the plot can be fed for.
In one line
With bags of A and bags of B, the model is to make small subject to , , and . The corners are , and , costing , and dollars, so the cheapest purchase is bags of A and bags of B at dollars. The promotion of and bags is not admissible, supplying only units of potash, and nothing beats dollars, because every direction the region runs on raises a bag count and so raises the bill.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Names what each variable counts and writes both resource sentences as lower limits rather than caps. . Worth 2 points.
Includes both non-negativity constraints. . Worth 1 point.
Writes the cost as the objective, with each price attached to the right variable. . Worth 1 point.
Part B 4 points
Finds the corners, discarding boundary crossings that fail one of the remaining constraints. . Worth 2 points.
Evaluates the cost at every corner rather than at a chosen few. . Worth 1 point.
States the cheapest purchase as a number of bags of each additive, with the cost in dollars. . Worth 1 point.
Part C 4 points
Tests the proposed purchase against every requirement and reaches a verdict on admissibility before comparing prices. . Worth 2 points. needs an explanation, not just an answer
Argues that nothing cheaper exists, addressing the fact that the region is unbounded rather than passing over it. . Worth 2 points. needs an explanation, not just an answer
-
-
10. A number that is always waiting in between . 11 points. Question 10 of 10.
Suppose . This question is about the number .
- Part A.
Take and . Compute , and check the two comparisons and .
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Prove that and hold for every pair of numbers with . Name the rule behind each step, and say where you needed the divisor to be positive.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 4 points
- Part C.
Decide whether a compound condition with can ever have an empty solution set, and justify your answer from part B. Then say what changes when and are equal instead.
Carry your own answer forward Argue from whichever result you established in part B. The credit here is for settling emptiness by whatever your part B result licenses, and for treating the equal case separately, not for one particular pair of numbers.
Justify your claim State the claim, then give the reason it has to be true. 4 points
The answer
Part A
, and both comparisons hold: and .
- is the same number as ; what is not the same is , which drops the sign of the sum
Part B
Adding to both sides of gives , and dividing by the positive gives . Adding instead gives , and the same division gives . The positivity of is what each division needs, since a negative divisor would reverse the symbol.
Part C
It can never be empty: part B produces a number, , satisfying both halves for every such pair, so a solution always exists. When and are equal the chain asks for a number strictly above and strictly below the same value, which nothing satisfies, so the set is then empty.
Worked solution
Part A
Add the two numbers first, keeping the sign of the sum, then halve.
Both comparisons hold: , because among negative numbers the one further from zero is the smaller, and , because every negative number is below every positive one.
Part B
Start from and add the same quantity to both sides, a move that never disturbs the direction.
Now divide both sides by . That divisor is positive, so the direction survives, and the right-hand side is exactly :
Run the same two moves with added instead of :
Only two rules were used: adding the same quantity to both sides keeps the direction, and dividing both sides by a positive number keeps it as well. The second is where the sign of the divisor matters. Dividing by instead would have reversed both symbols and produced an equivalent statement that simply does not isolate in the form wanted, which is why the positivity of has to be stated rather than assumed silently.
Part C
Part B does not merely make it plausible that something sits between and ; it hands over a specific number that does, for every pair with :
Since satisfies both halves of the chain, the solution set of contains and is therefore never empty. Running the same argument again on the pair , and again on its result, produces as many solutions as you like, though one is enough to settle the question asked.
The argument leans on at its first step, and with and equal it collapses. The chain then reads , which demands a number strictly above and strictly below at the same time, and the two halves rule each other out. So the guarantee belongs to the case and does not reach past it, which is a useful reminder that a chain is only a legitimate way of writing two conditions when its left bound really is below its right one.
In one line
For and the midpoint is , and . In general, adding to both sides of and dividing by the positive gives , while adding instead gives , so the midpoint always lies strictly between. That is why can never be empty when : it always contains . When and are equal the chain asks for a number strictly above and strictly below one value, and its solution set is empty.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Computes the midpoint correctly, keeping the sign of the sum. . Worth 2 points.
Checks both comparisons rather than asserting that the value lies in between. . Worth 1 point.
Part B 4 points
Derives one comparison by adding and dividing, and the other by adding and dividing. . Worth 2 points.
Names the rule behind each step and identifies the division as where the sign of the divisor matters. . Worth 2 points. needs an explanation, not just an answer
Part C 4 points
Settles the emptiness question by pointing to a number the previous part produced, rather than by appeal to intuition. . Worth 2 points. needs an explanation, not just an answer
Treats the equal case separately and says why the earlier argument does not reach it. . Worth 2 points. needs an explanation, not just an answer
-