Synthetic Division and the Remainder Theorem: Free Response
5 questions in parts, 54 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. The same division, written twice . Foundational, 11 points. Question 1 of 5.
The last lesson divided one polynomial by another by long division. When the divisor is linear, almost everything the pen writes is forced: the powers of , the plus signs, and the staircase of subtractions all follow from the coefficients alone. This question runs one division both ways and lines the two layouts up against each other.
- Part A.
Divide by using a synthetic tableau. Write down the corner number, the top row and the finished bottom row, then report the quotient and the remainder. Confirm the pair by expanding and comparing it with term by term.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part B.
Divide by again, this time by long division, writing all three stages out in full. Then line the two layouts up: say which numbers of your long division appear in the tableau's middle row and which appear in its bottom row. Name one thing the long division writes that the tableau never does, and say why nothing was lost by dropping it.
Compare the two methods Say what each one costs you, and when you would reach for it. 4 points
- Part C.
The long division subtracts at every stage while the tableau only ever adds, yet the two agree. Explain why, in terms of what the corner number stores and what each stage actually subtracts. Then explain why the tableau opens with a bring-down rather than with a multiply-and-add, using what the first stage of your long division did.
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 3
The two layouts are not two methods. One writes every symbol out and the other keeps only the numbers, so before comparing anything, make sure you can point at where each number in one of them came from.
-
Hint 2 of 3 · Part B
Set the long division out so that each stage shows the product being subtracted on its own line. Those subtracted products are what the comparison is about, and their signs are the interesting part.
-
Hint 3 of 3 · Part C
Pick one stage and write, as a single signed number, the amount by which the next column changes. Then hunt for that same signed number somewhere in the tableau.
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
Corner , quotient , remainder .
- Reporting the single identity gives the same quotient and the same remainder in one line
Part B
The long division returns the same with remainder . Its quotient's coefficients are the first three bottom-row entries, and the coefficients of the products it subtracts are the negatives of the middle row. What it writes and the tableau drops is the powers of and the leading terms guaranteed to cancel.
Part C
Each stage subtracts times the newest quotient coefficient, which is the same as adding times it, and is what the corner holds: the sign is flipped once, when the corner is written. The bring-down is there because the divisor is monic, so the leading coefficient is divided by and arrives unchanged.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
The divisor is , so the corner number is and not . Every power from down to the constant is present, so the top row is the coefficient list as it stands, , with no placeholder needed.
Bring down the . Then and ; then and ; then and .
The dividend is a cubic and the divisor is linear, so the quotient is a quadratic: the first three bottom entries are its coefficients and the last entry stands alone as the remainder. That reads as and .
Now the check, which costs one expansion and catches nearly every slip:
Adding turns the constant into and leaves the other three terms untouched, so the right side is , which is exactly.
Part B
Set the long division out and keep each subtracted product on its own line.
The first stage divides the leading terms, , multiplies the whole divisor, and subtracts:
The second stage repeats on what is left, . Dividing leading terms gives , and
The third stage works on . Dividing leading terms gives , and
The quotient is and the remainder is , matching part A.
Now the correspondence, which is the point of the exercise, and it is a correspondence between NUMBERS: the long division writes terms, the tableau writes their coefficients. The three quotient terms , and carry the coefficients , and , which are exactly the first three entries of the tableau's bottom row, in the same order. The terms that were subtracted into the three later columns, , and , carry the coefficients , and , and those are the negatives of the tableau's middle row , so each long-division subtraction is the corresponding tableau addition.
What the long division writes and the tableau does not is, first, every power of , and second, the leading term of each subtracted product. That leading term always cancels: the quotient term was chosen for precisely that purpose, by dividing the leading terms. Writing a subtraction whose answer is known in advance to be records no information, so deleting it costs nothing. Every number that did carry information survives in one of the tableau's two lower rows.
Part C
Take one stage of the long division and look at what it does to a single column, keeping the arithmetic on numbers. Let be the newest quotient coefficient, so the quotient term at that stage is times some power of . Multiplying that term by the whole divisor produces two terms: one of the next power up, which cancels the leading term by construction and carries no information, and one of times the original power. Only the second reaches the next column, and it is subtracted there:
Subtracting is the same as adding , and is exactly the number sitting in the corner, because the corner holds the value that makes zero. So the tableau's addition and the long division's subtraction are the same operation written with the sign attached to a different object. The sign is flipped once, at the moment the corner number is written, and never again. That is why a tableau contains no minus sign of its own even though the method it abbreviates is built out of subtractions, and it is also why writing the divisor's own constant in the corner breaks the correspondence: the one flip would never have happened.
The first step is different because the first stage of the long division is different. To choose the first quotient term it divides by , and the divisor is monic, so that division is by and the leading coefficient comes through unchanged:
There is no earlier entry to multiply by the corner, and nothing to add, so the tableau simply brings the down. Every later coefficient does have an entry before it, which is why the multiply-and-add cycle starts only at the second column.
In one line
Both layouts give with remainder , and expands back to . The long division's quotient carries the coefficients , and , which are the first three entries of the tableau's bottom row, and the coefficients , and of the terms it subtracts into the later columns are the negatives of its middle row; what it writes and the tableau drops is the powers of and the leading terms guaranteed to cancel. The tableau adds because the corner stores rather than , so the single sign flip has already been paid for, and it opens with a bring-down because a monic divisor leaves the leading coefficient unchanged.
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
Puts the value that makes the divisor zero in the corner, rather than a number copied from the divisor as it is written. . Worth 2 points.
Reads the bottom row as a quotient one degree below the dividend followed by a single remainder entry, and confirms the pair by expanding . . Worth 1 point.
Part B 4 points
Carries out all three stages of the long division, subtracting the entire product each time, and arrives at the same quotient and remainder as the tableau. . Worth 3 points.
Matches the two layouts explicitly, naming which long-division numbers appear in the middle row and which in the bottom row, rather than only observing that the two answers agree. . Worth 1 point.
Part C 4 points
Locates the single sign flip at the corner and explains why one flip is enough, rather than treating the agreement as a coincidence confirmed on examples. . Worth 2 points. needs an explanation, not just an answer
Accounts for the bring-down separately, tracing it to a feature of the divisor rather than restating the rule. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Divide by with a tableau, and check the result by expanding.
The answer
with remainder .
The term is missing, so the top row needs a placeholder: , with in the corner.
Bring down the ; then and ; then and ; then and .
Expanding checks it:
and adding turns into .
-
-
2. Evaluating without building the powers . Application, 10 points. Question 2 of 5.
A polynomial has to be evaluated somewhere for almost every practical purpose, and the obvious route builds each power of the input and then multiplies it by its coefficient. The tableau reaches the same number by a different road. This question puts a count on each of them, and then asks what else the run leaves behind.
- Part A.
Let . Run a synthetic tableau with corner number and report two things: the value of , and the quotient obtained on dividing by . Say which theorem entitles you to read a value of out of that tableau at all.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
Count the cost of each route for a polynomial of degree whose coefficients are all nonzero. Route one builds from , then from , and so on up to , then multiplies each power by its coefficient and adds the results. Route two is the tableau. Give the number of multiplications each route spends as a formula in , evaluate both at , and say how the gap behaves as the degree grows.
Compare the two methods Say what each one costs you, and when you would reach for it. 4 points
- Part C.
A classmate says the tableau's lower rows are scratch work that can be discarded once the last cell is reached. Say what the intermediate bottom-row entries actually are. Then describe one question about that a single run of the tableau answers and a bare evaluation of does not.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 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
Two of these parts are about cost rather than about answers, so before counting anything, write down exactly what one column of the tableau spends: how many multiplications, and how many additions.
-
Hint 2 of 3 · Part B
The naive route does two different jobs, and they have to be counted separately: first it builds each power of the input from the one before it, and only then does it bring the coefficients in.
-
Hint 3 of 3 · Part C
Look again at what the bottom row was called in part A before its last entry was read as a value, and ask what a division supplies that a single number cannot.
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
, and the quotient is . The Remainder Theorem is what makes the last cell .
Part B
Route one spends multiplications and route two spends , so the tableau saves of them. At that is against . The saving grows without bound, and route one costs close to twice route two once is large.
Part C
They are the coefficients of the quotient on dividing by , not scratch. One run therefore also delivers , which a bare evaluation cannot supply, and that identity gives at other inputs.
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 term is missing, so the top row needs a placeholder zero in its slot: , with in the corner.
Each step is one multiplication and one addition. Bring down the ; then and ; then and ; then and ; then and ; finally and .
The bottom row starts one degree below the dividend, so the quotient is , and the last entry is the remainder . The Remainder Theorem says the remainder on dividing by is the number , so that same is the value:
The brute-force route confirms it: . A cheaper spot check is to test the identity at a convenient input. At the quotient sums to , so the identity predicts , and .
Part B
Count route one in its two stages, because they are different work. Building the powers takes one multiplication each for , which is of them. Then each of the terms needs one multiplication, which is another ; the constant term needs none. So
multiplications, together with additions to total the terms.
Route two is one multiplication and one addition per column after the bring-down, and there are such columns, so it spends multiplications and additions. The additions match, so the whole difference sits in the multiplications:
At route one spends and route two spends , a saving of . The saving is , which grows without bound, and the ratio climbs towards , so for a high-degree polynomial the naive route costs close to twice as much.
One honest caveat about the polynomial in part A. The count assumes every coefficient has to be multiplied in, and here two of them do not: the missing term makes , and . An opportunistic route one skips both of those products, though it still has to build on the way to , so it spends four power builds and three real scalings, which is rather than . The tableau still spends exactly , because it multiplies bottom-row entries by the corner and none of those entries is or . Count the trivial products or skip them as you please, but do it on both sides of the comparison; either way the tableau is ahead here, so its advantage is not an artefact of this example.
Part C
The bottom row was never two different objects. Its entries are the coefficients of the quotient on dividing by , and the final entry is the remainder, which the Remainder Theorem also reports as . So the run produces a division, and the value is the last line of it rather than the whole of it.
What that buys is the identity
which holds for every and is a genuine rewriting of . A bare evaluation returns the single number and nothing else.
One concrete question the identity settles and the number does not: what is ? Substituting into the identity, the quotient at is , so
and no fifth power of was ever formed. The identity is also a statement about at every input rather than at one: it can be expanded back to check the division, or evaluated anywhere else you need. A lone value of serves exactly one input and can be checked against nothing. The intermediate entries are the reason any of that is available.
In one line
The tableau gives with quotient , so . Building the powers and then multiplying each by its coefficient costs multiplications against the tableau's , which is against at , and the saving grows with the degree. The intermediate bottom-row entries are the quotient's coefficients, so one run hands over a whole division while a bare evaluation hands over one number.
Another way: Nest the polynomial by hand instead of drawing a tableau
Factor out of everything that carries one, repeatedly, until the polynomial is a stack of multiply-and-add steps:
Now substitute and work outwards from the innermost bracket: , then , then , then , then .
The running values are the tableau's bottom row, in order, which is what makes this the same computation. The missing term shows up as the inside the nest, exactly where the placeholder zero sat.
When it is worth it When you want the value without drawing a layout, or are evaluating in your head: each step is a single multiply-and-add, and the running values are the same numbers a tableau would have written.
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
Checks the coefficient list against every power from the leading one down before running the tableau, and carries the bring down, multiply, add cycle through to the final column. . Worth 2 points.
Reports the last cell as a value of and the earlier cells as the quotient's coefficients, and names the theorem that licenses reading a value there. . Worth 1 point.
Part B 4 points
Counts route one in two separate stages, keeping the building of the powers apart from the multiplication of each power by its coefficient, and counts the tableau per column rather than per term. . Worth 2 points.
Reports both counts as formulas in rather than only at , and describes how the difference between them behaves as the degree grows. . Worth 2 points.
Part C 3 points
Says what the intermediate bottom-row entries are, so that the run is understood to produce a division rather than a value with leftovers, instead of accepting the classmate's description of them. . Worth 2 points.
Names a concrete question the identity answers that the single number does not. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Use a tableau to find for , and report the quotient on dividing by .
The answer
, with quotient .
The term is missing, so the top row is , and the divisor puts in the corner.
Bring down the ; then and ; then and ; then and ; then and .
Direct substitution agrees: .
-
-
3. Where the rhythm comes from . Reasoning, 11 points. Question 3 of 5.
The tableau's rhythm can be memorised as a rule and used for years without ever being justified. This question asks where it comes from, by matching coefficients against a general cubic. The derivation then does a second job, because it explains what a tableau run wrongly has actually computed.
- Part A.
Let and let be any number. Suppose holds as an identity. Expand the right side, collect it by powers of , and match coefficients against . Solve the four resulting equations for , , and in that order, and say which step of the tableau each equation is.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 5 points
- Part B.
Use the recurrence you derived in part A to explain why a power missing from the dividend must be entered as a rather than skipped. Then make the point concrete. Divide by with the full top row, and run it a second time with the shortened row a student would write if the were left out. Both runs produce a quotient and a remainder. Identify what the shortened run actually divided.
Justify your claim State the claim, then give the reason it has to be true. 3 points
- Part C.
A second student divides the same by , writes the full top row with its placeholder, but puts in the corner. Their arithmetic is faultless throughout. Report the quotient and remainder they obtain, state which division their tableau has in fact performed, and say what their last cell is the value of.
Find and correct the error Say which line first goes wrong, why it is wrong, and then do it correctly. 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
An identity in is a much stronger statement than an equation: it holds for every value at once, so the two sides have to agree power by power. Everything in this question is built on that one fact.
-
Hint 2 of 3 · Part B
Count how many coefficients of the dividend the four equations consume, then count how many columns the shortened row offers. After that, test each run's output against the identity it does satisfy.
-
Hint 3 of 3 · Part C
Nothing in this second tableau is arithmetically wrong, so do not hunt for a slip. Ask instead which divisor produces that corner number, and check the student's own quotient and remainder against 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
, then , then , then . The first is the bring-down and the other three are the multiply-and-add steps, in the order the tableau performs them.
Part B
Each equation consumes exactly one coefficient of the dividend, so a skipped column feeds every later step the wrong one. The full row gives with remainder ; the shortened row gives with remainder , the correct division of by .
Part C
They obtain with remainder , which is the correct division of by . Their last cell is , not .
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
Expand the right side and collect it by powers of . Multiplying the quadratic by lifts every coefficient one degree, and multiplying it by scales it:
The statement is an identity in , which is stronger than an equation to be solved: it holds for every , so the two sides are the same polynomial and their coefficients must agree power by power. Reading them off gives four equations:
Now solve them in the order the unknowns become available, each one using the value found just before it:
Match each line to the layout. The first says the leading coefficient of the quotient is the leading coefficient of the dividend, which is the bring-down. Each of the other three takes the entry just found, multiplies it by , and adds the next coefficient of the dividend, which is the multiply-and-add step performed once per remaining column. So the rhythm was not chosen for convenience. Given the divisor , these are the only values of , , and that can make the identity true.
The cubic was only for concreteness, and nothing above used its degree. In general, write and . In the product , a given power collects from multiplying by and from multiplying it by , so the coefficient of in is . Matching it against gives
with the two boundary equations from the leading power and from the constant one. That is the bring-down followed by multiply-and-add in every degree, and the four equations above are exactly this statement at .
Part B
The four equations of part A pair off one for one with the coefficients : each step consumes exactly one of them, in descending order of degree. The tableau's columns are that pairing made visible. Leaving a column out does not tell the method that a power is absent; it shifts every later coefficient into the slot of a higher power, so each step is handed the wrong . The zero is not a formatting habit. It is the value of for that power, and the recurrence needs it.
With the full row, has coefficients , and puts in the corner:
So the quotient is and the remainder is . Expanding confirms it, since and adding gives .
With the shortened row and the same corner:
That run is not nonsense, and calling it wrong misses what happened. It is a perfectly correct division of the polynomial whose coefficients those three numbers are, namely , by :
So the shortened row answered a question nobody asked. It divided a quadratic that shares its written digits with the cubic and is a different polynomial, which is exactly the damage the missing zero does: the machine cannot see the degree, only the list.
Part C
Run the tableau they ran, with in the corner and the full row . Bring down the ; then and ; then and ; then and .
Nothing here is arithmetically wrong, and that is the whole diagnosis. The corner holds the value that makes the divisor zero, so a corner of belongs to the divisor . Their tableau is a correct division by , and the identity it produces holds:
By the Remainder Theorem their last cell is therefore , and a direct substitution agrees:
The number they wanted was , from part B. So the fault is not in the arithmetic and not in the layout: it is that the tableau silently answered the question for a different divisor, and both answers look equally plausible on the page.
In one line
Matching coefficients forces , , and , which is the bring-down followed by three multiply-and-add steps; the same matching in any degree gives . Because each equation consumes exactly one coefficient, a missing power must be entered as : the full row gives with remainder , while the shortened row gives with remainder , which is the correct division of by . A corner of gives with remainder , the correct division by , whose last cell is .
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 5 points
Expands and collects by powers of , then equates coefficients on the two sides, treating the statement as an identity in rather than as an equation holding at one value. . Worth 3 points. needs an explanation, not just an answer
Solves the four equations in the order the unknowns become available, each expressed using the one before it, and matches every equation to its step in the tableau. . Worth 2 points.
Part B 3 points
Uses the recurrence to justify the placeholder rule rather than treating it as formatting. . Worth 2 points. needs an explanation, not just an answer
Runs both tableaus correctly and identifies the polynomial the shortened row divided, rather than reporting its output as simply wrong. . Worth 1 point.
Part C 3 points
Identifies the fault as a correct division by a divisor other than the one asked for, naming that divisor, rather than as arithmetic gone astray. . Worth 2 points.
Says which input the last cell evaluates the polynomial at, connecting the corner number to the value the Remainder Theorem attaches to it. . Worth 1 point.
-
-
4. A divisor that does not fit the corner . Application, 11 points. Question 4 of 5.
The tableau was built for a divisor of the form , whose leading coefficient is . Divisors met in practice are not always monic, and offers no corner number directly. Factoring the leading coefficient out is what rescues the method, and the part worth watching is where that factor ends up.
- Part A.
Divide by . Run the tableau on the monic factor first, then convert to the divisor that was asked for. Report the quotient and the remainder for itself, and confirm the pair by expanding.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part B.
A classmate finishes the same division. They report the quotient you did, and then, reasoning that the whole tableau output has to be scaled, they halve the remainder as well. Form the pair they would report, and show by expanding that it cannot be right. Then locate the error inside the identity: follow the factor of from the monic tableau's output to the final answer, and say which term it reaches.
Carry your own answer forward Build the classmate's pair from your own part A answer rather than from a printed one. What is marked here is the diagnosis, so an arithmetic slip in part A does not stop you locating their error.
Find and correct the error Say which line first goes wrong, why it is wrong, and then do it correctly. 3 points
- Part C.
Prove the general statement behind parts A and B. Let , let be any number, and let be any polynomial. Write and for the quotient and remainder on dividing by . Show that dividing by gives quotient and the same remainder , check that the degree condition on the remainder still holds, and name the value of that equals.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 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
A divisor like this one is a constant times a monic divisor, and a constant inside a product can be moved around freely. Decide early which of the two terms of the division identity a constant is able to reach.
-
Hint 2 of 3 · Part B
Any claimed quotient and remainder can be tested in a single line by expanding. Do that first, and only then go looking for where the stray factor came from.
-
Hint 3 of 3 · Part C
Write the monic divisor as a fraction times the divisor you were given, substitute it into the identity, and change nothing else. Then watch which of the two terms the fraction ends up inside.
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
Quotient and remainder .
- Reporting the identity gives the same quotient and remainder in one line
Part B
Their pair is the correct quotient with the remainder halved to , and it expands to , which is not . The that turns into is absorbed by the quotient inside the product; the remainder is a separate added term and is never reached.
Part C
Since , the identity becomes , with untouched. It is still or a constant of degree , so it clears the divisor's degree either way, and by the Remainder Theorem .
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
Factor the leading coefficient out of the divisor: . The monic factor is , so the corner number is , the value that makes zero.
Bring down the ; then and ; then and ; then and .
So far this says , which answers a question about the monic divisor, not about . Convert by writing the monic factor as and letting the act on the quadratic beside it:
The quotient for the divisor is therefore and the remainder is . Expanding checks it:
and adding turns the constant into , returning . As a second check, the Remainder Theorem says the remainder is evaluated at the number killing the divisor, and .
Part B
Test the claim in one line, the way any proposed division can be tested. Their pair asserts that , and the product was expanded in part A:
That is not : the constant term is where has , so their identity fails by at every value of . Substituting one value makes the same point, since at their right side is while .
Now the reason, which lives in the structure of the identity rather than in the arithmetic. The monic tableau produced
and the conversion replaces by . That is now one factor of a product of three things, so it can be moved anywhere inside that product, and the natural home is the quadratic, where it halves each coefficient. What it cannot do is move out of the product and into the term added on beside it. The remainder is not a factor of anything; it is a separate summand, and no rearrangement of a product reaches it.
So exactly one of the two pieces changes under the conversion. The quotient is divided by and the remainder stays as it is.
Part C
The divisor is monic, so it is not the zero polynomial and the division algorithm applies. Dividing by it gives
where the remainder is either or has degree below the divisor's degree . In the first case it is the number ; in the second its degree is , which makes it a nonzero constant. Either way it is a number, written above.
The only step is to rewrite the divisor. Factoring out of gives , which is legitimate because , and dividing through by turns it around:
Substitute that into the identity and change nothing else. Multiplication is associative and commutative, so the constant may be regrouped with :
This is an identity of the required shape with divisor , quotient and remainder . Three things deserve checking. First, is a polynomial, since scaling every coefficient by a nonzero constant produces one; it is the zero polynomial exactly when is, and otherwise it has the same degree, because cannot turn a nonzero leading coefficient into . Second, is the same number as before, so it is again either or a constant of degree , and both of those clear the degree of ; the degree condition that makes a division finished is met. By the uniqueness of quotient and remainder from the previous lesson, this pair is therefore the answer, not merely an answer.
Third, the value. The Remainder Theorem applied at says that the remainder on dividing by is , and the work above showed that this same is the remainder for . So
the polynomial evaluated at the number that makes the divisor zero. Part A is the case , , where , the quotient was halved and the remainder stayed put.
In one line
Dividing by gives quotient and remainder , and expands back to . Halving the remainder as well produces , a different polynomial: the factor that converts into can move only inside the product, so it reaches the quotient and never the remainder. In general, dividing by with gives quotient and the same remainder, which equals .
Another way: Long division by $2x + 5$ directly
Nothing forces a linear divisor through the tableau. Long division handles as it stands, and it never produces the fraction at all. Divide leading terms, multiply, subtract, three times over:
Subtracting leaves . Then and , and subtracting leaves . Finally and , and subtracting leaves .
The quotient is and the remainder is , already expressed for the divisor asked about, with no conversion step to get wrong.
When it is worth it When the leading coefficient is awkward and you would rather avoid fractions entirely, or when you want the answer for the given divisor without a conversion step. The tableau is still faster when the divisor is monic, and it is the one that produces the quotient's coefficients directly as numbers rather than as terms you have to assemble.
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
Runs the tableau on the monic factor, using the value that makes zero as the corner number rather than a number read straight off the divisor. . Worth 2 points.
Converts the monic result to the divisor that was asked for and confirms the reported pair by expanding . . Worth 2 points.
Part B 3 points
Expands the classmate's proposed pair and compares it against , exhibiting the specific discrepancy instead of asserting that the answer is wrong. . Worth 2 points.
Traces the factor through the identity and names the one term it can reach, arguing from the structure of a product rather than from the arithmetic alone. . Worth 1 point.
Part C 4 points
Rewrites the monic divisor as a constant multiple of the given one and regroups the product so that the scaling attaches to the quotient, arguing from the identity rather than from a worked example. . Worth 3 points. needs an explanation, not just an answer
Checks that the resulting pair still satisfies the degree condition on the remainder, and identifies the remainder as a value of , saying at which input. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Divide by , reporting the quotient and remainder for that divisor.
The answer
Quotient with remainder .
The number making zero is , so run the tableau with that corner on the row .
Bring down the ; then and ; then and ; then and .
That is the division by the monic factor: with remainder . Dividing the quotient by and leaving the remainder alone gives the answer for , and expanding confirms it:
Adding the remainder turns the constant into , which returns the dividend.
-
-
5. What the last cell knows . Reasoning, 11 points. Question 5 of 5.
One number sits at the end of every tableau, and it wears two hats: it is the remainder of a division, and it is a value of the polynomial. This question asks where that double life comes from, what each of the two tools is still needed for, and how much of a polynomial a single remainder can pin down.
- Part A.
Let be any polynomial and any number. Starting from the division of by , prove that the remainder equals . Your argument must establish that the remainder is a constant before treating it as a number, and it must not divide by zero anywhere. Say explicitly where a reader might wrongly suspect that it does.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 4 points
- Part B.
Two students draw opposite conclusions from part A. The first says the Remainder Theorem makes the tableau pointless, since the remainder can be had by evaluating. The second says the tableau makes the theorem pointless, since the remainder can be read off the last cell. Decide what each of them has overlooked, and give one specific task that each tool performs and the other does not.
Justify your claim State the claim, then give the reason it has to be true. 4 points
- Part C.
Here is a claim: two polynomials that leave the same remainder on division by must be the same polynomial. Construct two polynomials of different degrees, neither of them constant, that refute it. Then state the exact condition on two polynomials that makes their remainders on division by agree, and explain why your construction yields as many refutations as you like.
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
The whole question rests on one identity, the one produced by dividing by . Write it down before anything else and keep it in view: each part below is a different reading of that same line.
-
Hint 2 of 3 · Part B
Each student has noticed something true and then drawn a conclusion about what may be thrown away. For each of them, ask what the discarded tool produces that the one they kept does not.
-
Hint 3 of 3 · Part C
A remainder here is a value, so two polynomials sharing one are two polynomials agreeing at a single input. Build the second from the first by adding something that vanishes at that input.
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
Dividing gives , and is either or of degree , so either way it is a number . The identity holds at every , and at the product term vanishes, leaving . The suspicious step, substituting the value that kills the divisor, multiplies by zero rather than dividing by it.
Part B
Both are wrong. The tableau also returns the quotient, which an evaluation does not, and it beats the power-by-power route on multiplications. The theorem's job is different: it proves that the last cell is at all, for every polynomial and every , and its proof uses no tableau.
Part C
and both leave remainder . Two polynomials leave the same remainder exactly when they take the same value at , and adding any multiple of to a polynomial leaves that value untouched.
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
Divide by . The divisor is monic, so it is certainly not the zero polynomial and the division algorithm from the previous lesson applies. It supplies a quotient and a remainder with
Those are two cases and they have to be taken separately, because the zero polynomial has no degree at all and so cannot be argued about by its degree. If then is the number . Otherwise leaves only , and a polynomial of degree is a nonzero constant. In both cases is one and the same number for every ; call it . This step has to come first: until the remainder is known to be a number, the claim that it equals does not even typecheck, because is a number.
The identity is an identity, not an equation to solve. The two sides are the same polynomial, so they agree at every value of , and nothing stops us from picking the one value that makes the first factor vanish. Substituting :
Whatever number happens to be, multiplying it by zero erases it. So the remainder is .
The place a reader might suspect a division by zero is that same substitution, because is exactly the value that kills the divisor. Nothing is divided there. The division was performed once, on polynomials, before any value of was chosen, and it produced an identity; the substitution then evaluates that identity, and the factor is multiplied by , never used as a denominator. No fraction appears anywhere in the argument.
Part B
The first student is right that the remainder can be obtained by evaluating, and wrong that this makes the tableau redundant, because the remainder is not all the tableau produces. One run also delivers the quotient, so it answers a question about dividing and not merely a question about a value, and an evaluation by itself supplies nothing about the quotient. On cost, be precise about what is being compared. The tableau spends one multiplication per coefficient after the leading one, which is for a polynomial of degree , and that beats building each power of the input separately, which spends close to twice as many. It does not beat an evaluation already organised in nested form: that is the same computation and costs the same . A concrete task only the tableau performs: rewrite in the form
with written out, which is a rewriting of the whole polynomial.
The second student has the direction of the theorem backwards. Nothing about a tableau explains why its last cell should be a value of ; that is precisely what the theorem establishes, and it establishes it from the division identity alone, for every polynomial and every , with no tableau anywhere in the proof. Without the theorem the last cell is just a remainder, and the whole use of division as a way of evaluating disappears. That general statement is the theorem's own task, and one practical consequence of it is reading a remainder where a tableau would be unusable: on dividing by , a single evaluation settles it while the top row runs to forty-one columns.
One thing worth not claiming, since it looks like a difference and is not: a divisor is within reach of both, because the tableau handles it through its monic factor. That is a shared capability, so it does not separate the two.
So the two are complementary rather than competing. The theorem says what the last cell means; the tableau computes that cell in multiplications and hands over the quotient beside it.
Part C
By part A the remainder on dividing by is the value at , so the claim reduces to something visibly false: it asserts that a polynomial is determined by its value at a single point. Take
Then and , so both leave remainder . They have degrees and , neither is constant, and they are plainly different polynomials, since they disagree at . The claim is refuted.
The exact condition is a biconditional, and both directions come straight from part A. The remainder of is and the remainder of is , so the two remainders are equal exactly when . Nothing else is required of the polynomials, and nothing else is implied about them: agreement at one point is all that a shared remainder reports.
That also explains why refutations are unlimited. Take any polynomial and any polynomial at all, and set
At the added term carries the factor , so and the two share a remainder, while can be chosen to make differ from in degree, in sign, in as many coefficients as you please. The example above is this recipe with and , since . What a single remainder pins down is one value, and one value is a vanishingly small amount of information about a polynomial.
In one line
Dividing gives , with a number in both of the cases the division algorithm allows, and substituting into that identity leaves , the vanishing factor being multiplied by rather than divided by. Neither student is right: the tableau also returns the quotient and beats the power-by-power route on multiplications, while the theorem's own job is to prove that the last cell is at all, for every polynomial and every , with no tableau in the proof. And a remainder captures only a value, so and both leave remainder on division by : two polynomials match there exactly when they agree at , which adding any multiple of preserves.
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
Obtains the identity from the division and establishes that its remainder is a number, covering both of the cases the division algorithm allows, before substituting anything. . Worth 3 points. needs an explanation, not just an answer
Names the step at which a reader might suspect a division by zero, and settles it by reference to the identity rather than by assertion. . Worth 1 point.
Part B 4 points
States and justifies a verdict for each claim, rather than ranking the two tools against each other. . Worth 2 points. needs an explanation, not just an answer
Supports each half with a specific task, naming for each tool one thing it produces that the other does not. . Worth 2 points.
Part C 3 points
Exhibits two non-constant polynomials of different degrees and evaluates both at to show that the remainders agree. . Worth 2 points.
States the agreement condition in both directions, grounding each on part A, and describes a construction that produces further examples together with the reason it always works. . Worth 1 point.
-