Polynomial Long Division: Free Response
5 questions in parts, 58 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. A forecast, a division, and the reason it ends . Foundational, 10 points. Question 1 of 5.
The division algorithm makes two promises at once: an identity saying dividend equals divisor times quotient plus remainder, and a degree condition saying the work has finished. Some of what the answer will look like is settled by the two degrees and the two leading terms before a single subtraction happens. Work throughout with and .
- Part A.
Without dividing, give the degree of the quotient and its leading coefficient, and list every degree the remainder is permitted to have.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Now carry the division out. Report the quotient and the remainder, and confirm the pair by expanding.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part C.
Explain why the loop is guaranteed to stop after finitely many passes, and why its stopping test compares degrees rather than comparing the two expressions' values at particular numbers.
Explain why it works A sentence or two. Reasons, not steps. 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 of the three things asked for in the opening part are settled by the degrees and the leading terms alone, before any subtraction happens. The third is settled by the rule that tells the loop when to halt.
-
Hint 2 of 4 · Part A
Degrees add when polynomials multiply, so taking the divisor's degree away from the dividend's leaves the quotient's. Then ask what the halting rule permits a finished leftover to look like.
-
Hint 3 of 4 · Part B
Every pass divides the current leading term by , and the whole product of that term with the divisor comes off, all three of its terms at once. The sign traps sit in the middle column.
-
Hint 4 of 4 · Part C
Ask what the subtraction in a single pass was engineered to destroy, and what that guarantees about the sequence of degrees. For the second half, weigh a linear expression against a quadratic one at and again at .
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 quotient has degree and leading coefficient . A nonzero remainder here has degree or degree , and the remainder is also permitted to be the zero polynomial.
Part B
The quotient is and the remainder is .
Part C
Each pass cancels the working remainder's leading term, so its degree strictly drops, and a strictly falling list of whole numbers has to stop. Degree is the measure because numerical size moves with : a linear expression outweighs a quadratic one at some inputs and not at others, while a degree never changes.
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
Both facts about the quotient come from the two degrees and the two leading terms, so neither costs a subtraction.
Degrees add when polynomials multiply, and the product has to carry the dividend's leading term, because the remainder is too low in degree to interfere with it.
The same matching fixes the leading coefficient. The leading term of is times the leading coefficient of times , and that has to be .
The remainder is governed by the other promise. The loop halts when the working remainder is the zero polynomial or its degree has fallen below , so exactly three finishes are legal: a linear remainder, a nonzero constant remainder, or the zero polynomial. All three are finished answers, not failures.
Part B
Both polynomials are already in standard form with every power present, so no placeholder column is needed.
First pass. The two leading terms force the first quotient term, , and
Subtracting that entire product leaves
Watch the middle column: subtracting adds to the that was there.
Second pass. , and . Subtracting leaves
Third pass. , and . Subtracting leaves
of degree , below the divisor's degree , so the loop stops. Collecting the three recorded terms gives the quotient , and the last line is the remainder.
Check by expanding:
and adding restores exactly.
Part C
Look at what one pass does. The quotient term is chosen so that times the divisor's leading term equals the working remainder's leading term, so the subtraction destroys that leading term exactly. Every other term of is times a lower term of , so it sits below that degree, and so does every other term of the working remainder. Nothing at the top degree survives.
So the degrees of the successive working remainders form a strictly decreasing list of whole numbers. Such a list cannot run forever: it is bounded below by and each step goes down by at least one. After at most passes, which is for this division, the stopping condition must be met.
The test itself cannot be about numerical size, because a polynomial's size moves with . Compare a linear expression with this divisor at two inputs:
A rule phrased in terms of values would call the same division finished at one input and unfinished at another, and would never settle anything. Degree does not move with , so a polynomial either passes the test or fails it once and for all. That is what lets the loop halt, and it is what makes the answer unique.
In one line
Before dividing: the quotient has degree and leading coefficient , and the remainder must be linear, a nonzero constant, or the zero polynomial. Dividing gives . The loop had to stop because each pass cancels the working remainder's leading term, so the degrees fall strictly and cannot fall forever, and the halting test is written in degrees because numerical size depends on the input while degree does not.
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
Gets the quotient's degree from the difference of the two degrees and its leading coefficient from the ratio of the two leading coefficients, with no division carried out. . Worth 2 points.
Gives every finish the stopping condition allows the remainder here, not a subset of them. . Worth 1 point.
Part B 3 points
Runs the loop with each quotient term taken from the two leading terms and the entire product subtracted each pass, stopping only once the working remainder falls below the divisor's degree. . Worth 2 points.
Confirms the reported pair by expanding the divisor times the quotient, adding the remainder, and comparing the result with the dividend term by term. . Worth 1 point.
Part C 4 points
Argues that each pass strictly lowers the degree of the working remainder because the quotient term was chosen to cancel its leading term, and concludes from that a strictly decreasing list of whole numbers has to terminate. . Worth 3 points. needs an explanation, not just an answer
Says why the stopping test is stated in degrees rather than in numerical size, naming what changes with the input and what does not. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Forecast the degree and leading coefficient of the quotient for divided by , then carry the division out and check your pair by expanding.
The answer
The quotient has degree and leading coefficient , as forecast: it is , with remainder .
The forecast: and the leading coefficient is . The remainder must be linear, a nonzero constant, or zero.
The dividend skips , so open that column first:
First pass: , leaving . Second pass: , leaving . Third pass: , leaving
That has degree , so the loop stops. Checking,
and adding restores .
-
-
2. Gaps on both sides of the bracket . Foundational, 11 points. Question 2 of 5.
A tableau is column bookkeeping, so a power that never appears still needs a column held open for it. Here and , and gaps occur on both sides of the division sign.
- Part A.
Write both polynomials in the form the tableau needs, then divide by and report the quotient and the remainder.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part B.
The termination argument promises only that a pass lowers the working remainder's degree by at least one, not by exactly one. Explain how a single pass can lower it by more than that, and say what such a pass leaves behind in the quotient.
Explain why it works A sentence or two. Reasons, not steps. 3 points
- Part C.
A classmate says that dividing a degree- polynomial by a degree- polynomial always takes exactly four passes of the loop, one for each power the quotient spans. Decide whether that is right, and justify your verdict.
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 powers never appear in the dividend, and the divisor is missing a power of its own. Settle what each of those gaps has to become before any column is subtracted from another.
-
Hint 2 of 4 · Part A
After a subtraction, read off which power the working remainder actually starts with, and take the next quotient term from that leading term rather than from the power you were expecting to see there.
-
Hint 3 of 4 · Part B
Write down the second coefficient of the product being taken away and set it beside the second coefficient of what it is taken from. Nothing in the construction forces those two numbers to differ.
-
Hint 4 of 4 · Part C
Count the passes you actually made in the first part, then count the powers the quotient you reported spans. If those two counts differ, the claim is already settled.
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 the dividend written and the divisor , the quotient is and the remainder is .
Part B
Only the leading column is engineered to empty. The next one down empties too whenever the working remainder's second coefficient happens to match the product's, and then the degree falls by two or more. The quotient records the skip as a coefficient of zero on every power no pass started from.
Part C
It is wrong. Every pass writes one quotient term whose coefficient cannot be zero, and the passes work at strictly decreasing degrees, so the number of passes is the number of nonzero coefficients in the quotient. Four is a ceiling here, not a quota, and the count falls short of it whenever the quotient has a zero coefficient.
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 dividend skips and , and the divisor skips , so every one of those powers gets an explicit zero coefficient before the first pass.
First pass. , and . That product has nothing at all in the column, so its second term has to be written under and not under . Subtracting leaves
The column came out empty, and the column, which was holding , is where the landed. Without that open column there would have been nowhere to put it.
Second pass. , and . Subtracting leaves
Third pass. , and . Subtracting leaves
of degree , below the divisor's degree, so the loop stops. The three recorded quotient terms are , and . Checking,
and adding rebuilds the dividend.
Part B
Take one pass in general. Let the working remainder be with leading term and second term , and let the divisor be with leading term and second term . The pass uses and subtracts .
The leading terms were chosen to cancel, so the column always empties. One column down nothing was arranged at all: the coefficient left there is
Nothing forces that number to be nonzero. When it happens to vanish, the column empties as well and the degree falls by at least in that single pass.
The quotient records what happened. Each pass writes exactly one term, and the power it writes on is fixed by the leading term the pass started from. If no working remainder ever leads with , no pass ever writes on , so the quotient carries a zero coefficient there. In the division above the first pass left both the and the columns empty, so the second pass started at instead of , and the quotient reads
That zero is not a defect any more than the in a numeral like is.
Part C
Count what a pass produces. Each pass writes exactly one term into the quotient, with coefficient , where is the leading coefficient of the working remainder and that of the divisor. Neither is zero, so the coefficient a pass writes is never zero. And the passes work at strictly decreasing degrees, so no two of them write on the same power.
That makes the count exact in both directions: every pass contributes one nonzero coefficient of the quotient, and every nonzero coefficient of the quotient came from some pass. So the number of passes is the number of nonzero coefficients, not the number of powers between the quotient's degree and its constant term.
Here the quotient has degree , which allows four coefficients, so four passes is a ceiling. The division in part A reaches it only if all four are nonzero, and it does not: its degrees ran
three passes rather than four, because the first pass left two columns empty at once. The classmate's rule would have predicted four and been wrong on the very first example.
In one line
Written for the tableau, the dividend is and the divisor ; the division gives quotient and remainder . A pass can lower the degree by more than one, because only the leading column is engineered to empty and the next one may empty by coincidence, and the quotient then carries a zero coefficient on the skipped power. So the classmate is wrong: the number of passes is the number of nonzero coefficients in the quotient, here three rather than four.
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
Opens a column with an explicit zero coefficient for every power the dividend skips, and treats the divisor's own missing power the same way. . Worth 2 points.
Produces a quotient and a remainder whose expansion rebuilds the dividend, with each pass subtracting the entire product and each product's terms written under the powers they carry. . Worth 2 points.
Part B 3 points
Explains that only the leading column is forced to cancel and that the next one down can cancel by coincidence, so the degree may fall by more than one in a single pass. . Worth 2 points. needs an explanation, not just an answer
Says what a drop of more than one leaves behind in the quotient, naming both the coefficient it produces and which powers carry it. . Worth 1 point.
Part C 4 points
States a verdict and supports it by tying the number of passes to the quotient's nonzero coefficients rather than to the range of powers the quotient spans. . Worth 3 points. needs an explanation, not just an answer
Backs the verdict with a specific division, or with an exact description of one, rather than only asserting what could happen in principle. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Divide by , writing both polynomials for the tableau first, and say how many passes the loop took and why that count is not the one the quotient's degree suggests.
The answer
Quotient , remainder , in three passes rather than four, because the quotient's coefficient is zero and no pass writes a zero coefficient.
The dividend skips and the divisor skips , so write
First pass: , leaving , which has degree rather than . Second pass: , leaving . Third pass: , leaving
So the quotient is and the remainder is , reached in three passes. The quotient has degree and so spans four powers, but its coefficient is zero: the first pass emptied the and columns together, so no pass ever started at and none ever wrote on .
-
-
3. Recovering a height that was never measured . Application, 13 points. Question 3 of 5.
A shop cuts rectangular blocks on a machine whose single dial reading is centimetres, set large enough that every measurement below comes out positive. Every block in the run stands on the same rectangular base, of area square centimetres, and the shop's records list only each block's volume. A height that was never written down has to be recovered from those two figures.
- Part A.
The first block has volume cubic centimetres. Find an expression for its height, and say what your working establishes about the base area and the volume.
Write the expression An equation or an expression is enough here. Show how you built it. 5 points
- Part B.
A second block, on the same base, has volume cubic centimetres. Divide again, and say what your result reports about a height for this block written as a polynomial in .
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part C.
Explain how one division decides, once and for all, whether a given base area can carry a polynomial height for a given volume. Your explanation should say why a single division settles it, rather than leaving open the chance that some other height would have worked.
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
Volume is base area times height, so the height is the polynomial the base area must be multiplied by. That turns each part of this question into a division with the base area as the divisor.
-
Hint 2 of 4 · Part A
Run the loop until the working remainder falls below degree , and pay attention to what the last subtraction leaves. Multiplying your answer back by the base area is the quickest confirmation.
-
Hint 3 of 4 · Part B
Keep the divisor from the previous part. The informative part of this answer is not the quotient but whatever survives the final subtraction, so report both and then read the survivor.
-
Hint 4 of 4 · Part C
Suppose a polynomial height did exist. Write down the sentence it would satisfy, notice that the sentence also keeps both of the division algorithm's promises, and then use what those two promises pin down between 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
The height is centimetres. The division came out exactly, with remainder , so the base area is a factor of the volume.
Part B
The division gives quotient with a leftover of , so the base area is not a factor of this volume and no polynomial in gives the block's height.
Part C
Division returns exactly one pair keeping both promises. If , the quotient is a polynomial height. Any polynomial height would pair with a leftover of , so uniqueness forces it to be the pair the division already returned. A polynomial height therefore exists exactly when the division leaves nothing over.
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
Volume is base area times height, so the height is whatever the base area has to be multiplied by to produce the volume. That is a division, with the base area as the divisor.
First pass. , and . Subtracting leaves
Second pass. , and . Subtracting leaves
Third pass. , and . Subtracting leaves , so the loop ends on the zero polynomial and the division is exact.
The height is centimetres. A zero remainder is what licenses the word factor here: the identity has no leftover term, so the base area divides the volume exactly. The units agree as well, since square centimetres multiplied by centimetres give the cubic centimetres a volume is measured in.
Part B
Same divisor, same loop.
First pass. , and subtracting leaves
Second pass. , and subtracting leaves
Third pass. , and subtracting leaves
a constant, of degree , which is below the divisor's degree , so the loop has finished.
Read that as the shop would. Standing centimetres of height on the given base accounts for all but cubic centimetres of the recorded volume, at every dial setting. Since the leftover is not zero, the base area is not a factor of this volume, and the height is not any polynomial in .
Part C
Write for the base area and for the volume, and run the division once, producing
One direction is immediate. If then , so the quotient is a polynomial height and the question is answered yes.
The other direction is where uniqueness does the work. Suppose some polynomial were a height, so that . Write that as
That pair satisfies the identity, and its leftover is the zero polynomial, which the stopping condition explicitly allows. So keeps both promises. But exactly one pair keeps both promises, and the division already produced one, so and .
Put the two halves together and the test is a genuine both-ways statement: a polynomial height exists exactly when the division leaves no remainder. That is why one division is enough. A nonzero leftover does not mean this attempt failed and a cleverer one might succeed; it means no polynomial height exists at all, because any that did would have been forced to be the one already on the page.
In one line
The first block's height is centimetres, since with nothing left over. The second gives , so its height is not a polynomial in . One division settles either case, because the quotient and remainder are unique: a polynomial height would pair with a leftover of zero, so it would have to be the quotient the division already returned, and a polynomial height therefore exists exactly when the division comes out exact.
Another way: Match coefficients instead of dividing
Assume the height is a quadratic, , and expand the product of the base area with it: has coefficients , , , and from the top down. Setting those against gives , then , then from the first three, and the last two become checks: and . Both hold, so the height is and the fit is exact. Had either check failed, no quadratic height would exist.
When it is worth it When the quotient's degree is small and known in advance, or when you want the exactness to show up as a pair of equations that either agree or do not, rather than as a final subtraction.
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
Sets the height up as the result of dividing the recorded volume by the base area, rather than subtracting the two or multiplying them. . Worth 2 points.
Carries the division through to a working remainder the stopping condition accepts, with every pass subtracting the entire product. . Worth 2 points.
Reports the height with its units, and says what the leftover the division produced establishes about the base area and the volume. . Worth 1 point.
Part B 3 points
Divides the second volume by the same base area and reports the quotient together with the leftover, rather than the quotient alone. . Worth 2 points.
Reads the leftover back into the situation, saying what it establishes about the base area and the volume, and draws the consequence for a height written as a polynomial. . Worth 1 point.
Part C 5 points
Argues from the uniqueness of the quotient-and-remainder pair that any polynomial height would have to coincide with the one the division produced, so a nonzero leftover leaves no room for one. . Worth 3 points. needs an explanation, not just an answer
States the resulting test in both directions, saying what an exact division supplies and what only an exact division permits. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Blocks in a second run stand on a base of area square centimetres. Find the height of the block whose volume is cubic centimetres, then decide whether a block of volume cubic centimetres can stand on that base with a polynomial height.
The answer
The first height is centimetres. The second block cannot stand on that base with a polynomial height: the division leaves over.
For the first volume, dividing by gives , then , then as quotient terms, and the last subtraction leaves :
So the height is centimetres.
For the second, the same divisor gives quotient terms , then , then , and the final subtraction leaves , of degree :
The leftover is not zero, so the base area is not a factor and no polynomial height fits. By uniqueness there is nothing further to try: a polynomial height would have had to be the quotient above, paired with a leftover of zero.
-
-
4. Two true sentences, one finished division . Reasoning, 12 points. Question 4 of 5.
Both of these hold for every value of , as expanding either one confirms: and . Only one of them reports what long division returns for divided by .
- Part A.
Say which of the two identities reports the quotient and the remainder, and say what disqualifies the other.
Justify your claim State the claim, then give the reason it has to be true. 3 points
- Part B.
For each of the two leftovers, decide whether one further copy of the divisor can be taken out of it, and carry out any such step that is available. Do not run the tableau.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part C.
Explain in general why a true identity can fail to report the quotient and the remainder, describe what to do to any such identity to reach the pair that does report them, and say why that repair always finishes.
Explain why it works A sentence or two. Reasons, not steps. 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
Expanding settles nothing here, since both lines are correct arithmetic. What separates them is the other promise the division algorithm makes, the one that says the work has finished.
-
Hint 2 of 4 · Part A
Set the degree of each leftover beside the degree of the divisor, and ask of each whether another copy of the divisor could still be taken out of it.
-
Hint 3 of 4 · Part B
Write the larger leftover as one copy of the divisor plus whatever is then left, substitute that back in, and look at where the extra copy has to go for the sentence to stay true.
-
Hint 4 of 4 · Part C
Try adding some multiple of the divisor to the leftover while taking the same multiple away from the quotient, and see what the identity does. Then ask what the degree condition rules out.
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 first one, giving quotient and remainder . Its leftover has degree , below the divisor's degree , so the division has finished. The other leftover has degree , which still contains a copy of the divisor, so that line records an unfinished division rather than its output.
Part B
Only the degree- leftover admits the step: , and moving that copy across gives quotient with left. The degree- leftover admits none.
Part C
The identity alone has infinitely many solutions: for any polynomial , the pair satisfies it too. Only the degree condition cuts the list to one. To repair a pair, keep taking copies of out of the leftover and adding them to the quotient; each step lowers the leftover's degree, so the repair stops.
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
Both lines are correct as algebra, so expanding them can never separate them. What separates them is the second promise: the leftover must be the zero polynomial or of degree below the divisor's.
The first leftover passes that test and the second does not. A leftover of degree has not finished paying: a copy of the degree- divisor can still be taken out of it, which is precisely what the loop's stopping condition is watching for.
So the first identity is the division's output, with quotient and remainder . Notice what makes this a decision rather than a preference. At most one pair can keep both promises, so once the first line is seen to keep them, the second is ruled out without any further inspection. Uniqueness is what turns a degree check into a verdict.
Part B
A leftover of degree still contains a copy of a degree- divisor, so split it into that copy plus whatever remains.
Substitute that into the identity it belongs to and the divisor appears twice:
The first two terms share the factor , so collect them:
The bracket is , so the identity has become . The extra copy moved out of the leftover and into the quotient, which is exactly what one pass of the loop does, and the new leftover has degree , so the division is now finished.
The other leftover admits no such step. Taking a copy of the divisor out of would need a quotient term equal to , which is not a polynomial term at all, so there is nothing to move and nothing to gain.
Part C
The identity by itself is one equation in two unknown polynomials, and one equation like that leaves room to move. Take any pair that satisfies it and any polynomial , then slide across from one to the other:
The right side is again, so the new pair satisfies the identity for every choice of . There are infinitely many such pairs and nothing in the identity prefers any of them. The degree condition is what cuts that list down, and the uniqueness proof is what shows the cut leaves exactly one survivor.
The repair is one pass of the loop applied to the leftover rather than to the dividend. While the leftover's degree is at least , divide the leftover's leading term by the divisor's leading term, add that term to the quotient, and subtract that term times the divisor from the leftover. The identity survives each step, by the sliding computation above with equal to the term being moved.
And it finishes. Each step was built to cancel the leftover's leading term, so it strictly lowers the leftover's degree, and degrees are whole numbers that cannot fall forever. After finitely many steps the leftover is zero or of degree below ; at that moment both promises hold at once, so the pair on the page is the quotient and the remainder.
In one line
The first identity is the division's output, with quotient and remainder ; the second is disqualified because its leftover has the divisor's own degree. Splitting that leftover as moves one copy of the divisor into the quotient and turns the second identity into the first, while admits no such step. In general the identity alone has infinitely many solutions, since satisfies it for every polynomial ; the degree condition selects one, and repeated peeling reaches it because each peel strictly lowers the leftover's degree.
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
Names the identity that reports the division's output and disqualifies the other by the degree of its leftover, not by rechecking the arithmetic of either line. . Worth 2 points. needs an explanation, not just an answer
States the stopping condition being applied, including why a leftover of the divisor's own degree counts as unfinished. . Worth 1 point.
Part B 4 points
Splits whichever leftover admits it into one copy of the divisor plus what remains, and moves that copy into the quotient rather than discarding it, keeping the identity true throughout. . Worth 3 points.
Says why the remaining leftover admits no such step, on grounds of degree rather than on grounds of the arithmetic being awkward. . Worth 1 point.
Part C 5 points
Shows that the identity on its own has many solutions, for instance by moving a polynomial from the quotient into the leftover and checking that the identity survives. . Worth 2 points. needs an explanation, not just an answer
Describes the repair as repeatedly taking a copy of the divisor out of the leftover and adding it to the quotient, until the leftover's degree falls below the divisor's. . Worth 2 points.
Says why the repair terminates, in terms of what each step does to the degree of the leftover. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
The identity holds for every . Decide whether it reports the quotient and remainder for divided by , and if it does not, repair it without running the tableau.
The answer
It does not report them: its leftover has the divisor's own degree. Repaired, the quotient is and the remainder is .
The leftover has degree , the same as the divisor, so the identity is true but unfinished: a copy of the divisor can still be taken out of it.
Substituting and collecting the two copies of the divisor,
so the finished identity is . The new leftover has degree , below the divisor's degree, so no further copy can come out.
-
-
5. An answer that passes the wrong checks . Reasoning, 12 points. Question 5 of 5.
A student divided by and recorded three passes. First pass: quotient term , product , leaving . Second pass: quotient term , product , leaving . Third pass: quotient term , product , leaving . They reported the quotient and the remainder .
- Part A.
Find the first line of the student's work that does not follow, say what went wrong there, and give the correct quotient and remainder.
Find and correct the error Say which line first goes wrong, why it is wrong, and then do it correctly. 5 points
- Part B.
The student's reported answer passes several checks this lesson recommends: the quotient has the degree and the leading coefficient the bookkeeping predicts, and the leftover's degree is below the divisor's. Explain why those checks let the error through, and name the check that catches it.
Explain why it works A sentence or two. Reasons, not steps. 3 points
- Part C.
State exactly what a completed division has to satisfy in order to be the quotient and the remainder, and argue your statement in both directions: that the loop's output satisfies it, and that anything satisfying it is the loop's output.
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
Work down the recorded lines one at a time and stop at the first that does not follow. Everything after a bad line inherits its damage, so only the earliest fault needs diagnosing.
-
Hint 2 of 4 · Part A
Multiply the second quotient term by every term of the divisor yourself, and mind the power the divisor does not have: the honest product has a gap where the recorded line has a term.
-
Hint 3 of 4 · Part B
Ask of each check whether it is a promise every correct answer keeps, or a promise only a correct answer keeps. Those two are not the same thing, and only the second kind certifies.
-
Hint 4 of 4 · Part C
Write the two promises side by side, then ask separately whether the loop's output keeps both of them and whether two different pairs could both keep 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
The second pass. The product is , and the student's version has its last two terms written one column too far left. Corrected, the quotient is and the remainder is .
Part B
Those checks test the shape an answer must have, not the identity it claims. They are conditions the true pair meets, so failing one proves an error while passing them all proves nothing. Only expanding and comparing it with the dividend tests the claim itself, and that is where this answer fails.
Part C
A pair is the quotient and remainder exactly when and also or . Forward, the loop's output keeps both, by its invariant and by its stopping rule. Backward, at most one pair keeps both, so anything that does is that output. Either promise alone is kept by many pairs.
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
Check the passes in order and stop at the first that does not follow.
The first pass is sound: , and , whose subtraction leaves exactly the line the student wrote.
The second pass is where it breaks. The quotient term is right, but the product is not:
The student wrote , which is that product with its last two terms shifted one column to the left. The divisor has no term, so its product with has no term, and skipping that empty column is what pushed both of the remaining terms one place to the left.
Redo from there. Subtracting the correct product from leaves
Third pass: , and . Subtracting leaves
of degree , below the divisor's degree , so the loop stops. The quotient is and the remainder is . Multiplying back,
and adding restores the dividend.
Part B
Take the checks one at a time. The quotient's degree should be , and has degree . Its leading coefficient should be , and it is. The leftover's degree should be below , and it is.
Every one of those is a property the correct answer has, which is why a wrong answer can have them too. They are necessary conditions: failing one proves an error, and that makes them worth running, but passing all of them certifies nothing. None of them so much as looks at the coefficients the passes produced, and this student's fault moved terms between columns without disturbing a single degree, so it slipped under every one.
The check that catches it is the identity itself. Expand the divisor times the reported quotient:
Adding the reported leftover gives , which is not the dividend: the terms already disagree, against the that should be there. Multiplying back is the one check that tests the promise the answer is actually making.
Part C
The test is the two promises taken together, and neither half can be dropped.
Forward direction. The pair the loop produces satisfies both. The identity holds because is true before the first pass, with and , and a pass adds to while subtracting from , which leaves untouched. The degree condition holds because that is the only circumstance in which the loop stops.
Backward direction. Suppose and , with both leftovers legal. Subtracting one from the other,
If and differed, the left side would be a product of two nonzero polynomials, of degree , hence at least . The right side is a difference of two leftovers, so it is zero or of degree below . No polynomial is both, so , and then follows at once.
Both directions earn their keep. Without the forward direction the test might be one nothing satisfies. Without the backward direction, passing it would certify nothing, and the whole point of the test is that it certifies. The student's answer is what happens when one promise is kept and the other is quietly broken.
In one line
The second pass is the first faulty line: , and the recorded version shifted its last two terms one column left, because the empty column that the divisor's missing leaves was skipped rather than kept open. Corrected, the quotient is and the remainder is . The degree and leading-coefficient checks let the fault through because they are conditions every correct answer meets rather than conditions only a correct answer meets; expanding against the dividend is what catches it. A pair is the quotient and remainder exactly when it keeps the identity and the degree condition together, which the loop's output does and which, by uniqueness, nothing else does.
Another way: Let the failed check point at the pass
Instead of reading the lines in order, expand for the reported pair first and subtract the dividend. The difference is , and its highest power is . Everything above therefore came out right, so the reread can begin at the column: whatever went wrong wrote into that column or below it, and no line that touched only higher columns needs looking at. That narrows the search the longer the division is.
When it is worth it When the work is long and rereading every pass is expensive, or when the recorded work is someone else's and hard to follow line by 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 5 points
Locates the first line that does not follow and names the specific fault in that line, rather than only asserting that the line is wrong or that a later line disagrees. . Worth 3 points.
Reworks the division from the faulty line onward and reports a quotient and remainder that rebuild the dividend when expanded. . Worth 2 points.
Part B 3 points
Explains that the degree and leading-coefficient checks are conditions any correct answer meets, so passing them cannot certify an answer even though failing one would condemn it. . Worth 2 points. needs an explanation, not just an answer
Names a check that tests the identity the answer claims rather than only the shape it must have, and says what its result is compared against. . Worth 1 point.
Part C 4 points
States both promises together as the test, rather than either one on its own. . Worth 2 points. needs an explanation, not just an answer
Argues the test in both directions, using uniqueness for the direction that says nothing other than the loop's output can pass it. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Divide by , then state the two-part test your answer has to pass and check it against both parts.
The answer
Quotient , remainder . It passes both parts of the test: the leftover has degree , below the divisor's , and expanding the divisor times the quotient and adding the leftover returns the dividend exactly.
The divisor skips two powers, so write it as before starting.
First pass: , leaving . Second pass: , leaving . Third pass: , leaving
of degree , below the divisor's degree , so the loop stops with quotient .
The test has two parts. The degree condition: , which holds. The identity:
and adding gives , the dividend. Both parts hold, so by uniqueness this is the quotient and remainder.
-