The Factor Theorem: Free Response
5 questions in parts, 60 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. Two candidates, one evaluation each . Foundational, 10 points. Question 1 of 5.
A factor question can be answered yes or no, and the theorem of this lesson answers both kinds from the same single evaluation. That is worth pausing on, because one sentence settling two opposite questions is usually a sentence doing more than one job. This question keeps the arithmetic small so that the bookkeeping behind the answers stays visible.
- Part A.
Let . Decide whether is a factor of , and decide whether is. Report the evaluation you used in each case together with its verdict.
Solve and show your work Write each step out, and end with the value and its units. 3 points
- Part B.
A different polynomial is handed to you already in the form , where is some polynomial you are not told anything about. Write down every number you can be certain is a root of , and state what this form settles, if anything, about the rest of 's roots.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part C.
Write the factor theorem out as two separate implications. Then take each of your two verdicts from part A in turn and say which of the implications delivered it. Explain in particular how an implication of this kind can produce a refusal at all, given that each one begins by assuming something.
Carry your own answer forward Use the two factor verdicts you reached in part A. This part is marked on matching them to the two implications, not on recomputing the evaluations, so carry your own verdicts forward even if you are unsure of them.
Explain why it works A sentence or two. Reasons, not steps. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
This theorem is a two-way street, and each direction does a different job. Before computing anything, decide which direction you would need in order to say yes, and which one you would need in order to say no.
-
Hint 2 of 4 · Part A
A candidate factor tells you which number to try, and it is the number that makes that factor equal to zero. That is not always the number you can see written inside it.
-
Hint 3 of 4 · Part B
A factorization is an identity holding at every value of , so you are free to substitute the most convenient values. Convenient here means values that switch one of the shown factors off.
-
Hint 4 of 4 · Part C
Reversing an implication gives a new claim that needs its own proof. Negating both of its halves and swapping them gives the same claim for free, and only one of those two operations is what a negative verdict rests on.
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
, so is a factor. , which is not , so is not a factor.
Part B
and are certainly roots. Nothing is known about , so the list may well be longer, and this form settles nothing about whether it is.
Part C
The positive verdict comes from the root-to-factor implication, used directly. The negative one comes from the factor-to-root implication, used in contrapositive form: if were a factor then would have to be , so an evaluation that is not rules the factor out.
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
Each candidate factor names the number you are supposed to try: the one that makes that factor equal to zero. For that number is , and for it is , since .
Start with and evaluate at :
The evaluation is zero, so is a factor of , and the factorization exists whether or not you go on to compute .
Now , evaluated at . Watch the odd power: , while .
That is not zero, so is not a factor. Notice how little was needed for the second verdict. You did not divide, and you did not have to inspect the quotient for anything: one number decided it.
The sign is the whole trap here. Evaluating at a second time would answer the question you already answered, and evaluating at to test answers a question nobody asked. Write the candidate as before you substitute, and is the number you want.
Part B
This is the theorem read in the direction that costs nothing. A factorization is an identity, true at every value of , so you may evaluate it wherever it is convenient. Choose the values that switch one of the displayed factors off.
At the first factor vanishes and takes the whole product with it:
The second factor is not monic, so its root is not the number written inside it. Solve to get , and evaluate there:
So and are roots of , guaranteed, without knowing a single coefficient of or anything at all about .
What the form does not do is close the list. is unknown, and any root of is also a root of , since the product is zero wherever any factor is. If then picks up the extra roots and ; if is the constant it picks up none; and may even vanish at again. So the displayed factors give a guarantee in one direction only. They certify two roots and are silent about everything else, and reading such a form as a complete root list is a habit worth breaking now, before the polynomials get longer.
Part C
The theorem splits into two implications pointing opposite ways. The first, call it (i), reads
and the second, (ii), reads
Statement (i) is the manufacturing direction. It starts from the division identity and observes that a zero value collapses it to , which is what being a factor means. In part A, fed straight into (i) and returned the factor .
Statement (ii) is the direction that produced the refusal, but it did not produce it directly. Read as it stands, (ii) begins by assuming something is a factor, and in part A nobody was willing to assume that about . What was used is its contrapositive.
An implication and its contrapositive say the same thing. "If it is a factor then the evaluation is zero" and "if the evaluation is not zero then it is not a factor" are the same claim expressed from opposite ends, so proving either one proves the other, and no extra work is owed:
That is how an implication produces a refusal: not by being reversed, which would be a different and unproved claim, but by being read backwards through its negations, which is free. Since is not zero, cannot be a factor, and no amount of dividing would change that.
The reason a single evaluation is always enough is now visible. Whatever number turns out to be, it is either zero or it is not. If it is zero, (i) fires and there is a factor. If it is not, the contrapositive of (ii) fires and there is not. A one-directional theorem would leave one of the two outcomes uncovered, and you would be left dividing to find out. Both directions together are what make the test decisive.
In one line
, so is a factor of , while is not zero, so is not. The form guarantees the roots and and leaves the rest of the root list entirely open, because is unknown. The positive verdict uses the implication from a zero value to a factor; the negative verdict uses the contrapositive of the implication from a factor to a zero value, which is why one evaluation settles the matter either way.
Another way: Divide instead of evaluating
The verdicts in part A can also be obtained by dividing. Dividing by gives
and the leftover is not zero, so the division is not exact and is not a factor. The remainder theorem says that leftover had to be , so this is the same number arrived at the long way.
When it is worth it When you want the quotient as well as the verdict, which is exactly the situation once the answer turns out to be yes. For a pure yes-or-no question the evaluation is far cheaper.
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
Evaluates the polynomial at the number that makes each candidate factor vanish, keeping the sign of that number straight, and shows the arithmetic. . Worth 2 points.
Turns each evaluation into a stated verdict about the corresponding factor, rather than leaving two numbers to speak for themselves. . Worth 1 point.
Part B 3 points
Names every number the displayed factors guarantee, treating the non-monic factor by solving for the value that makes it vanish rather than reading a number off it. . Worth 2 points.
Addresses explicitly what the unspecified factor does and does not settle about the remaining roots, instead of stopping at the ones the displayed factors name. . Worth 1 point.
Part C 4 points
States the theorem as two implications going opposite ways and assigns each verdict from part A to a specific one of them, rather than citing the theorem as a single undivided fact. . Worth 3 points. needs an explanation, not just an answer
Accounts for a refusal by reading an implication backwards through its negations, and distinguishes that from reversing the implication. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Let . Decide whether is a factor and whether is, and say which half of the theorem each verdict rests on.
The answer
, so is not a factor, by the contrapositive of the factor-to-root implication. , so is a factor, by the root-to-factor implication.
Test by evaluating at :
That is not zero, so is not a factor. This verdict rests on the contrapositive of the implication that a factor forces a zero value.
Test by evaluating at , since :
That is zero, so is a factor, by the implication that a zero value produces a factor. The two candidates differ only by a sign and the two verdicts differ completely, which is the point of substituting the value that kills the candidate rather than the value printed inside it.
-
-
2. Peeling a quartic down . Application, 11 points. Question 2 of 5.
A quartic is out of reach of every formula you have. What is in reach is the trade the factor theorem offers: hand it a root and it hands back a factor, leaving a polynomial one degree smaller to worry about. Two roots are supplied below, so the trade is available twice, and what survives both trades is small enough to finish by hand. The polynomial is
and you are told that and are among its roots.
- Part A.
Confirm that really is a root, then divide by the factor that root supplies and report the quotient.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part B.
Use the second given root to peel another factor off, working inside your part A quotient rather than starting again from . Then finish the job, taking the factorization of as far as it will go over the real numbers.
Carry your own answer forward Divide the cubic you produced in part A, whatever it came out to be. The marks below are for peeling a second factor off and finishing the factorization, not for the cubic you start from.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part C.
A classmate does part A, then reasons like this: ", so is a factor of . The quartic is times the cubic, so must be a factor of the cubic." Their conclusion is correct. Decide whether the reasoning as written establishes it, supply whatever is missing, and identify the one place where it matters that and are different numbers.
Justify your claim State the claim, then give the reason it has to be true. 5 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Every root you spend costs the polynomial one degree, and the next factor is to be looked for in what is left over, never back in the polynomial you started with.
-
Hint 2 of 4 · Part B
Do not return to the quartic for the second division. The cubic already carries the second root, and it carries smaller numbers with it.
-
Hint 3 of 4 · Part C
Write the result of the first division as an identity that is true at every value of , then substitute the second root into it and look hard at what each of the two factors becomes.
-
Hint 4 of 4 · Part C
A product of two numbers is zero only when at least one of them is zero. That is the fact doing the work, and it is useless unless you can point to one of the two numbers and say it is not zero.
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
, so the quotient is .
Part B
.
Part C
The conclusion is right but the reasoning skips a step. Evaluating at gives , and only because is that first number nonzero, which is what forces .
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
Confirming a given root costs one evaluation and is worth doing, because every later step inherits the mistake if the root is wrong:
So is a root, and the factor theorem promises for some cubic . Divide by to find it:
The last entry is the remainder, and it is zero, which confirms the root a second time. The entries before it are the coefficients of the quotient, one degree lower than :
A quartic problem has become a cubic problem, and that is the entire transaction. Multiplying by returns if you want the check.
Part B
The root supplies the factor , and the place to spend it is the cubic, not the quartic. The cubic has smaller numbers, one fewer root to account for, and it is where the remaining factors are hiding. Divide by :
The remainder is zero again, so and therefore
What is left is a quadratic, and a quadratic is always finishable. Two numbers multiplying to and adding to are and , so , giving
The roots of are therefore , , and . Two of them were given and two were earned, and the earning took one division and a quadratic factorization rather than any search. Note that both earned roots are negative although both given roots were positive: nothing about the first two roots predicts the sign of the rest.
A quick check without expanding all four brackets: the constant term of the product is , which matches , and the leading coefficient is in both.
Part C
The classmate's first sentence is sound: does give as a factor of , straight from the theorem. The second sentence is where the gap opens, and the gap is bigger than it looks.
The step being taken is: divides a product, therefore it divides one of the two things multiplied. That inference is not licensed in general. A divisor of a product need not divide either factor, and a one-line example settles it: divides exactly, since it IS that product, yet it divides neither nor , both of which have too small a degree to be multiples of it. So the classmate is invoking a rule that does not exist. That the conclusion happens to be true here is something still to be earned.
What earns it is the same move the ceiling proof uses: treat the factorization as an identity and evaluate it at the second root. From part A, holds for every , so it holds at :
Now the product of the two numbers and is zero, and a product of numbers is zero only when one of them is zero. The first one is not: it is . Therefore , and the factor theorem applied to this time gives as a factor of , which is what was wanted.
The place where the two numbers being different matters is exactly one line: the claim that is not zero. That is the whole content of here, and everything downstream leans on it. Suppose instead the second root had been over again. Then the same evaluation would read , which is true for every cubic whatsoever and therefore tells you nothing about . A repeated root has to be rechecked inside the quotient rather than inferred from the original, and this is the reason why.
So the classmate's instinct was right and their licence was missing. The corrected version is worth carrying: if and with , then after peeling off, the number is still a root of what remains.
In one line
Dividing by leaves the cubic , dividing that by leaves , and the completed factorization is , with roots , , and . The classmate's conclusion holds but their reasoning omits a step, and leans meanwhile on a rule that does not exist, since a divisor of a product need not divide either factor. Evaluating at gives , and it is precisely because that the factor is nonzero and is forced to be .
Another way: One division by a quadratic instead of two by linear factors
Both roots are known from the start, and part C establishes that with the two linear factors can be taken together. So is a factor of , and one long division delivers the rest in a single pass:
The quotient is the same quadratic the two-step route reached, and the two brackets then factor separately.
When it is worth it When every root you intend to use is known before you begin, so there is nothing to be gained from seeing the intermediate quotient. If you are peeling one root at a time and hunting in the leftovers, the step-by-step route is the one that shows you what you are hunting in.
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
Confirms the given root by evaluation before dividing, rather than taking it on trust. . Worth 1 point.
Divides by the correct linear factor and reports a quotient of the right degree with correct coefficients. . Worth 2 points.
Part B 3 points
Carries out the second division inside the quotient from part A rather than repeating a division on the original quartic. . Worth 2 points.
Deals with the quadratic that is left and presents the whole polynomial in its finished form, not as a partial factorization. . Worth 1 point.
Part C 5 points
Rules on the reasoning as written and supplies an argument that connects a value of to a value of the quotient, rather than restating the conclusion. . Worth 3 points. needs an explanation, not just an answer
Locates the single point at which the argument uses that and are different numbers, and says what would go wrong there if they were equal. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Factor completely, given that is a root.
The answer
.
Confirm the root first:
So is a factor. Divide by , using the coefficients :
The quotient is , and two numbers multiplying to and adding to are and :
So the complete factorization is , and the roots are , and . Every coefficient of the original is positive, which is consistent with what came out: a positive number substituted into it can never give zero, so all three roots had to be negative.
-
-
3. Built to order . Application, 13 points. Question 3 of 5.
Read backwards, the factor theorem stops being a tool for taking polynomials apart and becomes a tool for making them. Choose the numbers you want it to vanish at, write down the factor each one contributes, and the product does what you asked. The interesting question is what that construction does not decide, and how much extra information it takes to close the gap.
- Part A.
Find a cubic polynomial whose roots are , and and whose graph passes through the point . Give your answer both in factored form and expanded.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part B.
Must every polynomial whose roots are exactly , and be a cubic? Decide, and argue for your decision. Say as much as you can about what the three roots do force about the degree.
Justify your claim State the claim, then give the reason it has to be true. 4 points
- Part C.
A classmate proposes: "Two nonzero polynomials have the same roots if and only if one of them is a nonzero constant multiple of the other." Examine each direction of that claim on its own and report the status of the claim as a whole. If a direction fails, exhibit a specific pair of polynomials that breaks it, and then state an extra condition under which that direction becomes true, saying how the peeling argument delivers it.
Justify your claim State the claim, then give the reason it has to be true. 5 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Prescribed roots fix the factors and nothing else. Anything a question supplies beyond the root list is there to choose among the many polynomials that share those roots.
-
Hint 2 of 4 · Part A
Write the polynomial as an unknown constant times the product of its factors, then let the given point turn that unknown into a number. Do not expand before the constant is settled.
-
Hint 3 of 4 · Part B
Ask what stops you from writing a factor down twice, or from attaching a quadratic that never reaches zero anywhere on the real line. Then ask what the ceiling on distinct roots still forbids.
-
Hint 4 of 4 · Part C
For the direction that resists, try to hold a root list absolutely fixed while changing the polynomial by something other than a scale factor. Matching the two degrees as well makes the example harder to dismiss.
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
, which expands to .
Part B
No. Three distinct roots force the degree to be at least and nothing more: has degree and has exactly those three numbers as its roots.
Part C
Only one direction holds. A nonzero constant multiple does preserve every root, but shared roots do not force a constant multiple, even between polynomials of equal degree. Requiring both to have degree and the same distinct roots repairs the failing direction.
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
Each prescribed root contributes the factor , minding the sign: the root gives , not . Three roots and degree three leave room for nothing but a constant out front, so the polynomial must have the shape
Every member of that family already has the three roots asked for, so the point is what chooses . Substitute and set the value to :
That is the factored answer, . Expand in stages rather than all at once. The two brackets with plain numbers first:
Then multiply by :
Finally scale by :
Check both requirements against the expanded form, since a sign slip in the expansion would otherwise survive. The point: . A root: . The negative leading coefficient is not a mistake; it is what the given point asked for.
Part B
There are two halves here, and they pull in opposite directions.
One half is a genuine restriction, and it is the ceiling read backwards. A nonzero polynomial of degree has at most distinct roots, so a polynomial with three distinct roots cannot have degree , or :
The zero polynomial is excluded automatically, since every number is a root of it and its root list is not the three named numbers. So the degree is at least three, and that much the roots really do force.
The other half is that nothing pushes back from above. A factor may be repeated, and repeating one changes the degree without adding a single new root:
has degree . A product of numbers is zero only when one of its factors is zero, so this polynomial vanishes exactly at , and , the same three numbers as before. It is not a cubic, and it meets every condition stated.
The trick is not limited to repetition either. Multiplying by any quadratic that never reaches zero on the real line adds degree and no real roots at all: has discriminant , so has degree and still exactly those three real roots.
So the honest statement is one-sided. A root list is a floor on the degree and never a ceiling on it, and the word "cubic" in part A was doing work that the three roots alone could not do.
Part C
Two claims are bundled here, and each has to be met separately.
The direction from a constant multiple to shared roots is true, and it is quick. Suppose with . Then at any number ,
and since , the product is zero exactly when is. So and vanish at precisely the same numbers, and a scale factor never moves a root.
The direction from shared roots to a constant multiple is false. Part B already supplies the raw material, and the sharpest version of it uses two polynomials of the same degree so that a difference in degree cannot be blamed:
Both are quartics, and both vanish exactly at , and . If held for some constant , that equation would have to hold at every value of . Test two of them. At :
At :
No single constant can be both, so no such exists and the direction fails. The claim as a whole is therefore not an equivalence: it is one true implication with a false converse attached.
What repairs it is a condition strong enough to leave no room for the roots to be arranged differently. Suppose and are nonzero, both of degree , and both have the same distinct roots . Peel them off one at a time. Each root removes one linear factor and drops the quotient's degree by exactly one, and after all peels the leftover has degree , so it is a nonzero constant :
The same argument on gives the same product with some nonzero constant in front, so , a nonzero constant multiple. The counterexample above is not a threat to this, and it is worth seeing why: those quartics have only three distinct roots between them, not four, so the repaired hypothesis was never satisfied. What the extra condition buys is that the number of distinct roots uses up the entire degree, leaving nothing for the polynomials to differ by except a scale factor.
In one line
The cubic is . A polynomial with exactly those three roots need not be a cubic: the roots force the degree to be at least and impose no upper limit, as shows. The classmate's claim is not an equivalence. A nonzero constant multiple always preserves the roots, but and share their roots and their degree without being constant multiples of each other. Requiring both polynomials to have degree and the same distinct roots repairs that direction, because peeling all roots off leaves a leftover of degree .
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 4 points
Writes the polynomial as an unknown constant times the three factors, with each factor's sign matching its root, before using the point. . Worth 2 points.
Solves for the constant from the given point and expands correctly, presenting both requested forms. . Worth 2 points.
Part B 4 points
Rules on the question and, where the ruling calls for one, backs it with an explicit polynomial meeting every stated condition rather than with a general remark about what is or is not possible. . Worth 3 points. needs an explanation, not just an answer
States what the three roots do settle about the degree, and attributes that restriction to the ceiling on the number of distinct roots rather than leaving it as an observation. . Worth 1 point.
Part C 5 points
Splits the claim into its two implications and rules on each one on its own evidence, then reports the status of the claim as a whole rather than issuing a single verdict on the pair. . Worth 3 points. needs an explanation, not just an answer
Backs whichever ruling needs it with a specific pair of polynomials, and settles by computation what constant, if any, relates that pair, instead of asserting the outcome. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Find the cubic polynomial whose roots are , and and whose graph passes through .
The answer
.
The three roots force the shape . Substitute the point:
Expand the two brackets with plain numbers first, , then multiply by :
Scaling by gives , and the check confirms it.
-
-
4. More roots than there is room for . Reasoning, 12 points. Question 4 of 5.
Peeling costs a degree every time, and a degree cannot go below zero. That single observation puts a hard ceiling on how many distinct numbers a polynomial can vanish at, and the ceiling turns out to be worth more than it looks: it can force a polynomial to be zero without any of its coefficients ever being computed. This question pushes the ceiling as far as it goes and then marks the line it must not be pushed past.
- Part A.
Let , where , , and are real numbers, any of which may be zero. Suppose . Prove that , , and are all zero, without solving any system of equations. State which theorem you appeal to and check that its hypotheses hold.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 5 points
- Part B.
Now let and , with all eight coefficients real. Suppose and take the same value as each other at four different numbers. Must and be the same polynomial? Decide, and argue it in a way that handles all four agreement points at once.
Carry your own answer forward This part leans on the statement you established in part A. Quote that statement and argue from it here even if your proof of it felt shaky; the marks below are for the argument you build on top of it, not for part A a second time.
Justify your claim State the claim, then give the reason it has to be true. 4 points
- Part C.
A classmate reads the ceiling as a count and says that a quartic therefore has four roots and a quadratic two. Explain what the ceiling actually licenses and what it does not, and back the explanation with two polynomials of your own, chosen so that between them they display two different reasons the classmate's reading cannot be relied on.
Explain why it works A sentence or two. Reasons, not steps. 3 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
The ceiling on roots speaks only about a polynomial that is not identically zero. So the way to use it is to suppose you have such a polynomial and then count roots until the count becomes absurd.
-
Hint 2 of 3 · Part B
Two objects that must be shown equal are usually easier to handle as one object that must be shown to vanish. Build that one object and check what shape it has.
-
Hint 3 of 3 · Part C
Nothing in the proof of the ceiling ever manufactures a root; every step consumes one you already had. Look for a polynomial whose factors run out of different values, and for one whose graph never meets the axis.
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
All four coefficients are . If they were not, would be a nonzero polynomial of degree at most , so it could have at most distinct roots, and four different numbers are given as roots.
Part B
Yes. Their difference has the same shape, vanishes at all four of those numbers, and so has all four coefficients zero by part A, which means , , and .
Part C
It licenses only an upper bound on the number of distinct roots and never promises any. has degree and just two distinct roots, and has degree and no real root at all.
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
Argue by ruling out the alternative. Suppose, for contradiction, that at least one of , , , is not zero. Then is a nonzero polynomial, and its degree is whichever of , , , is fixed by the highest surviving coefficient. In every case:
The theorem to appeal to is the ceiling proved in this lesson: a nonzero polynomial of degree has at most distinct roots. It has two hypotheses and both must be checked rather than assumed.
The first is that the polynomial is not the zero polynomial, and that is exactly what the contradiction hypothesis grants: some coefficient is nonzero. The second lives in the phrase "distinct roots", and it is about the numbers supplied, not about . The four given numbers are , , and , and no two of them are equal, so they are four distinct roots and each one peels off a genuinely new factor.
So is a nonzero polynomial of degree at most with at least distinct roots, and the ceiling says it has at most of them:
That chain ends in , which is false. The assumption that produced it was that some coefficient is nonzero, so that assumption fails, and every one of , , , is zero.
Notice what was not needed. Nobody expanded anything, nobody solved four simultaneous equations, and no property of the particular numbers , , , was used beyond their being four and being different from one another. Any four distinct numbers would have done the same work.
Part B
Comparing two polynomials point by point goes nowhere, because four agreements are four equations in eight unknowns. The move that works is to stop looking at two objects and start looking at one. Define their difference:
Subtracting coefficient by coefficient shows has exactly the shape part A was about: a cubic expression whose four coefficients are real numbers, any of which may be zero.
Now translate the hypothesis. Saying and agree at a number says , which says . So the four agreement points are four roots of the single polynomial , and they are four different numbers because the agreement points were:
Part A applies verbatim and forces every coefficient of to be zero. Reading those four statements back gives , , and , so and are the same polynomial, and in particular at every value of , not just at the four where agreement was assumed.
The result is worth keeping in this form: a polynomial of this shape is completely pinned down by its values at four different numbers. Three points would not do it, and the failure is easy to see, since and agree at , and without being equal. Four is exactly the number that closes the gap for degree three, because it is one more than the ceiling.
Part C
The theorem is an inequality, and the classmate has read it as an equation. What it says is
for a nonzero , and an inequality in that direction can only ever forbid roots. It never produces one. That is visible in the proof itself: every step starts from a root you already have and converts it into a factor. Nothing in the argument creates a root out of nothing, so nothing in the conclusion can promise one.
There are two separate ways the actual count can come in under the degree, and one example of each makes the point.
The first way is a repeated factor. Take
Multiplying out would give a genuine quartic, and a product is zero only when one of its factors is zero, so vanishes at and at and nowhere else. Degree four, two distinct roots. The degree is spent on factors, and factors are allowed to repeat, while roots are counted as the distinct numbers they are.
The second way is that a factor may never reach zero at all. Take
A negative discriminant means no real number satisfies , so this quadratic has no roots among the real numbers. Degree two, no real roots, and the ceiling is perfectly content, since zero is comfortably at most two.
So the licensed reading is one-directional. If someone hands you four different numbers at which a nonzero quartic vanishes, the ceiling lets you conclude the list is complete and stop looking. It never lets you start by asserting that four such numbers exist. "At most" is a permission to stop searching, not a guarantee that the search would succeed.
In one line
If vanishes at four different numbers then all four coefficients are zero, because otherwise a nonzero polynomial of degree at most would have at least distinct roots. Applying that to the difference shows two such polynomials agreeing at four different numbers must be identical, coefficient by coefficient. The ceiling is only an upper bound: has degree with two distinct roots, and has degree with no real root, and both are entirely consistent with 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
Argues by supposing the polynomial is not identically zero and deriving an impossibility, rather than by manipulating the four equations the roots supply. . Worth 3 points. needs an explanation, not just an answer
Names the theorem used and checks each of its hypotheses against this situation, including that no two of the four given numbers are equal. . Worth 2 points.
Part B 4 points
Reaches a verdict through an argument that treats all four agreement points at once, rather than by testing values or comparing coefficients one pair at a time. . Worth 3 points. needs an explanation, not just an answer
Expresses whatever conclusion it reaches in terms of the two polynomials as a whole, as an identity or as a statement about their coefficients, rather than in terms of the four given numbers alone. . Worth 1 point.
Part C 3 points
Characterises the theorem as an upper bound and says what that permits and what it withholds, rather than restating the theorem. . Worth 2 points. needs an explanation, not just an answer
Supplies two polynomials illustrating two genuinely different mechanisms, and shows for each why its root count is what it is claimed to be. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
A polynomial of the form satisfies , and . Find , and .
The answer
, and , so is the constant polynomial .
The three given values are all the same, which is the signal to subtract that value off and look at what is left. Define
which has the shape of a polynomial of degree at most , and which vanishes at , and .
If were not the zero polynomial it would be a nonzero polynomial of degree at most , so it could have at most distinct roots. It has three, and , , are pairwise different, so must be the zero polynomial:
Hence , and , that is, is the constant polynomial . Substituting back confirms it takes the value at all three numbers, and indeed everywhere else too.
-
-
5. Two roots at once . Reasoning, 14 points. Question 5 of 5.
One root buys one linear factor. Two roots ought to buy the product of two linear factors, and the argument that they do is only a few lines long, but it leans on an assumption the notation carries so quietly that it is easy to read straight past. This question proves the statement, then tests what that assumption is holding up, and finally puts the same question to each half of the corresponding "if and only if" separately.
- Part A.
Let be a polynomial and let and be numbers with . Suppose and . Prove that is a factor of . Say at which step the assumption is spent.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 5 points
- Part B.
Show that the hypothesis in part A cannot simply be dropped. Give a specific polynomial and a specific number for which the conclusion fails once and are allowed to be the same number, and demonstrate the failure rather than asserting it.
Construct a counterexample Give one specific case, and show it breaks the claim. 4 points
- Part C.
Now consider the two-way claim: " is a factor of if and only if and ." Rule on each direction separately, stating for each one whether it needs any hypothesis about and at all. Then report whether the claim as printed is a genuine equivalence, and if it is not, write down a version that is.
Justify your claim State the claim, then give the reason it has to be true. 5 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Two roots ought to give two factors, but the second factor has to be extracted from the quotient the first one leaves behind, and it is during that extraction that a hypothesis is quietly spent.
-
Hint 2 of 4 · Part B
Read the claim with the two letters standing for the same number and see what it is then asserting. Then hunt for the smallest polynomial you can find that refuses to cooperate.
-
Hint 3 of 4 · Part B
To rule out a factor, suppose it is one and count degrees. The other factor's degree is forced, which usually leaves so little freedom that a single coefficient settles the matter.
-
Hint 4 of 4 · Part C
Grade the two directions in isolation before saying anything about the pair. One of them can be proved by substituting into an identity and needs no assumption at all; the other is the one parts A and B were about.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
For distinct and , divides . The hinge is the step after peeling off: because , the quotient is forced to vanish at .
Part B
Take and . Then , but is not a factor of : a degree count would force to equal exactly, and it does not.
- Any polynomial with a root whose factor occurs once does the job, and the smaller the polynomial the shorter the demonstration: with works, because has degree and a degree- polynomial cannot be a factor of a nonzero degree- one
- A cubic such as with works the same way, with the degree count leaving a quadratic other factor to compare against
Part C
The direction from factor to roots is true with no hypothesis whatever. The direction from roots to factor is not guaranteed as printed, with part B as a witness. So the printed claim is not an equivalence; restricting it to makes both directions hold and turns it into one.
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
Take the two roots one at a time, and take the second one inside what the first one leaves behind.
Since , the factor theorem supplies a polynomial with
an identity holding at every value of . The temptation now is to apply the factor theorem to a second time and declare a factor of . That is true, but it is not what is wanted: the goal is the product, so has to be found inside .
Evaluate the identity at , which is legitimate precisely because it is an identity:
Here is where the hypothesis is spent, and it is spent at exactly one step. The left side is a product of two numbers, and , and a product of numbers is zero only when one of them is zero. To conclude anything about you must know the other number is not zero, and is nothing other than the assumption . With it, the conclusion is forced:
Now apply the factor theorem to , which is a perfectly good polynomial in its own right: for some polynomial . Substituting back,
which says exactly that is a factor of , with as the other factor.
The shape of the argument is worth naming, because it is the engine of the whole chapter. Each root is converted into a factor and then evicted from the problem, and the next root is chased inside the smaller polynomial rather than the original. Repeat it and you get the ceiling on the number of roots; stop after two and you get this.
Part B
With the claim of part A becomes: if then is a factor of . So a counterexample needs a polynomial with a root whose factor appears only once.
Take
Check what this choice does and does not satisfy. The two root equations hold, and cheaply: , so and are both true. What it deliberately violates is part A's other assumption, the distinctness of and , which is the entire point of the construction.
Now demonstrate that the conclusion fails. Suppose were a factor, so that
for some polynomial . Degrees add across a product, and has degree while has degree , so has degree : it is a constant. Comparing the coefficients of on the two sides makes that constant , which leaves
But , and those are not the same polynomial: their constant terms are and . The supposition is impossible, so is not a factor of and the conclusion of part A genuinely fails.
The reason it fails is visible in the proof. With , the step that carried the whole argument reads
which is true no matter what is, and therefore tells you nothing about it. The proof did not merely become harder; it lost its content at exactly the line where the hypothesis used to sit.
Part C
An "if and only if" is two claims travelling under one name, and the only safe way to grade one is to detach them.
Take the direction from the factor to the roots first. Suppose is a factor of , so for some polynomial . That is an identity, so evaluate it at and then at :
In each case one bracket is literally zero and takes the product with it. No assumption about and entered anywhere, and none is needed: this direction is true even when , where it just says that if is a factor then is a root, which it is.
Now the direction from the roots to the factor. Read it for what it is: a guarantee offered for every polynomial at once. When the guarantee is good, and that is exactly part A. When is allowed, it is no longer a guarantee, because part B produces a polynomial meeting the hypothesis and failing the conclusion. One such polynomial is all it takes, since a claim about every polynomial is refuted by a single one.
Be careful not to overstate what that shows. Allowing does not make the conclusion fail every time: has and does have as a factor, so it satisfies both sides quite happily. The point is not that forces failure, it is that stops success from being guaranteed.
So the two directions have different statuses, and that settles the printed claim: it is not an equivalence, because an equivalence requires both directions and only one of them survives as stated. It is a true implication with a converse that fails in one case.
The repaired version restores the missing hypothesis and puts it where both directions can see it. For any polynomial and any two numbers with ,
Under that restriction the forward direction is the argument above, which never wanted the hypothesis, and the backward direction is part A, which does. Both hold, so this one really is a biconditional.
It is worth noticing how the failure was distributed, because this is the usual pattern. The claim did not break everywhere, and it did not break everywhere in the case that sinks it either. What admitting does is let in polynomials the guarantee cannot cover, and that case is easy to miss precisely because the notation makes it look as though there are two factors when there may be only one.
In one line
If and , then peeling off and evaluating the identity at gives , and forces , so divides . The hypothesis cannot be dropped: has while is not a factor. In the two-way claim, the direction from factor to roots holds with no hypothesis at all, while the direction from roots to factor is guaranteed for every polynomial when and is not guaranteed once is allowed, as part B's polynomial shows. So the claim as printed is not an equivalence, and the version restricted to 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
Peels one factor off first and then locates the second root inside the quotient, instead of applying the factor theorem twice to the original polynomial and multiplying the results. . Worth 3 points. needs an explanation, not just an answer
Justifies the step from a zero product to a zero factor, and identifies the assumption that makes the other factor nonzero at that step. . Worth 2 points.
Part B 4 points
Chooses a polynomial and a number that satisfy part A's remaining assumptions, and says explicitly what the claim reduces to once the two letters name the same number. . Worth 2 points.
Demonstrates that the squared factor is genuinely not a factor, by a degree count or an equivalent argument, rather than by observing that it does not look like one. . Worth 1 point.
Traces the failure back to the specific step of part A that stops working, instead of leaving the counterexample unexplained. . Worth 1 point.
Part C 5 points
Rules on the two directions separately, and for each one states whether any assumption about and was used in reaching that ruling. . Worth 3 points. needs an explanation, not just an answer
Reports the status of the printed claim as a whole, and where a correction is called for, writes it out precisely enough that the standing of each direction under it is clear. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
A polynomial satisfies . Must be a factor of ? Decide, and support your decision with a specific polynomial.
The answer
No. For example has , and a degree count rules out as a factor of it. The root does not force the squared factor, though it does not forbid it either.
It need not be. The root guarantees the factor once, and nothing in the factor theorem says how many times a factor occurs.
Take , which satisfies the hypothesis:
Suppose were a factor, so . Degrees add, and both and have degree , so is a constant, and matching the coefficients of makes it . That would give
which is not . So no such exists and is not a factor. In fact , and the second factor is nowhere near a copy of the first.
Note what is not being claimed. Some polynomials with do carry , and itself is one. The answer is that the root does not force it, not that it rules it out.
-