Polynomial Division and Roots: Chapter Test
20 multiple-choice questions and 10 free-response questions, drawn from across the chapter and mixed together.
Multiple choice
Answer in any order and change your mind as often as you like. When you submit, your answers lock and every question shows its worked solution.
Free response
10 questions in parts, 179 points in total. Work them out on paper. There are no hints here: reveal each question's answer, worked solution, and rubric when you are ready to mark that one.
Reset the free-response section?
This re-seals every answer you have revealed and clears your flags.
-
1. Two polynomials neither expanded nor drawn . 17 points. Question 1 of 10.
Two polynomials are described rather than written out in full. The first, , arrives in factors. The second, , is described only by its degree and by how often its graph meets the horizontal axis.
- Part A.
State what has for a degree, for a leading term and for a constant term. None of the three calls for an expansion.
Write the expression An equation or an expression is enough here. Show how you built it. 5 points
- Part B.
Describe each far end of the graph of , and say how many distinct real zeros has, giving the reason each factor does or does not contribute one.
Carry your own answer forward Read the far ends off the leading term you reported in part A, whatever it was. The credit is for the reasoning you run on your own leading term, not for landing on a particular pair of ends.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 6 points
- Part C.
The second polynomial, , has degree and its graph crosses the horizontal axis at six different points. Decide how many turning points that graph must have, giving both the largest and the smallest number the description allows, and name the fact that supplies each bound.
Justify your claim State the claim, then give the reason it has to be true. 6 points
The answer
Part A
has degree , leading term and constant term .
- the leading term may be written or as the coefficient on ; is not the same, since the repeated factor contributes and not
Part B
The graph falls on the far left and rises on the far right. has two distinct real zeros, from the repeated factor and from ; the factor is never zero, so it contributes none.
Part C
Exactly five. The degree caps the turning points at , and six distinct real zeros force at least of them, so the two bounds meet and no other count is possible.
Worked solution
Part A
Degrees add across a product and leading terms multiply, so the factored form gives up all three answers with no expansion.
The constant term is the value at , which is the product of the factors' own constants:
Part B
The far ends belong to the leading term alone, which part A found to be : an odd degree with a positive leading coefficient, so the graph falls on the far left and rises on the far right.
A product is zero exactly when one of its factors is, so take the factors one at a time:
The squared factor supplies the single number however many times it appears, and never reaches zero for a real input. So there are two distinct real zeros, comfortably inside the ceiling of that degree allows.
Part C
Two separate facts press on the count from opposite sides.
From above. A polynomial of degree has a graph with at most turning points, so
From below. Between two neighbouring zeros the graph leaves the axis and comes back to it, so it must stop rising or stop falling somewhere in between. Six distinct zeros have five neighbouring pairs, each forcing at least one turning point:
The two bounds are the same number, so the count is pinned: exactly five. Note how differently the two arguments work. The ceiling is a fact about degree and holds whatever the zeros do; the floor is a fact about the zeros and would collapse if any two of the six coincided, since only distinct zeros have a stretch of graph between them.
In one line
has degree , leading term and constant term , so its graph falls on the far left and rises on the far right. It has two distinct real zeros, and , since never vanishes and a repeated factor still names one number. The graph of must have exactly five turning points: degree allows at most , and six distinct real zeros force at least , so the ceiling and the floor meet.
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
Adds the factors' degrees, counting the squared factor twice, to reach degree . . Worth 2 points.
Multiplies the factors' leading terms rather than their constants, reaching . . Worth 2 points.
Obtains the constant term as the product of the factors at , keeping the sign. . Worth 1 point.
Part B 6 points
Uses the parity of the degree and the sign of the leading coefficient to name both far ends. . Worth 2 points.
Sets each factor to zero in turn and solves, including the fractional zero from . . Worth 2 points.
Says why contributes no real zero, and counts once rather than twice. . Worth 2 points.
Part C 6 points
States the ceiling and applies it to degree . . Worth 2 points.
Argues the floor from the six distinct zeros, explaining why each neighbouring pair forces a turn. . Worth 3 points. needs an explanation, not just an answer
Concludes that the two bounds coincide, so the count is exactly five rather than at most five. . Worth 1 point.
-
-
2. The working was lost, the answer was not . 17 points. Question 2 of 10.
A division was carried out and then the working was thrown away. What survives is the divisor , the quotient and the remainder .
- Part A.
Rebuild the dividend in standard form, and say why no second dividend could have produced this same set of three.
Write the expression An equation or an expression is enough here. Show how you built it. 5 points
- Part B.
Decide which of , , and could be the remainder of some division by this same , giving for each one the reason that settles it.
Justify your claim State the claim, then give the reason it has to be true. 6 points
- Part C.
Now suppose the dividend had been instead of the polynomial from part A, with the same divisor . Give the quotient and the remainder, and explain how the algorithm's two promises settle the answer without a single pass of the loop.
Explain why it works A sentence or two. Reasons, not steps. 6 points
The answer
Part A
. It is the only possible dividend because is computed from , and rather than chosen.
- is the same polynomial with the empty column shown; is not, since it drops the remainder
Part B
All but . A remainder must be the zero polynomial or have degree below the divisor's degree , so (degree ), (degree ) and all qualify, while has degree and still contains a whole copy of .
Part C
The quotient is and the remainder is . That pair keeps the identity and keeps the degree condition, since , and only one pair can keep both, so it is the answer.
Worked solution
Part A
The division algorithm's identity runs in both directions, so multiply back.
Collecting that product: from the leading pair; ; ; ; and . Now add the remainder:
Uniqueness is not even needed here. The right-hand side is a single polynomial once the three are fixed, so there is nothing left to choose.
Part B
The divisor has degree , so the stopping condition reads: the remainder is the zero polynomial, or its degree is at most .
Taking them in turn: has degree , so it passes; has degree , so it passes; is named separately by the condition, since the zero polynomial has no degree at all, and it passes. That leaves , whose degree is , exactly the divisor's. It is disqualified, and the reason is visible rather than formal: one more copy of can still be taken out of it, since
which moves a into the quotient and leaves , a genuine remainder. A leftover that still contains a copy of the divisor is an unfinished division, not the answer to one.
Part C
Test the candidate pair and against the two promises.
The identity holds trivially, and the degree condition holds because a linear leftover is already smaller, in degree, than a quadratic divisor. Uniqueness closes the argument: the division algorithm promises exactly one pair keeping both conditions, so any pair that keeps both is that pair. The loop agrees without being run, because its stopping test is already satisfied before the first pass, and the corresponding integer statement is the familiar one that divided by gives quotient and remainder .
Watch out. A quotient of is a finished answer, not a failure to divide. Nothing in the algorithm promises the quotient is nonzero.
In one line
Multiplying back gives , and no other dividend is possible, since is computed rather than chosen. Of the four proposed leftovers, , and are legal remainders for this divisor while is not, because it still contains a whole copy of . Dividing by the same divisor gives quotient and remainder : that pair keeps the identity and the degree condition, and uniqueness makes anything keeping both the answer.
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
Uses the identity rather than , so the remainder is added in. . Worth 2 points.
Expands the product correctly, including the column that cancels to zero. . Worth 2 points.
Says that is determined once , and are given, so the dividend is not a choice. . Worth 1 point.
Part B 6 points
States the stopping condition in terms of degree, naming the zero polynomial as its own case. . Worth 2 points.
Gives a verdict for all four, with the degree that settles each. . Worth 2 points.
Explains why matching the divisor's degree disqualifies a leftover, rather than only asserting the rule. . Worth 2 points. needs an explanation, not just an answer
Part C 6 points
Reports the pair , . . Worth 1 point.
Checks the pair against both promises, the identity and the degree condition, rather than one of them. . Worth 2 points.
Appeals to uniqueness to explain why keeping both promises is enough to be the answer. . Worth 3 points. needs an explanation, not just an answer
-
-
3. One unknown coefficient, then one tableau . 17 points. Question 3 of 10.
The cubic carries a single unknown coefficient. One stated remainder fixes it, and a second division then does the rest of the work.
- Part A.
Dividing by leaves remainder . Find .
Solve and show your work Write each step out, and end with the value and its units. 5 points
- Part B.
Using your value of , run a synthetic tableau that divides by . Give the corner number and the finished bottom row, say what each stretch of that row means, and multiply back as a check.
Carry your own answer forward Use the value of you found in part A, whatever it was, and say which value you are working with. The credit here is for running the tableau on your own coefficients.
Write the expression An equation or an expression is enough here. Show how you built it. 6 points
- Part C.
Suppose the condition in part A had been that divides exactly, instead of leaving remainder . Decide whether some value of makes that true, and say what changes and what does not in the equation you solved.
Justify your claim State the claim, then give the reason it has to be true. 6 points
The answer
Part A
.
- may be reached by a tableau with corner , whose last cell is ; a value of answers a different question, about division by
Part B
With : corner , quotient , remainder .
- the bottom row says the same thing; a quotient written has been read one degree too high
Part C
Yes, at . Only the right-hand side changes: the evaluation at is set equal to rather than to , and nothing in the theorem requires the solution to be an integer.
Worked solution
Part A
The remainder on dividing by is the value at , so set that value equal to the stated remainder.
Checking, at gives .
Part B
With the coefficients are , and , so the corner number is . Bring down ; then and ; then and ; then and .
So the quotient is and the remainder is . Expanding as a check, , and adding restores .
Part C
Exact division is not a different kind of condition. It is the same condition with a different number on the right, because dividing exactly means leaving remainder , and the remainder is still the value at .
So such a exists. The left-hand side is untouched: the same evaluation, at the same input, built from the same coefficients. What changes is only the target value.
One thing worth saying plainly is that a fractional answer is not a symptom of an error here. The problem never insisted on integer coefficients, and is a perfectly good polynomial with as a factor. It is the Rational Root Theorem, not the Factor Theorem, that asks for integer coefficients, and nothing in this part invoked it.
In one line
The stated remainder gives , so and . Dividing that by with corner produces the bottom row , so the quotient is and the remainder is , which expanding confirms. Had the condition been exact division by , the same evaluation would have been set equal to instead of , giving : a legitimate answer, since nothing in the Factor Theorem asks for an integer.
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
Evaluates at , the input that makes the divisor zero, rather than at . . Worth 2 points.
Sets the evaluation equal to and solves the resulting linear equation. . Worth 2 points.
Reports as a single number and checks it against the stated remainder. . Worth 1 point.
Part B 6 points
Puts in the corner, flipping the sign of the divisor's constant. . Worth 2 points.
Runs bring down, multiply, add across all four columns with correct signs. . Worth 2 points.
Reads the bottom row as a quadratic quotient plus a separate remainder, and confirms by expanding. . Worth 2 points.
Part C 6 points
Recognises exact division as remainder and sets the same evaluation equal to . . Worth 2 points.
Solves for and answers the decision asked for rather than only computing. . Worth 2 points.
Explains that only the right-hand side changed, and that a non-integer is legitimate here. . Worth 2 points. needs an explanation, not just an answer
-
-
4. Built to a specification, then read back . 18 points. Question 4 of 10.
A polynomial is wanted with three prescribed roots, , and , of the least degree those roots allow, and with leading coefficient .
- Part A.
Write down a polynomial meeting the whole specification, in factored form and expanded.
Write the expression An equation or an expression is enough here. Show how you built it. 6 points
- Part B.
Describe the two far ends of the graph of your polynomial, give its -intercept, and say exactly how many turning points that graph must have.
Carry your own answer forward Read all three answers off the polynomial you produced in part A, whatever it was, and say which polynomial you are reading. The credit is for the reasoning, not for matching a particular intercept.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 6 points
- Part C.
A classmate offers and claims it meets the same specification. Rule on the claim, say what a list of roots does and does not fix, and say what a specification would have had to ask for in order to select .
Justify your claim State the claim, then give the reason it has to be true. 6 points
The answer
Part A
.
- is the same polynomial with the still outside; is not, since its leading coefficient is
Part B
The graph falls on the far left and rises on the far right, and it meets the -axis at . It must have exactly two turning points: three distinct real zeros force at least two, and degree allows at most two.
Part C
It fails. has the three prescribed roots and the least degree, but its leading coefficient is rather than . A root list fixes a polynomial only up to a nonzero constant multiple, so a specification selecting would have to name as the leading coefficient, or give a point on the graph that picks it out.
Worked solution
Part A
Each prescribed root contributes the factor , and three roots are the fewest factors that can carry them, so the least degree is .
The can be shared out to clear both fractions, since : giving the to the second factor and the to the third turns them into and , which is tidier to expand.
The leading coefficient is , as required, and checks one root.
Part B
The degree is , odd, and the leading coefficient is positive, so the two ends disagree and the right one points up: the graph falls on the far left and rises on the far right.
The -intercept is the value at , which is the constant term:
For the turns, press from both sides. The ceiling gives at most . The floor gives at least one turn between each neighbouring pair of the three distinct zeros, which is again. The bounds coincide, so the count is exactly .
Part C
Check the claim clause by clause. The three roots are right, since vanishes wherever a factor does, and multiplying by cannot move a zero of a product. The degree is right, at . What fails is the last clause:
whose leading coefficient is , not .
That is the general situation rather than an accident of this example. Every nonzero multiple of a polynomial has exactly the same roots, so a root list can never single out one polynomial; it produces a whole family , one member for each nonzero . Exactly one further condition is needed to choose the member, and the specification chose it by naming the leading coefficient. A point on the graph would have done the same job: asking instead for the graph to pass through would have selected , since .
In one line
The specification is met by . Its graph falls on the far left and rises on the far right, meets the -axis at , and has exactly two turning points, since degree allows at most two and three distinct real zeros force at least two. The classmate's has the right roots and the right degree but leading coefficient , so it fails: a root list fixes a polynomial only up to a nonzero constant multiple, and the specification would have had to name , or a point such as , to select it.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 6 points
Turns each root into the factor with the correct sign, including the negative root. . Worth 2 points.
Attaches the scalar so that the leading coefficient is , rather than leaving a monic product. . Worth 2 points.
Expands correctly to . . Worth 2 points.
Part B 6 points
Names both far ends from the parity of the degree and the sign of the leading coefficient. . Worth 2 points.
Identifies the -intercept as the constant term, or as the value at . . Worth 1 point.
Pins the number of turning points between the degree ceiling and the floor the distinct zeros force. . Worth 3 points.
Part C 6 points
Checks each clause of the specification separately and identifies the leading coefficient as the one that fails. . Worth 2 points.
States that roots fix a polynomial only up to a nonzero constant multiple, with a reason rather than an assertion. . Worth 3 points. needs an explanation, not just an answer
Names a condition that would have selected : the leading coefficient , or a specific point on its graph. . Worth 1 point.
-
-
5. What the list reaches, and what it cannot . 17 points. Question 5 of 10.
The polynomial has integer coefficients, so its rational roots are confined to a short list. What the list cannot reach has to be located some other way.
- Part A.
Write out the finite set of fractions inside which any rational root of has to lie, in lowest terms and without repeats, then say which member of that set is a root.
Write the expression An equation or an expression is enough here. Show how you built it. 5 points
- Part B.
Take the corresponding linear factor out of and report the polynomial left behind. Then show that neither of the two roots still outstanding is rational.
Carry your own answer forward Peel off the factor belonging to the root you found in part A, whatever it was, and work inside the quotient it leaves rather than returning to .
Write the expression An equation or an expression is enough here. Show how you built it. 6 points
- Part C.
Evaluate at , , and , then use the four values to trap each remaining root between consecutive integers. Say what the trapping establishes and what it leaves unnamed.
Carry your own answer forward Evaluate the quadratic you produced in part B, whatever it was, and trap its roots using your own four values.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 6 points
The answer
Part A
The permitted numbers are , , and , eight in all, and is a root.
- the list may be written as with and ; a list containing has taken the denominators from the constant term
Part B
. The quadratic's own candidates are and , whose values are , , and , none of them zero, so neither remaining root is rational.
Part C
The values are , , and , so one root lies between and and the other between and . Each sign change proves a root sits inside that interval; neither names the number, and the numbers are irrational.
Worked solution
Part A
The numerator of a rational root divides the constant term and the denominator divides the leading coefficient .
Test the small ones first. and , so neither works. Next,
so is a root.
Part B
Run the tableau with corner on the coefficients . The bottom row is , so
where the has been moved from the quadratic into the linear factor to clear the fraction.
The remaining roots are the roots of , which is monic with integer coefficients, so any rational root of it would be an integer dividing . That is four numbers, and all four fail:
So neither of the two remaining roots is rational.
Part C
Evaluate at the four inputs.
The sign changes from to across and from to across . A polynomial graph is unbroken, so it cannot cross from one side of the axis to the other without meeting it, and each interval therefore holds a root. Two roots is all a quadratic has, so these are both of them, and each interval holds exactly one.
What the argument delivers is a location, and only a location. It proves the root is there, and it can be tightened as far as patience allows by halving the interval, but it never produces the number. Part B already showed neither root is rational, so no amount of tightening will ever land on a fraction.
In one line
The theorem permits , , and , and is a root, so . The quotient's own candidates and give , , and , so neither remaining root is rational. Evaluating the quotient at , , and gives , , and , trapping one root between and and the other between and : the sign changes prove where each root is without ever naming it.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 5 points
Takes numerators from the constant term and denominators from the leading coefficient, not the reverse. . Worth 2 points.
Produces all eight numbers, both signs included, reduced and without duplicates. . Worth 2 points.
Tests candidates and reports as a root, with the evaluation that establishes it. . Worth 1 point.
Part B 6 points
Divides by the factor the root supplies and reports a quadratic quotient, one degree lower. . Worth 2 points.
Clears the fraction by moving the leading coefficient into the linear factor, giving . . Worth 1 point.
Builds the quotient's own candidate list and tests every entry, rather than reusing the list from part A. . Worth 3 points.
Part C 6 points
Computes all four values correctly. . Worth 2 points.
Identifies both sign changes and names the interval each root lies in. . Worth 2 points.
Says that the trap locates a root without naming it, and connects that to the failed candidate list. . Worth 2 points.
-
-
6. One value, three questions . 18 points. Question 6 of 10.
A single value of a polynomial settles more than it looks. Throughout this question is a polynomial with , and three separate questions are pressed on that one number.
- Part A.
Decide, for each of , and , whether is a factor of it. Give the evaluation that settles each case.
Justify your claim State the claim, then give the reason it has to be true. 6 points
- Part B.
Suppose in addition that with . Find , and state the remainder when is divided by .
Solve and show your work Write each step out, and end with the value and its units. 6 points
- Part C.
Decide whether is a factor of , and then state what the two-way factor statement looks like for a divisor with .
Justify your claim State the claim, then give the reason it has to be true. 6 points
The answer
Part A
It is a factor of only. The three values at are , and , and the Factor Theorem converts the middle one into a factor while ruling the other two out.
Part B
, and is also the remainder on dividing by .
- may be reached by expanding first, which gives ; an answer of has left the off the identity
Part C
Yes. Since and multiplying a divisor by a nonzero constant cannot change whether a division comes out exact, the quotient simply picks up a factor of . In general, is a factor of a polynomial exactly when that polynomial vanishes at .
Worked solution
Part A
The Factor Theorem is a two-way statement, so one evaluation settles each case in whichever direction it happens to fall. Evaluate all three at :
A value of means is a factor, so divides exactly. A value that is not means it is not a factor, which rules out both itself and : were a factor of either, evaluating the factorization at would force the value to be , and it is not.
Notice that the negative verdicts use the theorem in its contrapositive form. Nothing about beyond the single number was needed for any of the three.
Part B
The identity holds at every input, so evaluate it at rather than expanding.
The second question is the same number wearing a different hat. The remainder on dividing by is by the Remainder Theorem, so it is . No second division is needed, and no expansion of either.
Part C
Part A gave for some polynomial . Pull the constant across:
and is still a polynomial, since halving every coefficient of a polynomial leaves a polynomial. So is a factor, with the quotient halved and nothing else disturbed.
The general statement follows the same way. For ,
so divides a polynomial exactly when does, and by the Factor Theorem that happens exactly when the polynomial vanishes at . The rule of thumb is unchanged: test the value that kills the candidate factor. For that value is , which is why part A already answered this part.
In one line
Of the three, is a factor of alone, since the values at are , and and only a value of produces a factor. With , evaluating the identity at gives , which is also the remainder on dividing by . Finally is a factor of too, the quotient merely picking up a factor of : in general is a factor exactly when the polynomial vanishes at .
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 6 points
Evaluates all three polynomials at rather than attempting a division. . Worth 2 points.
Gives the right verdict for all three cases. . Worth 2 points.
Explains how a nonzero value rules a factor out, not only how a zero value establishes one. . Worth 2 points. needs an explanation, not just an answer
Part B 6 points
Evaluates the given identity at instead of expanding first. . Worth 2 points.
Computes and assembles with the retained. . Worth 2 points.
Names the remainder on division by as that same value, citing the Remainder Theorem. . Worth 2 points.
Part C 6 points
Writes as a constant times and rules that it is a factor. . Worth 2 points.
Explains why a nonzero constant multiple of a divisor divides exactly the same polynomials, naming what happens to the quotient. . Worth 3 points. needs an explanation, not just an answer
States the general condition for as vanishing at . . Worth 1 point.
-
-
7. A quadratic divisor, and what one division certifies . 19 points. Question 7 of 10.
Take and . Whether is a factor of is a question one division answers, and the answer carries rather more than a quotient.
- Part A.
Divide by , reporting the quotient and the remainder.
Write the expression An equation or an expression is enough here. Show how you built it. 6 points
- Part B.
Your part A result hands over two roots of with no further evaluation. Name them and say what entitles you to them. Then say how many further roots can have, and whether any of them is rational.
Carry your own answer forward Argue from the quotient and remainder you reported in part A, whatever they were, and say which pair you are using.
Justify your claim State the claim, then give the reason it has to be true. 7 points
- Part C.
Explain why the single division in part A proves that is a factor of . Say what a table of values of alone could never supply, however long it ran, and why a divisor with no rational root leaves no convenient input to test at all. Then say what the uniqueness half of the division algorithm contributes.
Explain why it works A sentence or two. Reasons, not steps. 6 points
The answer
Part A
The quotient is and the remainder is .
- the answer may be written as the identity ; a nonzero remainder means an arithmetic slip, since this division comes out exact
Part B
and , because and an exact division makes , which vanishes wherever does. The quadratic quotient supplies at most two further roots, and neither is rational: the quotient's candidates all fail.
Part C
A remainder of turns the identity into , true at every input, which is what being a factor means. A table of values never yields the cofactor , and a divisor with no rational root offers no input worth testing. Uniqueness then makes one division decisive: an exact factorization by would pair with remainder .
Worked solution
Part A
Both polynomials are already in standard form with no gaps, so run the loop three times.
First pass: , and ; subtracting leaves . Second pass: , and ; subtracting leaves . Third pass: , and ; subtracting leaves .
The forecast checks out before the arithmetic does: , and the quotient's leading coefficient is .
Part B
The remainder was , so the identity collapses to a product: . Splitting the divisor,
and a product is zero exactly when one factor is, so and without either being computed.
How many more can there be? The quotient has degree , so it contributes at most two roots, and has degree , which caps the total at four in any case. Testing the quotient's own candidate list, which is , , and , gives , , , , , , and ; none is zero, so neither remaining root is rational.
Watch out. The two roots named here came from the DIVISOR, not from the quotient. It is the exactness of the division that transfers them to .
Part C
Why the division settles it. Being a factor is a statement about an identity: is a factor of when for some polynomial and for every value of . The division produced exactly such a and certified that nothing was left over, so the statement is established as written.
What evaluations cannot supply. An evaluation tests one input. Here, as it happens, two of them would have settled the factor question on their own: , so would show both linear factors divide , and since they share no root their product does too. What no table of values of ever supplies is the cofactor , and that is half of what a factorization is for. Nor does the shortcut generalise: for a divisor with no rational root there is no convenient input to test in the first place. Divide by and no real input makes the divisor vanish at all, so the table has nowhere to look, while the division runs exactly as before.
What uniqueness contributes. Without it, an exact division might be one lucky route among several, and failing to find one would prove nothing. The division algorithm promises exactly one pair keeping the identity and the degree condition together, so:
So one division decides the question in both directions at once. A remainder of proves is a factor, and a nonzero remainder proves it is not.
In one line
The division is exact: , quotient with remainder . Since , the numbers and are roots of with nothing further computed, and the quadratic quotient supplies at most two more, neither rational, since its candidates all fail. The one division settles the factor question because a remainder of makes the identity a product holding at every input, and it hands over the cofactor, which no table of values of ever supplies and which a divisor with no rational root gives no input to hunt for; uniqueness then means any exact factorization by would have to be the pair the division already returned.
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 6 points
Forms each quotient term by dividing leading term by leading term, and subtracts the entire product each pass. . Worth 3 points.
Reaches quotient with remainder . . Worth 2 points.
Checks the answer, by expanding or against the degree and leading-coefficient forecast. . Worth 1 point.
Part B 7 points
Factors the divisor and names and as roots of . . Worth 2 points.
Explains that a remainder of turns the identity into a product, which is what transfers the divisor's roots to . . Worth 3 points. needs an explanation, not just an answer
Bounds the further roots by the quotient's degree and tests the quotient's candidate list to rule out rational ones. . Worth 2 points.
Part C 6 points
States that a remainder of makes the identity a product valid at every input, which is the definition of a factor. . Worth 2 points. needs an explanation, not just an answer
Says what a table of values of cannot supply, naming the cofactor, and why a divisor with no rational root leaves nothing to test. . Worth 2 points. needs an explanation, not just an answer
Uses uniqueness to argue that a nonzero remainder rules a factorization out, not merely that a zero remainder establishes one. . Worth 2 points. needs an explanation, not just an answer
-
-
8. Where the filter has nothing to grip . 18 points. Question 8 of 10.
The polynomial has constant term , which is precisely the case in which the Rational Root Theorem, applied exactly as printed, gives nothing away.
- Part A.
Say what the theorem's numerator condition asserts about as printed, and why that assertion excludes nothing. Then rewrite in a form the theorem can grip, and give the candidate list for the polynomial that remains.
Justify your claim State the claim, then give the reason it has to be true. 6 points
- Part B.
Find every rational root of .
Carry your own answer forward Work from the factored form and the candidate list you produced in part A, whatever they were, rather than starting again from as printed.
Solve and show your work Write each step out, and end with the value and its units. 6 points
- Part C.
A classmate summarises part B like this: "For a polynomial with zero constant term, the rational roots are together with every number on the cofactor's candidate list." Refute the summary with a specific polynomial, demonstrating the failure rather than asserting it, and write down a corrected sentence.
Construct a counterexample Give one specific case, and show it breaks the claim. 6 points
The answer
Part A
The condition reads , which every integer satisfies, so it excludes nothing. Factoring gives , whose cubic has candidates .
Part B
, , and .
- the same four roots are named by the factorization ; a list omitting has forgotten the factor that was taken out
Part C
Take . Its cofactor's candidates are and , whose values are , , and , so none is a root and is the only rational root of . Corrected: the rational roots are together with whichever candidates testing confirms.
Worked solution
Part A
The theorem says the numerator of a rational root divides the constant term. Here the constant term is , and every integer divides , since whatever is. The condition is therefore satisfied by every numerator and rules out nothing at all; the denominator condition still bites, but on its own it leaves infinitely many candidates.
The repair is to take the largest power of out first, which costs nothing and hands over one root immediately:
The cofactor has constant term and leading coefficient , so its numerators divide and so do its denominators:
Eighteen numbers once duplicates such as and have been reduced away.
Part B
The factor gives the root at once. Inside the cubic, test candidates smallest first. rules out , and rules out . Next try :
so is a root. Peel it off with corner on , whose bottom row is :
The quadratic quotient ends the hunt, and it splits into two linear factors, so the full factorization is and the rational roots are , , and . A quartic has room for at most four roots, so the list is complete.
Part C
The summary quietly converts the theorem into its converse, and one polynomial is enough to break it. Take
The cofactor is monic with constant term , so its candidates are the integers dividing , namely and . Test all four:
Not one of them is zero. So the classmate's recipe would report five rational roots, , where has exactly one, namely . Substituting into gives , not , which is the failure demonstrated rather than described.
The corrected sentence keeps the direction the theorem actually proves: the rational roots are together with those candidates that testing confirms. The list marks the only places a rational root is permitted to sit, and never says which of those places is occupied.
In one line
As printed, the numerator condition on reads , which every integer satisfies, so it filters nothing; factoring gives , whose candidates are . Testing finds , and peeling it off leaves , so and the rational roots are , , and . The classmate's summary is the converse of the theorem and fails: has candidates and with values , , and , so its only rational root 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 6 points
Says that every integer divides , so the numerator condition is vacuous here. . Worth 2 points. needs an explanation, not just an answer
Factors out the largest power of to produce a cofactor with nonzero constant term. . Worth 2 points.
Builds the cofactor's list correctly, reduced and deduplicated, with both signs. . Worth 2 points.
Part B 6 points
Reports as a root, from the factor taken out in part A. . Worth 1 point.
Tests candidates against the cofactor and peels off a factor when one succeeds. . Worth 3 points.
Finishes the quadratic quotient and reports all four roots, noting that a quartic can have no more. . Worth 2 points.
Part C 6 points
Produces a specific polynomial with zero constant term whose cofactor has no rational root. . Worth 2 points.
Builds the cofactor's candidate list and evaluates every entry, showing the failure rather than asserting it. . Worth 2 points.
Writes a corrected sentence that keeps the one-way direction the theorem proves. . Worth 2 points.
-
-
9. Two ways to look for a root . 20 points. Question 9 of 10.
The polynomial has integer coefficients. This question puts two tools on it in turn, a candidate list and a table of values, and asks what each of them is in a position to settle.
- Part A.
Evaluate at , , , , and using synthetic tableaux, and name the theorem that lets a tableau's last cell serve as a value of .
Solve and show your work Write each step out, and end with the value and its units. 6 points
- Part B.
Use your six values to trap each real root of between two consecutive entries of your list, and justify the claim that you have found every real root of .
Carry your own answer forward Trap the roots using the six values you computed in part A, whatever they were, and state which values you are reading the signs from.
Justify your claim State the claim, then give the reason it has to be true. 7 points
- Part C.
Explain why no root of is rational, and say what the trapping argument does and does not deliver about the roots.
Explain why it works A sentence or two. Reasons, not steps. 7 points
The answer
Part A
, , , , and . The Remainder Theorem is what makes the last cell .
- the same six values arise from direct substitution; a value of has taken as
Part B
The sign changes across , and trap one root in each. That is three roots, which is all a cubic can have, so there are no others and each interval holds exactly one.
Part C
is monic with constant term , so any rational root would be an integer dividing , and the four candidates give , , and , none of them zero. So no root is rational. The trapping proves where each root is and how close two integers can get to it, and never produces the number itself.
Worked solution
Part A
Each tableau runs on the top row with the input in the corner. For , for instance, bring down ; then and ; then and ; then and .
Running the same three steps at each input gives
The last cell is the remainder on dividing by , and the Remainder Theorem says that remainder is . One multiply and one add per coefficient does the whole job, with no power of the input ever built.
Part B
Read the signs along the list: , , , , , . The sign flips three times, and an unbroken curve cannot flip sign without meeting the axis, so
Those are three different real roots, since the three intervals do not overlap. A nonzero polynomial of degree has at most three distinct roots, so the count is closed: there is no room for a fourth, and consequently none of these intervals can hold two, or the total would exceed three.
Watch out. No sign change between and does not prove there is no root there. It happens that there is none, but matching signs guarantee nothing; what closes that gap is the ceiling on the count, not the table.
Part C
Why no root is rational. The coefficients are integers and the leading coefficient is , so a rational root in lowest terms needs , forcing : every rational root would be an integer dividing . That is four numbers, and part A has already disposed of three of them.
None is zero, so has no rational root. Combined with part B, each of the three real roots is an irrational number.
What the trap delivers. It delivers location and certainty of existence: a root is inside , and that is proved rather than guessed. It also delivers as much precision as patience allows, since the interval can be halved repeatedly, each halving keeping whichever side carries the sign change.
What it never delivers is the number. No finite sequence of these steps can end on the root, and part A's failed candidate list explains why no exact fraction will ever appear: there is no fraction to land on.
In one line
The six tableaux give , , , , and , each last cell being by the Remainder Theorem. The three sign changes trap one root in , one in and one in , and a cubic has room for no more, so those are all of them. None is rational: is monic with constant term , so a rational root would be an integer dividing , and , , and are all nonzero. The trap proves where each root lies and tightens as far as wanted, but it never names the number.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 6 points
Sets up each tableau with the corner holding the input and the top row holding every coefficient. . Worth 2 points.
Produces all six values correctly, with signs handled at the negative input. . Worth 3 points.
Names the Remainder Theorem as the entitlement to read a value of from a division. . Worth 1 point.
Part B 7 points
Identifies all three sign changes and names the interval each root lies in. . Worth 3 points.
Argues from unbrokenness that a sign change forces a zero, rather than asserting it. . Worth 2 points. needs an explanation, not just an answer
Closes the count with the degree ceiling, noting that matching signs on their own prove nothing. . Worth 2 points.
Part C 7 points
Uses the monic case to reduce the candidates to integers dividing , and tests all four. . Worth 3 points.
Concludes that each trapped root is irrational, joining the failed list to part B's three roots. . Worth 2 points. needs an explanation, not just an answer
Separates what the trapping proves, existence and location, from what it cannot supply, the number itself. . Worth 2 points. needs an explanation, not just an answer
-
-
10. A crate that has to hold thirty cubic metres . 18 points. Question 10 of 10.
A rectangular crate is built to a single dial setting , measured in metres. Its height is metres, its base is metres wide and metres long, and the crate is required to hold exactly cubic metres.
- Part A.
Express the crate's volume as a polynomial in in standard form. Then rearrange the thirty cubic metre requirement so that one side reads zero and every coefficient is a whole number, and say which values of describe a crate that could actually be built.
Model the situation Name your unknown first, then write every other quantity in terms of that one letter. 6 points
- Part B.
Find the height, then give all three measurements in metres. Say also how large the permitted set of fractions is, and how much of it your part A restriction throws away.
Carry your own answer forward Build the candidate list from the equation you wrote in part A, whatever it was, and prune it with your own restriction on .
Solve and show your work Write each step out, and end with the value and its units. 6 points
- Part C.
Take the linear factor supplied by the height you found out of the equation, then use the polynomial that remains to decide whether a second value of could meet the requirement. Say what your decision settles about the crate.
Carry your own answer forward Work from the height you reported in part B, whatever it was, and reason about the quotient that your own division leaves behind.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 6 points
The answer
Part A
, so the requirement is . The crate exists only for , since the width must be positive.
Part B
The height is metres, so the crate is m high on a base m by m. The theorem permits candidates, of which clear .
- the three measurements may be given in any order as m, m and m; a height of would give a volume of cubic metres, not
Part C
Dividing leaves , whose discriminant is negative, so it has no real roots. The equation therefore has as its only real solution, and no second crate of these proportions holds cubic metres.
Worked solution
Part A
Volume is height times width times length, so multiply the three given measurements.
Setting that equal to and moving everything to one side gives the equation the theorem can read:
Moving the across is what supplies a nonzero constant term. The volume polynomial itself has constant term , on which the numerator condition would say nothing.
For the restriction, all three measurements must be positive: , and . The middle one is the binding condition, so the situation allows exactly .
Part B
The constant term is and the leading coefficient is , so numerators divide and denominators divide :
That is positive values and their negatives, so candidates. The restriction kills every negative one and itself, leaving .
Test the small survivors. At the left side is , and at :
So the height is metres, the width is metres and the length is metres. The volume checks: cubic metres.
Part C
Run the tableau with corner on the coefficients . The bottom row is , the final re-confirming the root, so
A quadratic quotient ends the hunt. Its discriminant is
so it has no real roots at all, and in particular none above . The only real solution of the equation is .
Read back into the situation, that is a uniqueness statement: the dial setting is forced. There is exactly one crate of these proportions with a volume of cubic metres, and no second setting, large or small, would have done. Note that the restriction was not even needed to reach it here, since the quotient offered no competition at all.
In one line
The volume is , so the requirement becomes with . The theorem permits candidates, of which clear the restriction, and works: the crate is m high on a base m by m, a volume of cubic metres. Dividing out leaves , whose discriminant is negative, so there is no second real solution and the dial setting is unique.
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 6 points
Builds the volume as the product of the three measurements and expands it to standard form. . Worth 2 points.
Moves the across to produce a polynomial equation with integer coefficients and zero on one side. . Worth 2 points.
States and identifies the width as the measurement that binds. . Worth 2 points.
Part B 6 points
Builds the candidate list from the equation's two end coefficients, reduced and deduplicated. . Worth 2 points.
Prunes with the restriction and reports both counts, permitted and surviving. . Worth 2 points.
Reports all three measurements in metres and checks the volume against the requirement. . Worth 2 points.
Part C 6 points
Divides by the linear factor the root supplies and reports the quadratic quotient. . Worth 2 points.
Decides the quotient has no real roots, by the discriminant or an equivalent argument. . Worth 2 points.
Reads the result back as a statement about the crate, that the dial setting is unique. . Worth 2 points.
-