Systems in Two Variables: Free Response
5 questions in parts, 65 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. One equation, three partners . Foundational, 11 points. Question 1 of 5.
Three systems all open with the same equation, . Their partners are , then , then , so exactly one number changes from each system to the next. Call them systems (i), (ii) and (iii) in that order.
- Part A.
Decide how many solutions each of the three systems has, without solving any of them. For each verdict name the comparison that settled it, and say whether the constants had to be consulted at all.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part B.
Produce the solution set of all three systems, each in whatever form that set turns out to need, not omitting any that turns out to be empty, and test whatever pairs you produce against both equations of their own system.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Consider this one-step test: compare with , and if they differ the system has exactly one solution, while if they agree it has none. Judge the two halves separately, and say which half is a complete test read in either direction and which is not.
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 3
Nothing here has to be solved in order to be counted. Two lines are separated first by the directions they point in, and only afterwards, if those agree, by where each one sits.
-
Hint 2 of 3 · Part B
A count is not a solution set. Where one letter is left free, solve the single equation the two originals share for the other letter, and let the free one take any value at all.
-
Hint 3 of 3 · Part C
A claim of the form 'if this, then that' can be false while the claim beside it is not only true but reversible. Test each half on its own, and for the half that survives ask whether it also runs backwards.
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
System (i) has infinitely many, system (ii) has none, system (iii) has exactly one. Only (iii) is settled by the coefficients alone; (i) and (ii) share the coefficient ratio and are separated by their constants, against .
Part B
System (iii) has the single pair , system (ii) has the empty set, and system (i) has every pair for real , and among them.
- solving the shared equation for instead gives as runs over all real numbers, which lists exactly the same pairs in the other order
Part C
The first half holds in both directions when and are nonzero, so both ratios exist: differing coefficient ratios and exactly one solution are then the same condition. The second half is refuted by system (i). Agreement rules out exactly one and leaves none and infinitely many open, and only the constants choose.
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
Line each system up as with and compare matching numbers, coefficients before constants.
All three open identically, because the first equation never changes:
In systems (i) and (ii) the coefficients give , matching. In system (iii) they give , which is not .
That single mismatch finishes system (iii). Unequal coefficient ratios mean the two lines point in different directions, so they cross once and there is exactly one solution. The constants are never consulted, and could be replaced by any numbers at all without disturbing that verdict.
Systems (i) and (ii) are not finished, because agreeing coefficient ratios are compatible with two different endings. Only the constants separate them:
In (i) the constant keeps the ratio the coefficients set, so the partner is the first equation rescaled and the two describe one line: infinitely many solutions. In (ii) the constant breaks that pattern, so the two lines point the same way and sit in different places: no solution.
Part B
Take system (iii) first. Multiply by and by , so both carry :
Equal coefficients call for subtraction:
Back into : , so and . Test the pair in the two equations as they were given:
Both hold, so the solution set of (iii) is the single pair .
System (ii) needs no pair at all. Tripling and doubling gives
and one quantity cannot take two values at once, so nothing satisfies both equations. Its solution set is the empty set, which is a set and worth reporting as one; there is simply nothing inside it to test.
System (i) is different in kind, because there is nothing to pin down. Dividing by and dividing by turn both into
so the system asks one question rather than two. Solve that shared equation for :
Now may take any value at all and is forced to match it, so the solutions are exactly the pairs as runs over all real numbers. Two of them: gives and gives . Testing both against the originals:
Counting is not describing. The count says how many solutions there are; the rule says which pairs they are, and only the rule lets you produce one on demand.
Part C
Put both equations in standard form, with and nonzero so that both of the ratios the test compares are numbers at all, and with nonzero as well, as all three systems here are. Eliminate by multiplying the first equation by , the second by , and subtracting:
Now read the test's first half against that line. The ratios and differ exactly when , which is exactly when the coefficient on the left is not zero. If it is not zero, is forced to one value, back-substitution forces one matching , and the system has exactly one solution. If it is zero, the left side is zero whatever may be, so the line either fails for every or holds for every , and neither of those pins down to a single value.
So, wherever both of those ratios exist, the two conditions travel together. Differing ratios give exactly one solution, and exactly one solution can only have come from differing ratios, since agreeing ratios were just shown never to produce it. The first half is an 'exactly when', and reading it backwards is as safe as reading it forwards.
The proviso is not idle. Take beside , where , so is not a number and the two ratios cannot be compared at all. That system still has exactly one solution, . The test is silent there rather than wrong, which is why the nonzero coefficients belong in its statement.
The second half claims the remaining case is always empty, and system (i) refutes it outright: its coefficient ratios agree, and part B produced a whole line of solutions rather than none. What agreement does establish is that exactly one is off the table. Choosing between the two survivors takes the constants, which is why (i) and (ii) can share all four coefficients and still end differently.
The two halves therefore stand in quite different relations to the truth. The first needs nothing added beyond the proviso that both of its ratios exist. The second is not a weak claim but a false one.
In one line
System (i) has infinitely many solutions, system (ii) has none and system (iii) has exactly one, and only (iii) is decided by the coefficients alone. System (iii) solves to the single pair and system (ii) has the empty set, while both equations of system (i) reduce to , whose pairs , for every real , are the whole solution set, and among them. The test's first half is correct in both directions wherever both of its ratios exist, since and 'exactly one solution' are then the same condition, but the second half is false, refuted by system (i), because agreeing coefficient ratios leave none and infinitely many both open and only the constants choose.
Another way: Send every equation to slope-intercept form and read the verdict off two letters
The same three verdicts fall out of , where the slope and the intercept carry the two comparisons separately. Solving each of the four equations for :
System (i) is one line written twice, system (ii) is two lines of equal slope at different heights, and system (iii) has two different slopes.
When it is worth it When you want the picture as well as the count, since and say directly which way each line points and where it crosses the vertical axis. It costs four rearrangements rather than three comparisons, so it is the slower route when only the count is wanted.
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
Settles all three verdicts by comparison alone, without solving any system, and consults no more of each system than its own verdict actually requires. . Worth 2 points.
Gives a separate verdict for each of the three systems and names, for each one, the comparison that decided it. . Worth 1 point.
Part B 4 points
Eliminates a variable to force one coordinate to a single value, recovers the other by back-substitution, and tests the finished pair in both of that system's equations. . Worth 2 points.
Bases each description on what both equations of its own system require, rather than on either equation as it happens to be written. . Worth 1 point.
Reports each solution set in the form that set turns out to need, rather than as a count or as a short list of sample pairs. . Worth 1 point.
Part C 4 points
Argues whichever half survives in both directions, so that its condition and its outcome are shown to be the same thing rather than one merely implying the other. . Worth 3 points. needs an explanation, not just an answer
Settles the other half against the three systems, and states what its comparison does and does not establish on its own. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Three systems all open with , and their partners are , then , then . Count the solutions of each, then produce the solution set of the one with a single pair and of the one with a whole line of them.
The answer
The partners , and give infinitely many solutions, none, and exactly one. The single pair is , and the infinite set is every pair for real .
The first equation never changes, so every comparison starts from .
Against : the coefficients give , matching, and the constants give , matching too. All three ratios agree, so this is one line written twice and there are infinitely many solutions.
Against : the coefficients still match, but is not , so the lines are parallel and there is no solution.
Against : the coefficients give , which is not , so this system has exactly one solution. Doubling gives , and subtracting leaves
so and . Test : and .
For the infinitely many case, both equations reduce to , so
and the solution set is every pair as runs over all real numbers, for instance and .
-
-
2. One dial on a coefficient, one on a constant . Foundational, 12 points. Question 2 of 5.
The system together with carries two unspecified numbers. The letter stands in front of a variable and the letter stands alone on the right, and the two are not interchangeable.
- Part A.
Fix and solve the system, carrying through the work as though it were an ordinary number. Report the solution in terms of , and say how many solutions the system has for each value of .
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Here is a claim: 'the ratios and agree when , so the system has no solution when and exactly one solution otherwise.' Test it at with , and again at with , and say precisely which part of the claim survives.
Find and correct the error Say which line first goes wrong, why it is wrong, and then do it correctly. 4 points
- Part C.
Give every pair for which the system has infinitely many solutions, every pair for which it has none, and every pair for which it has exactly one. Then say which of the two letters is able to change the count and under what condition, and decide whether any pair could give exactly two solutions.
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 3
Two unspecified numbers, but they do not have equal powers. One of them can turn a line and the other can only slide it along without changing the direction it points in.
-
Hint 2 of 3 · Part A
An elimination runs perfectly well with a letter sitting where a number usually sits, provided the letter travels with every term it belongs to. A pair with that letter still inside it is a finished answer, not an unfinished one.
-
Hint 3 of 3 · Part B
A rule pairing one value with one verdict can go wrong in two quite separate ways: the value itself can be wrong, or the value can be right while the verdict fastened to it is not. Decide which of those you are looking at before rewriting anything.
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 pair is , and it is the only one for every value of : changing moves the point without changing the count.
Part B
At with there is no solution, but at with the two equations describe one line and there are infinitely many. What survives is that is the only value ruling out a single solution; what fails is the verdict attached to it.
Part C
Infinitely many exactly when and ; none exactly when and ; exactly one exactly when , whatever may be. So can change the count only while sits at , and no pair gives two.
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
With the system reads together with . Double the second equation, the letter on the right included, so both carry :
Subtracting that from removes in one step:
Nothing has been decided about , and nothing needs to be: whatever number it stands for, this line hands back a single value of . Back-substitute into :
So the solution is the single pair . Check it at one value to be sure the algebra is sound. At it gives , and
Both hold. The count is one for every , because the elimination ended at a genuine value of rather than at a bare numerical statement, and it did so without ever asking what was.
Part B
At the first equation is , and halving it gives
So the whole system is set beside , which makes the constant the only thing left in play.
With , subtracting one equation from the other leaves
a false statement with no letters in it, so no pair satisfies both and there is no solution. That is the case the claim has in mind.
With the same subtraction leaves
which is true for every pair. The two equations are one equation written twice, and the solution set is the whole line: every pair as runs over all real numbers. Two of them are and , and both fit the originals:
So the arithmetic in the claim is right and the reasoning is half right. Matching the ratios does find the only value of at which a single solution becomes impossible, and everywhere else there really is exactly one. What matching cannot do is name which of the two remaining outcomes occurs, because it never looked at the right-hand sides. The claim treats one comparison as though it had answered two questions.
Part C
Split the plane of possible pairs at the one value of that makes the coefficient ratios agree. Those ratios are and , so they agree exactly when .
Take first. The coefficient ratios then differ, the elimination ends at a genuine value of , and the system has exactly one solution. Part A is the instance , where the pair came out with still inside it: the constant moved the crossing point around the plane and never once threatened the count.
Take . The first equation becomes and the second is , so subtracting gives
At that reads , true for every pair, and the system has infinitely many solutions. At any other it reads , false for every pair, and the system has none.
Those three conditions are exclusive and between them cover every pair , so each one is not merely sufficient but necessary: a system with no solution must have and , since the other two branches deliver different counts. That is what makes the list a classification rather than three examples.
So the two letters have unequal powers. The letter controls the direction of the first line, and direction alone decides whether there is a crossing. The letter only slides the second line without turning it, which changes nothing while the directions differ, and decides everything once they agree.
Exactly two is unreachable, for a reason that has nothing to do with these particular numbers. Two different solutions would be two different points lying on both lines. But two different points determine exactly one line, so the two equations would have to describe the same line, and then every one of its points is a solution as well. Two solutions force infinitely many, so no choice of and can stop at two.
In one line
At the system solves to for every , so the count stays at one while the point moves. The claim finds the right value, , and attaches the wrong verdict to it: at with the elimination leaves and there is no solution, while at with it leaves and the solutions are every pair . In full, the system has infinitely many solutions exactly when and , none exactly when and , and exactly one exactly when ; the constant can change the count only while , and two solutions are impossible, since two shared points would force the two equations to describe one 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
Carries the unspecified constant through the elimination as an ordinary number, scaling every term of whichever equation is scaled, the right-hand side included. . Worth 2 points.
States the count of solutions alongside the pair, and says whether that count depends on the constant. . Worth 1 point.
Part B 4 points
Tests the disputed value against more than one constant, and reports what the elimination leaves behind in each case rather than only the verdict. . Worth 2 points.
Judges the claim in pieces instead of accepting or rejecting it whole, and says what its one comparison was and was not in a position to settle. . Worth 2 points. needs an explanation, not just an answer
Part C 5 points
Reaches conditions that exclude one another and between them account for every pair the two letters could form, so that each condition is necessary and not merely sufficient. . Worth 3 points.
Says which letter can change the count and under exactly what condition, and settles the question about a count of two with an argument rather than by leaving it off the list. . 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.
For the system together with , give every pair producing exactly one solution, every pair producing none, and every pair producing infinitely many.
The answer
Exactly one solution whenever , for every ; infinitely many exactly when and ; and none exactly when and .
Compare the coefficient ratios, and . They agree exactly when .
For the ratios differ, so the two lines point in different directions and cross exactly once, whatever may be. Exactly one solution, and the constant has no say in it.
For the first equation is , and halving gives
Beside , subtracting leaves
So gives and infinitely many solutions, every pair for real , while every other gives a false statement and no solution at all.
-
-
3. Two records of one Saturday . Application, 15 points. Question 3 of 5.
A roastery sells coffee in two sizes only: a 200 gram bag at 12 dollars and a 500 gram bag at 30 dollars. Saturday's sheet records two totals for the day, 3600 grams of coffee sold and 216 dollars taken, and the owner wants the two bag counts back out of them.
- Part A.
Write the system the two totals impose, saying what each letter counts, and classify it. Then say what your classification means for the owner's question.
Model the situation Name your unknown first, then write every other quantity in terms of that one letter. 4 points
- Part B.
Work out the solution set of that system and describe it in whatever form it turns out to need. If more than one Saturday fits both totals, give two of them.
Carry your own answer forward Work from the pair of equations you wrote in part A, in whatever letters you chose for the two counts. The marks here are for simplifying what you wrote and for describing whatever set it turns out to allow, not for having written the system in any particular form.
Solve and show your work Write each step out, and end with the value and its units. 4 points
- Part C.
Suppose the till had read 200 dollars instead, with the 3600 grams unchanged. Say how many Saturdays would then fit both records, establish it rather than asserting it, and say what the owner ought to conclude about the sheet.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part D.
Explain, from the two prices alone, why a takings total was always going to behave the way it did here beside a mass total, and say in both directions when a second record like it would behave differently. Then decide whether the extra note 'twice as many small bags as big ones went out' would pin the day down, and if it does, give the counts.
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
Two totals is two equations, but two equations are two constraints only when they say different things. Before counting anything, work out what a single gram of coffee costs in each of the two sizes.
-
Hint 2 of 4 · Part B
One of the two counts is not forced by the sheet at all. Let that one be free, and let the equation the two records share hand back the other count for whatever value it takes.
-
Hint 3 of 4 · Part C
Once the grams are fixed, the money is not free to be whatever it likes. Work out what the till would have had to read, and set the two figures side by side.
-
Hint 4 of 4 · Part D
A new record narrows the day only if it fails the comparison the takings record passed. Write the note as an equation in standard form and run that same first comparison on it.
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
With small bags and big bags, and . Every term of the second is of the matching term of the first, so the system is consistent and dependent, and the two totals together cannot name the two counts.
Part B
Every pair as runs over all real numbers, including 8 small bags with 4 big ones, and 3 small bags with 6 big ones.
Part C
None at all. The two records would be inconsistent, since 3600 grams at these prices is bound to bring in 216 dollars, so a reading of 200 means one of the two entries is wrong rather than that the counts are hard to recover.
Part D
Both sizes sell at 6 cents a gram, so takings are a fixed multiple of mass whatever the counts, which makes the money equation a rescaling of the mass one. Had the two per-gram prices differed, it would not be. The extra note is not such a rescaling, and it does pin the day down: 8 small bags and 4 big ones.
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
Two counts are unknown, so give each one a letter and be exact about what it counts. Let be the number of 200 gram bags sold and the number of 500 gram bags sold.
The mass record adds the grams: each small bag contributes 200 grams and each big bag 500, and the day came to 3600.
The money record adds the dollars in the same way, each bag contributing its own price.
Now classify before solving, by comparing matching numbers. The coefficients first:
and then the constants:
All three agree, so the second equation is the first one multiplied through by , constant included. Two names for one line: the system is consistent, since solutions exist, and dependent, since the second equation restates the first.
That is the answer to the owner's question, and it is not the answer the owner wanted. The takings record is not a second constraint at all. Anything the mass record allows, the money record allows too, so the sheet as it stands cannot single out one pair of counts, and no amount of algebra will make it.
Part B
Strip both equations down before describing anything. Dividing the mass equation by 100 and the money equation by 6 turns both into the same thing:
One equation in two letters leaves one of them free. Choose as the free one and solve for :
So the solution set is every pair as runs over all real numbers.
Two of those pairs are days a shop could actually have had. At the rule gives , and at it gives . Test both against the two records as they were written, not against the reduced equation:
Both Saturdays fit the sheet perfectly, and they are not the same Saturday. That is what an infinite solution set looks like from inside the shop: two genuinely different days, indistinguishable from the records kept.
The rule describes more pairs than the shop can use, since a count of bags cannot be negative and cannot be a fraction. Those restrictions come from the situation and not from the equations, which is why they narrow the list without changing the classification.
Part C
The system would now be together with . Compare the same three quantities. The coefficients are untouched:
but the constants now give
The coefficients still keep step and the constants no longer do, which is the signature of parallel lines. Elimination says the same thing out loud. Multiplying the mass equation by gives , and subtracting the new money record leaves
a false statement carrying no letters, so no pair of counts satisfies both. The solution set is empty.
There is a plainer route to the same place. Whatever the counts were, the mass record already fixes , and the takings are six times that quantity:
So 216 dollars was never in doubt once 3600 grams was recorded.
What the owner should conclude is about the sheet, not about the coffee. Saturday happened, so some pair of counts is true of it, and any honest pair of records must both hold of that pair. A system with no solution therefore reports that the two entries cannot both be honest: one of the totals was miscounted or mistyped. An empty solution set in a real situation is a finding about the data, not a failure of the method.
Part D
Work out what a single gram costs in each size:
The two sizes sell at the same rate. So for any Saturday whatever, the takings are that rate times the grams sold, and the money equation is times the mass equation term for term. It cannot be a second constraint, because it is the first constraint measured in different units.
The claim runs both ways, which is what makes it worth stating. If the two per-gram prices agree, the coefficient ratios of the two records agree, so the count is either none or infinitely many and never one. If the two per-gram prices differ, then , the coefficient ratios differ too, and the two records pin the day to exactly one pair of counts. So a takings record adds information exactly when the sizes are not priced at the same rate per gram.
Agreeing rates leave one thing still undecided, and part C is that thing: whether the recorded takings are the rate times the recorded mass. If they are, the second record is redundant, and if they are not, it contradicts the first.
Now the extra note. 'Twice as many small bags as big ones' is , that is
Set it beside and run the first comparison: against . They differ, so this record is not a rescaling of the mass record, and the two together have exactly one solution. Substituting :
so . Check all three statements about the day: grams, dollars, and is twice . The day was 8 small bags and 4 big ones.
In one line
The sheet gives and , whose second equation is of the first, so the system is consistent and dependent and cannot name the counts: its solutions are every pair , including 8 small with 4 big and 3 small with 6 big. A till reading of 200 dollars would leave and no solution at all, which would report a faulty entry rather than a hard problem. The redundancy was forced by both sizes selling at 6 cents a gram, and a takings record adds information exactly when the two per-gram rates differ; the note is not a rescaling of the mass record, so it does pin the day down, to 8 small bags and 4 big ones.
Another way: Price the whole day per gram and skip the system
Both sizes work out at 6 cents a gram, since and are both . So the takings of any Saturday are times the grams sold, whatever the counts were, and the day's money follows from the day's mass in one line:
The till agrees, which settles at once that the second record repeats the first. Had the till read anything else, the same line would have shown the two records contradicting each other, with no system written down at all.
When it is worth it Whenever two records of one event are built from rates that might be equal. Checking the rates first tells you in a single line whether the second record can narrow anything, before any letters are assigned.
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
Gives each unknown count its own letter and states which bag size it counts, then multiplies each count by that size's own mass and by that size's own price to build two separate equations. . Worth 2 points.
Classifies the system by comparing the coefficients and the constants, and translates the classification back into a statement about what the day's sheet tells the owner about the two counts. . Worth 2 points.
Part B 4 points
Bases the description on what both records require, rather than on either record as it was written down. . Worth 2 points.
Ends with a description from which a full pair of counts can be produced on demand, rather than with a bare count of the days that fit. . Worth 1 point.
Tests whatever pairs it reports against both of the original records, and gives each as a count of bags of each size rather than as a bare pair of numbers. . Worth 1 point.
Part C 3 points
Establishes the count by driving the two records down to a statement with no letters left in it, or by comparing the coefficients against the constants, rather than by asserting it. . Worth 2 points.
Says what the count it reaches means for records of something that actually happened, rather than restating that count. . Worth 1 point.
Part D 4 points
Traces the behaviour of the takings record back to the two prices themselves, and states the condition in both directions rather than only in the direction this Saturday happens to run. . Worth 3 points. needs an explanation, not just an answer
Settles whether the extra note narrows the day before using it, rather than assuming that it does, and follows through on whatever it settles. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
A stationer sells notebooks in packs of 4 at 6 dollars and packs of 10 at 15 dollars, and nothing else. A day's sheet records 84 notebooks sold and 126 dollars taken. Write the system, classify it, and describe every day that fits both records.
The answer
The system is with , consistent and dependent, because both pack sizes work out at the same price per notebook. Every pair fits, 11 small packs with 4 large ones and 6 of each among them.
Let be the number of packs of 4 and the number of packs of 10. Counting notebooks and counting dollars gives
Compare matching numbers:
All three agree, so the money record is the notebook record multiplied through by : the system is consistent and dependent. The reason is visible in the prices, since and are the same number, so both pack sizes work out at the same price per notebook.
Halving the first equation gives the shared line , so
and every pair fits. Two days a shop could have had are with , and with ; both give 84 notebooks and 126 dollars.
-
-
4. Ruling out the fourth outcome . Reasoning, 12 points. Question 4 of 5.
A list of three outcomes is only worth having if nothing can escape it, and that is a claim about every system at once rather than about any system in particular. So it has to be argued. Everything below stays in algebra, with no two lines drawn anywhere, and it finishes by locating the exact place the argument stops working.
- Part A.
Let the pairs and both satisfy . Prove that for every number the pair satisfies it as well.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 4 points
- Part B.
Assume the result of part A, whether or not you proved it. Deduce that a system of two linear equations in two variables can never have exactly two solutions, and in fact can never have any finite number of solutions greater than one.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 5 points
- Part C.
The pairs and both satisfy , whose graph is not a line. Check that they do, then compute the pair the part A construction gives at and test it in that same equation. Identify the step of part A that has no counterpart here, and say what that tells you about the list of three outcomes.
Construct a counterexample Give one specific case, and show it breaks the claim. 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 3
A completeness claim is proved by forbidding rather than by exhibiting, so start from the outcome you want to forbid: suppose a system did have two different solutions, and ask what else is then compelled to be one.
-
Hint 2 of 3 · Part A
Substitute and expand, then gather everything multiplied by the parameter into one bracket. What sits inside that bracket is a difference between two quantities whose values the hypothesis has already handed you.
-
Hint 3 of 3 · Part C
Run the same substitution on the new equation and watch what happens to the parameter. In the earlier calculation it appeared to the first power and nowhere else, and that was not an accident of how it was written.
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
It does. Substituting and gathering the terms carrying leaves , because the bracket multiplying is the value of at one of the given pairs minus its value at the other, and both of those values are .
Part B
Two different solutions of the system are two different solutions of each equation separately, so part A applies to both equations at once and every value of delivers a further pair satisfying both. Distinct values of give distinct pairs, so the count is already infinite.
Part C
The construction gives , which returns rather than . Squaring produces a term in with nothing to cancel against, so no longer comes out as a single factor. The list is a theorem about linear equations, not about equations in general.
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
Begin by reading the hypothesis as two statements about numbers rather than as two equations waiting to be solved:
Now substitute the proposed pair into the left-hand side of the equation and expand, keeping visible:
The letters and only multiply, so each distributes across its bracket and leaves standing as a plain factor. Gather the two terms carrying :
That inner bracket is now built entirely out of the two quantities the hypothesis has already evaluated. Both are , so
The left side comes out equal to the right side, so the pair satisfies the equation. Nothing was assumed about beyond its being a number, so the conclusion holds for every at once, negative values and zero included. At the pair is and at it is , so the construction includes the two pairs it started from.
Part B
Suppose a system of two linear equations in two variables has two different solutions, and , and follow where that leads.
A solution of the system satisfies each equation, so both pairs satisfy the first equation and both pairs satisfy the second. Part A therefore applies twice, once to each equation, with the same two pairs and the same . For every number , the pair
satisfies the first equation and satisfies the second, which is to say it is a solution of the system.
It remains to check that different values of really do produce different pairs, since a construction that kept handing back the same pair would prove nothing. The two starting pairs are different, so and are not both zero. If , then two different values of give two different first coordinates, because changes whenever does. If instead , then , and the same argument runs on the second coordinate. Either way, distinct values of give distinct pairs.
There are infinitely many numbers , so the system has infinitely many solutions. Having two therefore forces having infinitely many, and the same conclusion arrives from any starting count of two or more: just pick two of the solutions and run the construction. So no system can stop at exactly two, or at exactly seventeen, or at any finite total above one.
With one, none and infinitely many all realisable, and every other count now forbidden, the list of three is complete.
Part C
Check the two pairs first, since the whole part depends on their passing:
Now run the construction with and at . The coordinate differences are and , so the pair is
Test it:
which is nowhere near . The construction has failed, and it is worth being precise about where.
In part A the letter multiplied its bracket, so came apart into plus times something, with appearing to the first power and as a single factor. Squaring does not come apart that way:
The term in has no partner to cancel against, so the substituted expression is not the value at plus times a difference, and the telescoping that produced never gets started. The step with no counterpart is the distribution of the coefficient across the bracket, and what was doing the work in part A was not the shape of the construction but the fact that each variable appeared to the first power multiplied by a constant.
The consequence is not a technicality. The system together with has exactly the two solutions checked above, since substituting gives , that is , and halving every term of that leaves , whose factors give and and nothing else. Exactly two solutions, the count part B forbade. So the list of three outcomes is a theorem about linear systems specifically, and the word linear in its statement is carrying weight rather than describing the examples.
In one line
Substituting into gives , which is for every . Applying that to both equations of a system turns two different solutions into one for every value of , and distinct values of give distinct pairs because and are not both zero, so two solutions force infinitely many and no finite count above one is possible. The construction fails on : at it returns , which gives rather than , because squaring leaves a term in that nothing cancels. That equation paired with has exactly two solutions, so the three-outcome list depends on linearity and not on the construction 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
Substitutes the proposed pair into the equation and shows the left side comes out equal to the right, using what the hypothesis says about both of the given pairs. . Worth 3 points. needs an explanation, not just an answer
States the conclusion for every number the parameter could be, rather than for one convenient value of it. . Worth 1 point.
Part B 5 points
Shows that the pairs it produces are solutions of the system, not merely of one of its two equations. . Worth 3 points. needs an explanation, not just an answer
Establishes that different values of the parameter give different pairs, treating separately the case where one of the two coordinate differences is zero. . Worth 2 points. needs an explanation, not just an answer
Part C 3 points
Verifies the two given pairs and then computes and tests the new pair, rather than predicting the outcome from the shape of the equation. . Worth 2 points.
Points at the algebraic step that has no counterpart here, and names the property of the earlier equations that was doing the work. . Worth 1 point. 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.
Show that if and both satisfy , then so does the pair halfway between them. Use that to explain why a linear system cannot have exactly three solutions, and then test whether the pair halfway between and satisfies .
The answer
The halfway pair substitutes to , so it is a solution too; two different solutions of a system therefore generate more without end, and exactly three is impossible. For the halfway pair gives , not , so the argument does not carry over.
The halfway pair is , halfway in each coordinate separately. Substituting it:
Both quantities in that numerator are , so the whole thing is , and the halfway pair satisfies the equation.
Now suppose a system had exactly three solutions. Two of them are different, say and , and each satisfies both equations, so their halfway pair is a solution as well. Halve again, this time between and that new pair, and then again, and keep going. The pairs the halvings produce are
and every one of them is a solution. No two of them are the same pair: and are different, so at least one of and is not zero, and that coordinate takes a fresh value at each as shrinks. So two different solutions already force infinitely many, and there is no stopping at a count of three. Three was never possible, and neither is any other finite total above one.
For the last part, and both satisfy , and the pair halfway between them is . Testing it:
which is not . The halving argument needs each variable to appear to the first power, and here neither does.
-
-
5. Four words, two questions, and partners built to order . Reasoning, 15 points. Question 5 of 5.
Consistent and inconsistent answer one question; independent and dependent answer a second one, and only for a system that has already answered the first question yes. Reading the labels off a system is one skill. Producing a system that earns a named label is the other, and it is the harder of the two, because it means controlling the comparisons rather than merely performing them.
- Part A.
Give every one of the four labels that applies to each of these three systems, and say why one of them earns fewer labels than the other two: with ; then with ; then with .
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part B.
Refute this claim: 'dependent and inconsistent describe the same situation, since under neither of them can you name a single pair as the answer.' Refute it by producing, for one of the first two systems above, an object the other one cannot have, and by establishing that the other really cannot have it.
Construct a counterexample Give one specific case, and show it breaks the claim. 4 points
- Part C.
Taking as the first equation, write three partners for it, one for each of the three outcomes. Two conditions apply: in the first two the partner must not be a whole-number multiple of , and the third must satisfy while still giving exactly one solution.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part D.
The last condition in part C asks for two of the three ratios to agree without the system being dependent. Say what agreement between and alone does guarantee, prove it, and decide whether the guarantee runs backwards. Say also what happens to the claim when both constants are zero.
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
Sort out the order of the questions before labelling anything. Whether any pair at all satisfies both equations is settled first, and only a yes there leaves the second word with anything to decide.
-
Hint 2 of 4 · Part B
One of the two situations can be refuted by producing a single object; the other needs an argument, because not finding something is not the same as its not existing.
-
Hint 3 of 4 · Part C
Nothing requires the number joining two equations to be a whole number. Pick one that is not, scale the whole equation by it, and then decide separately what the right-hand side has to be for each of the two cases.
-
Hint 4 of 4 · Part D
Put into each equation and ask where each line meets the horizontal axis. Two ratios agreeing is a statement about those two places, and a shared place is a shared point.
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
In order: inconsistent, and no second label, because the second question is put only to a system that has a solution; then consistent and dependent; then consistent and independent, with the single solution .
Part B
The object is a solution. The pair satisfies both equations of the second system, while in the first system the quantity would have to equal and at the same time.
Part C
For instance gives infinitely many, gives none, and gives exactly one, at , with and both equal to .
- any factor that is not a whole number will serve for the first two partners, the constant following the factor in one case and breaking it in the other; and for the third, any partner with and different from that value works, always with the solution
Part D
It guarantees consistency: both lines meet the horizontal axis at , so that point satisfies both equations. It does not run backwards, since a consistent system can have those two ratios disagree. With both constants zero the ratio is not a number, but the cross-multiplied form still applies.
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
Answer the first question for each system before reaching for a second word.
For with , the coefficient ratios are and , agreeing, while the constants give , which does not. Coefficients in step and constants out of step is the parallel case, so there is no solution and the system is inconsistent. Now the second question has nothing to work on: independent and dependent are two ways for a system to have solutions, so a system with none earns neither. It keeps one label, not two.
For with , all three comparisons agree at , since , and are the same number. The partner is the first equation multiplied through by , so the two describe one line. Solutions exist, so the system is consistent, and the second equation restates the first, so it is dependent.
For with , the coefficient ratios are and , which differ, so there is exactly one solution and the system is consistent and independent. Finding it: from the first equation gives
so , and fits both, since and .
The four words are not four cases in a row. They are answers to two questions asked in order, and the second question is only reached when the first is answered yes.
Part B
The claim leans on the two systems failing to name one pair, which is true of both, and slides from there to their being the same situation, which is not. Find something one has and the other cannot.
Take with and produce a solution outright. Setting in the first equation gives , so try :
Both hold, so this system has a solution, and part A said it has a whole line of them. Failing to name one pair here is not a shortage of answers but a surplus.
Now with , where no amount of searching would settle anything, since not finding a solution is not the same as there being none. Argue instead. Doubling the first equation gives , and multiplying the second by gives . Both moves are reversible, so any pair satisfying the originals satisfies these. But then the one quantity takes the value and the value at once, and a number has one value. No such pair exists.
So the two situations are opposites dressed alike. One has too many solutions to name a single answer; the other has none at all. That is exactly why dependent sits under the heading consistent, beside the one-solution case, rather than beside the inconsistent one.
Part C
Build the first two partners together, since they differ only in one number. Multiplying by , a factor that is not a whole number, gives the left side and the constant . So
is the same line as the first equation and produces infinitely many solutions, while
keeps that left side and breaks the constant, giving parallel lines and no solution. Check the ratios of the second one: and agree, and does not.
The third partner is built to a specification instead. It has to make equal , which multiplies out to , so has to be twice . Take and , making that shared ratio , and then choose so the middle ratio breaks step: gives , which is not . The partner is
Since its coefficient ratios differ from the first equation's, the system has exactly one solution. Halving gives , and subtracting leaves
Test : and . So two of the three ratios agree here and the system is still as far from dependent as it could be.
Part D
Suppose and are not zero and that , calling that shared value . Ask each equation where its line crosses the horizontal axis, by setting :
Those two numbers are the same, because and give
So the single pair satisfies both equations, and the system is consistent. The guarantee is real and it is useful: part C's third partner has , and was exactly the solution found there, produced without solving anything.
What the agreement does not do is choose between the two consistent cases, since it says nothing about the coefficients. If joins the pattern, all three ratios agree and the system is dependent. If it does not, the system has exactly one solution, and that solution has to be the shared crossing point already named.
The guarantee does not run backwards. The system with from part A is consistent, and its two ratios are and , which disagree. So consistency does not force the agreement, and the implication holds in one direction only. Reading it as an 'exactly when' would be the mistake.
With the ratio is not a number at all, so the claim as stated cannot even be tested. The conclusion survives anyway, by a different route: both equations are then satisfied by , so the system is consistent. Multiplying out repairs the statement, since becomes , which reads here and is perfectly true. The cross-multiplied form says the same thing wherever the ratios exist and keeps saying it where they do not.
In one line
The first system is inconsistent and earns no second label, the second is consistent and dependent, and the third is consistent and independent with the solution . Dependent and inconsistent are opposites rather than synonyms: satisfies both equations of the dependent system, while in the inconsistent one would have to be and at once. Built to order beside , the partner gives infinitely many solutions, gives none, and gives exactly one, at , despite and both being . That agreement guarantees consistency, since both lines cross the horizontal axis at , but the guarantee does not run backwards, and when both constants are zero it survives only in the cross-multiplied form .
Another way: Compare products instead of ratios, and the zero cases look after themselves
Every comparison in this question is between two fractions, and a fraction needs a nonzero denominator. Multiplying out removes that worry: compare with in place of with , and likewise with .
Take beside . The constant ratio is not a number, so the usual test cannot even be run, but the products can:
Every comparison holds, and the system is dependent: the second equation is three times the first, and every pair on satisfies both.
When it is worth it Whenever a coefficient or a constant is zero, which is exactly where the ratio form stops being defined, and whenever you would rather multiply than divide. It is also the form to state a classification in, since it needs no side conditions.
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
Attaches labels by answering two separate questions in order, rather than by treating the four words as one flat list of four possibilities. . Worth 2 points.
Says why the second question is not put to one of the three systems, rather than only noting that it received fewer words. . Worth 1 point.
Part B 4 points
Produces one specific object for the system that has it, and verifies it against both equations of that system rather than asserting that it exists. . Worth 2 points.
Establishes that the system lacking that object really lacks it, by deriving a contradiction from any supposed one, rather than by reporting that a search turned nothing up. . Worth 2 points. needs an explanation, not just an answer
Part C 4 points
Produces two partners that meet the stated restriction, each delivering the outcome it was asked to deliver. . Worth 3 points.
Checks the third partner against both of the ratios the condition names and finds its solution, rather than offering it untested. . Worth 1 point.
Part D 4 points
Proves the guarantee by producing a pair and showing it satisfies both equations, rather than by citing a row of the classification table. . Worth 3 points. needs an explanation, not just an answer
Settles the converse rather than leaving it open, and says what becomes of the statement when a denominator is zero. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Label paired with , and then paired with . Then write a partner for whose ratio equals its ratio and which nevertheless gives exactly one solution, and give that solution.
The answer
The first pairing is consistent and dependent, the second is inconsistent with no second label, and is a partner for with and both equal to and a single solution, .
For with , compare all three: , and are all . The partner is the first equation multiplied by , so the system is consistent and dependent.
For with , the coefficients still agree at while does not, so the lines are parallel and the system is inconsistent, earning no second label.
For the partner, the condition asks for , so must be three times . Take and , and choose the middle coefficient to break step: is not , so
works. The coefficient ratios differ, so there is exactly one solution, and it is the shared crossing point on the horizontal axis, . Test : and .
-