Linear Inequalities: Free Response
5 questions in parts, 75 points in total. Work each one out on paper, taking a hint if you get stuck. When you have an answer, reveal the answer to check it, and the full solution only if you still want it. The rubric is there so you can mark your own work.
-
1. Three moves on one true statement, and the one that needs a proof . Foundational, 10 points. Question 1 of 5.
An inequality accepts some steps without any argument at all, and reverses direction under exactly one family of steps. This question runs three moves on the same true statement, then proves, for arbitrary numbers rather than just this example, why only one of the three families ever needs that reversal.
- Part A.
Starting from the true statement , apply each step below, and for each write the resulting statement using whichever symbol, or , makes it true: (i) add to both sides; (ii) multiply both sides by ; (iii) multiply both sides by .
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
All three steps in part A are reversible: adding is undone by subtracting , multiplying by by dividing by , and multiplying by by dividing by . Yet only one of them reversed the direction. Prove, for arbitrary real numbers and an arbitrary negative number , that must hold, arguing from the fact that is a positive number. Then state, in one sentence, why reversibility itself cannot be the property that decides a flip.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 4 points
- Part C.
Multiplying both sides of by produces . Explain why this outcome is not merely 'an extreme case of reversal' but a different kind of failure, and name the one property every step in part A has that this one lacks.
Explain why it works A sentence or two. Reasons, not steps. 3 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Two different questions are hiding in these three steps: does the direction survive, and could the step be undone afterward? They do not always have the same answer.
-
Hint 2 of 4 · Part A
Compute the two new numbers for each step first, then check whether the naive symbol still makes a true statement or needs to be turned around.
-
Hint 3 of 4 · Part B
Write the negative multiplier as for a positive , and compare and through their difference, the same way the lesson compared and .
-
Hint 4 of 4 · Part C
Ask what step, applied to , could possibly recover and . Every step in part A had such a partner.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
(i) ; (ii) ; (iii) .
Part B
True for every real and negative : , because is the product of a negative number and a positive number, hence negative. Reversibility is not the deciding property, since every step in part A is equally reversible and only one of them flips.
Part C
is simply false and records nothing about or , unlike a reversal, which still reports something true about the original numbers. The missing property is invertibility: dividing by is undefined, so no step could undo multiplying by and recover the original inequality.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
Apply each step to both sides of separately, then decide the symbol from the truth of the result.
Adding : and .
Multiplying by , a positive number: and .
Multiplying by , a negative number: and . Keeping the symbol as would claim , which is false, so the true statement reverses it.
Part B
Start from what means: the difference is a positive number. The claim is about the products and , so compare them through their own difference, the way the lesson compared and .
Because is negative and is positive, their product is negative.
The statement is exactly , so the reversal holds for every choice of and every negative , not merely for the specific numbers in part A.
Reversibility cannot be the deciding property, because every one of the three steps in part A can be undone by an opposite step of the same family, so all three are equally reversible, and still only the negative multiplication flipped the direction. What actually decides a flip is the sign of the number multiplying both sides, not whether the step has an inverse.
Part C
A reversal, like the one in part A, is still an accurate report about the original two numbers: genuinely reflects what happened to and under multiplication by , and dividing by recovers them exactly. Multiplying by is not that.
The result is false outright and says nothing at all about or specifically: any pair of numbers multiplied by produces that identical statement (or , for a non-strict symbol), so no trace of the starting numbers survives.
The property every step in part A shares is that each one is invertible: addition of is undone by subtracting , multiplication by by dividing by , and multiplication by by dividing by . Multiplying by has no such partner, because dividing by is not defined, so there is no step that could take back to . That is the real difference: a reversal changes the symbol but preserves recoverability, while multiplying by destroys recoverability altogether.
In one line
Adding gives , multiplying by gives , and multiplying by gives : only the last needed the symbol reversed. In general, for any and any negative , is negative (a negative times a positive), so for every such choice, not just this example; reversibility is not the deciding property, since all three moves are reversible and only one flips. Multiplying by is a different failure altogether: is simply false and cannot be undone, since no step recovers the original numbers once they are multiplied by .
Another way: Picture each step as a move on the number line
Adding slides both and the same distance in the same direction. Multiplying by stretches both distances from zero without swapping which one is further right. Multiplying by does something neither of those does: it reflects the whole line through zero, so whichever number sat on the left is thrown to the right, and that swap is exactly what reverses the symbol.
When it is worth it As a quick check on whether a step should reverse a direction, before doing any arithmetic: ask whether the step slides, stretches, or reflects the line.
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 all three resulting pairs of numbers correctly. . Worth 2 points.
Correctly identifies that only the multiply-by-negative-2 step needed the symbol reversed. . Worth 1 point.
Part B 4 points
Gives a general proof that kp > kq for arbitrary p < q and arbitrary negative k, arguing from the sign of a difference (such as kq - kp), not from a specific numeric example. . Worth 3 points. needs an explanation, not just an answer
States that reversibility cannot be the deciding property, since all three steps in part A are equally reversible, so what actually decides a flip is the sign of the multiplier. . Worth 1 point. needs an explanation, not just an answer
Part C 3 points
Explains that 0 < 0 (or the non-strict analogue) is simply false and records nothing about the original numbers, unlike a reversed inequality, which still reports something true about them. . Worth 2 points. needs an explanation, not just an answer
Names invertibility (having an undoing step) as the property the three steps in part A share and multiplying by 0 lacks, tied to division by 0 being undefined. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Starting from , apply: (i) add to both sides; (ii) multiply both sides by ; (iii) multiply both sides by . Report each resulting true statement.
The answer
; ; , with the reversal only at the multiplication by .
Adding : and .
Multiplying by : and .
Multiplying by : and . Keeping would claim , which is false, so the true statement reverses it.
-
-
2. A per-unit adjustment whose sign has not been decided . Application, 15 points. Question 2 of 5.
A sales contract lets a rep's pay change by dollars for every unit she sells: a positive is a bonus per unit, while a renegotiation still under discussion could make negative, a deduction per unit instead. Which case will apply has not been settled. If she sells units, the total pay adjustment is dollars.
- Part A.
Write the inequality stating that the total pay adjustment exceeds dollars, in terms of and . Then solve it for in the case where the renegotiation leaves positive.
Model the situation Name your unknown first, then write every other quantity in terms of that one letter. 4 points
- Part B.
Solve the same inequality, , for in the case where the renegotiation makes negative, and state the sign of the resulting boundary .
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Explain why no realistic number of units sold (a count that is zero or positive) can ever satisfy the deduction case from part B, using only the sign of the boundary you found there, without solving anything new.
Carry your own answer forward Use whichever boundary sign you found in part B; if you are unsure of it, work through part B again before answering this part.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 4 points
- Part D.
Suppose the renegotiation is dropped entirely, so . State what the inequality becomes, whether any satisfies it, and say whether this fits the general rule that a parameter inequality with gives every real number, or gives no solution, once you check the sign of .
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
This is the ax > b classification from the lesson, with r playing the role of the parameter coefficient and 60 the fixed constant. Work through it exactly as the lesson's own three cases.
-
Hint 2 of 4 · Part A
Turn 'total pay adjustment exceeds 60 dollars' directly into an inequality in r and x before touching either case.
-
Hint 3 of 4 · Part B
The algebra is identical to part A except for one thing: check the sign of what you are dividing by before deciding whether the symbol changes.
-
Hint 4 of 4 · Part D
Set r to 0 in the original inequality first, and see what is left once the variable itself has vanished.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
; for : .
Part B
; because , this boundary is itself a negative number.
Part C
Part B's solution is every below , and since that boundary is negative, the case only admits negative values of ; a real sales count is never negative, so no actual number of units sold can land in that set.
Part D
It becomes , false for every , so there is no solution; since is positive (not negative), this matches the general rule that together with gives the empty set, never every real number.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
The total adjustment is the per-unit amount times the number of units , and exceeding dollars means that total is strictly greater than .
When , dividing both sides by the positive number keeps the direction.
Part B
Divide both sides by the negative number , which reverses the direction.
Since is negative, dividing the positive number by a negative number gives a negative result, so .
Part C
Part B's solution set is , and was shown there to be a negative number. A set of the form 'less than a negative number' contains only negative numbers, since anything at or above automatically fails to be below a negative boundary.
A genuine count of units sold is never negative, so no realistic can belong to this case's solution set: whatever the deduction rate turns out to be, it can never push the adjustment above dollars for an actual sale.
Part D
With , the left side is for every , so the inequality has no variable left in it.
This statement is false regardless of , so the solution set is empty: dropping the renegotiation can never itself push the adjustment above dollars.
The general rule for at says the outcome is every real number when , and empty when . Here is positive, squarely in the half, so the empty outcome found directly is exactly what the general rule predicts.
In one line
gives when and when , where that second boundary is negative, so no realistic (non-negative) sales count ever falls in the deduction case. At the inequality becomes the false statement , giving no solution, matching the general rule that with never yields every real number.
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
Writes rx > 60 with r for the per-unit adjustment and x for the number of units, in that strict form. . Worth 2 points.
Divides by the positive r without a flip and reports x > 60/r. . Worth 2 points.
Part B 3 points
Divides by the negative r, correctly reverses the direction, and reports x < 60/r. . Worth 2 points.
States that the boundary 60/r is negative, tied to r being negative. . Worth 1 point.
Part C 4 points
Identifies that part B's solution set lies entirely below a negative number, hence contains only negative x. . Worth 2 points.
Connects that fact to the real situation, concluding no realistic (non-negative) sales count satisfies the deduction case. . Worth 2 points.
Part D 4 points
States that r = 0 gives 0 > 60, false for every x, so no solution. . Worth 2 points.
Ties the outcome to the general a = 0 rule, identifying that b = 60 being nonnegative places this in the no-solution branch rather than the all-reals branch. . Worth 2 points. needs an explanation, not just an answer
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
A different contract adjusts pay by dollars per unit, with the sign of still undecided, and the rep wants the total adjustment to exceed dollars after selling units. Solve for in each of the three cases, , , and .
The answer
if ; (a negative boundary) if ; no solution if .
For , divide by the positive , keeping the direction.
For , divide by the negative , reversing the direction; the boundary is negative here.
For , the inequality becomes
which is false for every , so there is no solution.
-
-
3. One illegal step, hiding inside a rational inequality . Reasoning, 15 points. Question 3 of 5.
Marcus solves and turns in this work.
He reports the solution set as every below .
- Part A.
Name precisely the step in Marcus's work that is not justified, and state the two separate reasons it fails.
Find and correct the error Say which line first goes wrong, why it is wrong, and then do it correctly. 4 points
- Part B.
Test and directly in the original inequality , before doing any further algebra. Report what each test shows about whether Marcus's claimed solution set, every below , can be right.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part C.
Solve correctly, excluding first and then splitting into the two cases and . Report the full solution set.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part D.
Explain why the case contributed nothing to the final solution set, referring to the specific inequality that case produced, not just to the general rule that a case can come up empty.
Carry your own answer forward Refer to the specific result you found for the case x + 1 < 0 in part C, whatever it was.
Justify your claim State the claim, then give the reason it has to be true. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Every number Marcus wrote down is arithmetically correct. Whatever went wrong is not a computation slip; it is a step that needed a condition checked before it was allowed at all.
-
Hint 2 of 4 · Part A
Look at the very first move, going from a fraction greater than to a statement with no fraction in it. Ask what has to be true about before that move is legal.
-
Hint 3 of 4 · Part C
Set aside first, then handle the two remaining possibilities for the sign of completely separately.
-
Hint 4 of 4 · Part D
Compare the assumption that opened the negative case with the inequality that case ended on. Could a single number satisfy both?
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
The second line, multiplying both sides by , is not justified: it treats as though it were positive, which is never established, and it never excludes , where the original expression is undefined.
Part B
At : , and is false, so his claimed set is disproved. At : , and is true.
Part C
.
Part D
That case assumed but, after reversing the direction, required ; no number is both less than and greater than , so the case's own requirement contradicted its own assumption, and it produced nothing.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
Every line after the second one follows correctly from the line before it: distributing, combining, and isolating are all ordinary algebra. The break is at the very first move.
That step is licensed only once the sign of is known: positive keeps the direction, negative reverses it, and is not even allowed, since the original expression is undefined there. Marcus's work fixes no sign at all and simply keeps the direction, which silently assumes , and it never sets aside before starting. Both omissions belong to the same first step.
Part B
Substitute each value into the original inequality as it was given, before any of Marcus's steps.
At :
So fails the original, even though places it squarely inside Marcus's claimed set. That is enough on its own to rule his set out.
At :
Here the number checked out and does lie in his claimed set, so this test alone does not expose anything, but the failure at already settles the matter.
Part C
Exclude immediately, since the original expression is undefined there.
Case , that is . Multiply by the positive , keeping the direction:
Combined with , this case contributes .
Case , that is . Multiply by the negative , reversing the direction:
This asks for , but the case assumed , and no number is both, so this case contributes nothing.
The full solution set is , the interval where the first case's result actually held.
Part D
The case assumed and, after flipping the direction for the negative multiplier, reduced to .
Those two conditions cannot both hold for any real number, since no number is simultaneously less than and greater than . The case is not empty because of some general fact about cases; it is empty because its own conclusion, , directly contradicts the assumption, , that opened it.
In one line
Marcus's error is the very first step: multiplying by without knowing its sign, and without excluding . Testing , which lies in his claimed set, gives , false, disproving his answer directly. The honest solve excludes , then splits on the sign of : the positive case gives , and the negative case demands while assuming , a direct contradiction that contributes nothing. The full solution set is .
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
Identifies the multiplication by x + 1 as the unjustified step, not a later line. . Worth 2 points.
States both reasons: the sign of x + 1 was never fixed, and x = -1 was never excluded. . Worth 2 points. needs an explanation, not just an answer
Part B 3 points
Substitutes both values into the ORIGINAL inequality, not into any line of Marcus's work, and evaluates correctly. . Worth 2 points.
Ties the result at x = -5 to the fact that it lies inside Marcus's claimed set, showing that set cannot be correct. . Worth 1 point.
Part C 4 points
Excludes x = -1 before splitting into the two sign cases. . Worth 2 points.
Solves both cases correctly, keeping the direction for x + 1 > 0 and reversing it for x + 1 < 0, and combines each with its own case assumption. . Worth 2 points.
Part D 4 points
States the specific contradiction: the case's own result (x > 3) conflicts with its own assumption (x < -1). . Worth 2 points. needs an explanation, not just an answer
Expresses the explanation in terms of the actual numbers from this case, not a generic statement about cases sometimes being empty. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
The same slip appears again on : a solver multiplies both sides by without checking its sign, reaching . Find the correct solution set, excluding first and splitting into cases.
The answer
.
Exclude , since the original expression is undefined there.
Case , that is . Multiplying by the positive keeps the direction.
Combined with , this case contributes .
Case , that is . Multiplying by the negative reverses the direction.
This requires , but the case assumed , and no number is both, so this case contributes nothing.
-
-
4. Two pieces joined two different ways . Foundational, 17 points. Question 4 of 5.
A compound inequality's solution set is built from its two pieces by a set operation, 'and' by intersection and 'or' by union. This question runs that idea on two ordinary pairs, and then on a pair worth simplifying carefully before combining.
- Part A.
Find every satisfying BOTH AND , or state that no such exists.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part B.
Find every satisfying OR , or state that every real number does.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Solve OR . Report the full solution set, and say what happened to the first piece.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part D.
Suppose the same two pieces from part C, and , were joined by 'AND' instead of 'OR'. State the new combined solution set, and explain in general terms why a piece reducing to a false statement erases everything under 'and' but vanishes without a trace under 'or'.
Carry your own answer forward Use your own reduction of the first piece from part C; it reduces to a false statement regardless of which connective joins it to the second piece.
Justify your claim State the claim, then give the reason it has to be true. 5 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Solve each piece completely on its own before combining anything; 'and' keeps only what both pieces share, 'or' keeps everything either piece allows, and a piece with no variable left is judged true or false outright.
-
Hint 2 of 4 · Part A
Once both pieces are solved, ask whether a number could be large enough for one requirement and small enough for the other at the same time.
-
Hint 3 of 4 · Part C
Subtract the matching variable term from both sides of the first piece and see what statement, with no variable at all, is left.
-
Hint 4 of 4 · Part D
Think of the false piece as contributing the empty set no matter which connective is used, and ask what intersecting with, versus uniting with, an empty set does to the other piece.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
No solution: the first piece needs and the second needs ; no number is both.
Part B
Every real number: the pieces are and , and every number is at least one of the two.
Part C
: the first piece reduces to the false statement , with no variable left, so it contributes nothing to the union.
Part D
Under 'and' the combined set is empty, because intersecting anything with the empty set (what a false, variable-free piece contributes) is always empty, no matter how large the other set is; under 'or' the same piece contributes nothing, because uniting a set with the empty set leaves it unchanged.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
Solve each piece on its own first. From : add , then divide by .
From : subtract , then divide by .
An 'and' keeps only numbers both pieces accept. The first piece needs above ; the second needs below . Since is not below , no number satisfies both, so the intersection is empty.
Part B
Solve each piece on its own. From : add , then divide by .
From : add , then divide by .
An 'or' keeps any number accepted by either piece. Take any real number: either it is below , in which case the first piece accepts it, or it is at least , and every such number is certainly at least as well, so the second piece accepts it. No number escapes both, so the union is every real number.
Part C
Solve the first piece. Subtracting from both sides cancels every copy of the variable.
This leftover statement has no in it, and it is false, so no value of satisfies this piece; it contributes the empty set. Uniting the empty set with the second piece leaves the second piece unchanged.
The full solution set is exactly .
Part D
The first piece still reduces to the false statement , contributing the empty set , regardless of which connective it is joined by.
Under 'and', the combined set is the intersection .
An intersection can never contain more than either piece, so intersecting with the empty set always gives the empty set, whatever the other piece happens to be: the combined solution set here is empty.
Under 'or', by contrast, the combined set was the union , and a union can never contain less than either piece, so uniting with the empty set changes nothing: the other piece survives whole. The same false, variable-free piece is fatal under 'and' and silent under 'or', because intersecting with nothing keeps nothing, while uniting with nothing keeps everything the other piece already had.
In one line
No number satisfies both and , since one needs and the other . Every real number satisfies or , since the pieces are and , which together miss nothing. reduces to the false and contributes nothing, so joined by 'or' with the solution is exactly ; joined by 'and' instead, the same false piece makes the combined solution empty, because intersecting with the empty set always empties the result while uniting with it never removes anything.
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
Solves both pieces correctly on their own. . Worth 2 points.
Checks whether a single number could satisfy both solved pieces at once, rather than assuming a band exists by default, and reports the correct conclusion. . Worth 2 points.
Part B 4 points
Solves both pieces correctly on their own. . Worth 2 points.
Checks whether every number is caught by at least one solved piece, rather than assuming a gap exists by default, and reports the correct conclusion. . Worth 2 points.
Part C 4 points
Reduces the first piece correctly to a false statement with no variable left. . Worth 2 points.
Reports the union as exactly the second piece's solution set, since the first piece contributes nothing. . Worth 2 points.
Part D 5 points
States the new combined result under AND is the empty set. . Worth 2 points.
Explains, in general set terms, why intersecting with the empty set always gives the empty set while uniting with it leaves the other set unchanged. . Worth 3 points. needs an explanation, not just an answer
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Find every satisfying BOTH AND , or state that none exist. Then solve OR .
The answer
No solution for the AND compound. for the OR compound, since the first piece contributes nothing.
For the AND: gives , so ; gives , so .
No number is both at least and less than , so there is no solution.
For the OR: subtracting from both sides of the first piece cancels every copy of the variable.
This is false for every , so the first piece contributes nothing; the union is exactly the second piece.
-
-
5. The mirror classification for ax < b, and where the mirror breaks . Reasoning, 18 points. Question 5 of 5.
The lesson proved the four cases of . This question proves the matching classification for , then asks where a tempting 'everything simply mirrors' guess actually fails.
- Part A.
Let and be any real numbers. Prove that has solution set when , when , all of when and , and when and .
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 5 points
- Part B.
Using the general result from part A, write down the solution set of directly, by matching numbers to and , without repeating the derivation. Then verify by testing and in .
Carry your own answer forward Substitute into your own formula from part A; if that part did not come out, solve directly by dividing both sides by and reversing the direction.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Before computing anything, consider the boundary case , . The lesson's own classification of gives there. If the classification of were a perfect mirror image of in every branch, what outcome would you expect at , for ? Check that prediction directly, and explain the result.
Justify your claim State the claim, then give the reason it has to be true. 4 points
- Part D.
At , reduces to and reduces to . Using your results from parts A and C together with the lesson's own rule for , state for exactly which values of the compound statement ' or ' is true, and explain your answer as the union of the two solution sets you already have.
Carry your own answer forward Combine the two conditions on b that make each direction's inequality give all of R, using the lesson's ax > b rule and your own result from part A, then check whether b = 0 could satisfy either one.
Justify your claim State the claim, then give the reason it has to be true. 5 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Run the same three-way case split the lesson already used for ax > b, but track each division's direction carefully, since this inequality points the other way.
-
Hint 2 of 4 · Part A
Handle a > 0 and a < 0 exactly as the lesson did, then check the a = 0 branch: which sign of b now makes the leftover statement true?
-
Hint 3 of 4 · Part C
Write down what a perfect mirror would predict first, then actually substitute a = 0 and b = 0 into ax < b and see what statement comes out.
-
Hint 4 of 4 · Part D
A value of b belongs to the union exactly when it satisfies at least one of the two separate conditions on b; write down both conditions and combine them.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
True for every such , : dividing by a positive keeps the direction, dividing by a negative reverses it, and at the inequality collapses to , true exactly when and false when .
Part B
. At : , and is false, correctly excluded. At : , and is true, correctly included.
Part C
A perfect-mirror guess predicts all of , but at becomes , false for every , so the outcome is , the same as , not its opposite.
Part D
The compound ' or ' is true exactly when : holds for and holds for , and their union is every real number except , matching the fact that both directions are false only at the shared boundary .
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
Everything turns on the sign of , exactly as in the lesson's own classification of .
If , divide both sides by the positive number . Dividing by a positive keeps the direction.
If , divide both sides by the negative number . Dividing by a negative reverses the direction.
If , there is nothing to divide by, and the left side is for every , so the inequality collapses to a statement with no in it.
When , the claim is true, so every real number is a solution and the solution set is all of . When , the claim is false (it fails both at , where is false, and at any ), so no value of works and the solution set is .
These three cases, , , and , are exhaustive, and within the two possibilities for are exhaustive too, so the classification covers every real and , not merely chosen instances.
Part B
Here , a negative number, and . Part A gives for .
Verify both test values directly in . At : , and is false, consistent with lying below and so outside the solution set. At : , and is true, consistent with lying above and so inside the solution set.
Part C
A guess that every branch simply swaps would predict the opposite of the result at this boundary, so it would predict all of for at .
Checking directly: at , the inequality becomes
which is false for every , exactly as false as was in the lesson's own case. So the actual outcome is , the same conclusion as reached at this same boundary, not its opposite.
The reason the mirror breaks here is that and are both false statements, for the identical reason: a strict inequality never counts two equal numbers as satisfying it, whichever direction it points. So the equality boundary is on the empty-set side of BOTH classifications, and only the branches with strictly positive or strictly negative actually swap between the two families.
Part D
The lesson's rule for at gives all of (in ) exactly when , and part A's rule for at gives all of exactly when . The compound ' or ' is true for a given precisely when at least one of those two conditions on holds.
So the compound is true for every real number except . This lines up exactly with part C: at neither nor can be true, since both reduce to a false strict inequality between two equal numbers, so is the one value left out of the union, consistent with it sitting on the empty-set side of both classifications.
In one line
For : ; for : ; for : all of if , if . Substituting gives , confirmed at both test points. A naive mirror guess predicts all of at for , but the true outcome is , the same as , since and are both false. Combining both classifications' a = 0 rules, ' or ' holds exactly when , the union of and .
Another way: Check the general result against the lesson's own ax > b table
Multiply by on both sides: since , this reverses the direction and the sign of every coefficient, giving , which is exactly the lesson's own form with replaced by and replaced by . Running the lesson's table on and translating back reproduces every branch found in part A, including the a = 0 boundary.
When it is worth it As an independent check on a new classification: rather than re-deriving it from scratch, transform it into a case the lesson already proved and translate the answer back.
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 5 points
Divides by a and correctly determines the direction in each of the two nonzero-a cases. . Worth 3 points.
Handles the a = 0 branch correctly, splitting on the sign of b and reporting all of R when b > 0 and the empty set when b <= 0, explaining why each of those two sub-cases is exhaustive. . Worth 2 points. needs an explanation, not just an answer
Part B 4 points
Correctly matches a = -11 and b = 33 to the general formula for the a < 0 case. . Worth 2 points.
Verifies both test values by direct substitution, correctly identifying which one belongs to the solution set. . Worth 2 points.
Part C 4 points
States that a naive mirror guess predicts all of R, but the actual result checked directly is the empty set. . Worth 2 points.
Explains why the mirror breaks here: 0 < 0 and 0 > 0 are both false, so b = 0 lands on the empty side of both classifications. . Worth 2 points. needs an explanation, not just an answer
Part D 5 points
States the compound is true exactly when b is not 0. . Worth 2 points.
Justifies the answer as the union of {b < 0} and {b > 0}, tying the excluded value b = 0 back to part C's finding that both directions are false there. . Worth 3 points. needs an explanation, not just an answer
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Using the general result from part A, solve by matching numbers to and , and verify your answer by testing .
The answer
; confirmed by , since .
Here and , so the formula gives
Testing : , and is true, consistent with lying below .
-