Complex and Irrational Roots: Free Response
5 questions in parts, 55 points in total. Work each one out on paper, taking a hint if you get stuck. When you have an answer, reveal the answer to check it, and the full solution only if you still want it. The rubric is there so you can mark your own work.
-
1. One root, and the factor it drags in . Foundational, 10 points. Question 1 of 5.
A nonreal root of a real polynomial is never travelling alone, and it is worth more than a second root: the two partners together hand you a quadratic factor carrying no at all, and a factor is something you can divide by. The hypothesis behind all of that is worth keeping in view throughout, because the last part puts it to the test.
- Part A.
A polynomial has real coefficients, and is one of its roots. Write down the monic quadratic with real coefficients that must divide , and show where each of its two coefficients comes from.
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part B.
Given that is a root of , find every root of .
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part C.
A classmate says the pairing is a property of the number itself: wherever turns up as a root, turns up beside it. Test that against , which does have as a root, and say what the pairing actually turns on.
Justify your claim State the claim, then give the reason it has to be true. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Two roots that are conjugates of each other have a real sum and a real product, which is why multiplying their linear factors together clears every out of the way.
-
Hint 2 of 4 · Part A
Write the root in the form and read off and before multiplying anything. One of the two coefficients you need is and the other is .
-
Hint 3 of 4 · Part B
A quadratic factor is a divisor. Once you have one, the cubic can be divided by it in two steps, and whatever is left over is where the remaining root lives.
-
Hint 4 of 4 · Part C
Before accusing a theorem of failing, check whether its hypothesis was ever satisfied by the polynomial in front of you. Read the coefficients one at a time.
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
.
Part B
, and .
Part C
The claim does not survive. , which is not , and is entitled to behave that way because two of its coefficients, and , are not real, so the theorem never applied to it.
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
Real coefficients are exactly what the conjugate root theorem asks for, so the conjugate of is a root of as well. Conjugating flips the sign of the imaginary part and leaves the real part alone:
The two are different numbers, because the imaginary part is not zero, so both linear factors divide and therefore so does their product. Multiply them by taking the sum and the product of the pair separately, since those are the two quantities in which the cancels:
The product used with and : the two cross terms cancel, and becomes . Now assemble the quadratic, whose middle coefficient is the negative of the sum and whose constant term is the product:
Both coefficients came out real, as the general shape promises. Notice that the sign of never mattered: the sum used and the product used , so the pair and would have produced the same factor in the same order.
Part B
The quadratic from part A is the tool. Since and are two distinct roots of , the product of their linear factors divides exactly, so divides with no remainder.
Carry the division out, staying inside the real numbers throughout, since both the divisor and the dividend are real. The first step is , and ; subtracting leaves . The next step is , and ; subtracting leaves nothing at all:
The remainder of zero is a check on part A as much as on the arithmetic here. The quotient contributes the root , and a cubic has exactly three roots counted with multiplicity, so the list is finished:
The third root had no choice about being real. The pair consumed two of the three slots, and a nonreal root in the last slot would have needed a partner of its own, with nowhere left to put it.
Part C
Test the claim where it is being made, which means evaluating at both numbers rather than reasoning about them.
First confirm the premise. Squaring gives , and the middle term is :
So really is a root of , and the classmate's claim is being applied to a polynomial that satisfies its premise. Now do the same work at the partner. Here , and :
That is not zero, so is not a root of , and the claim fails on the very first polynomial it is asked about.
No theorem was violated. The conjugate root theorem is a conditional, and its hypothesis is that every coefficient is real. The coefficients of are , and , and the last two are not real numbers, so the theorem was silent about from the start. Factoring makes the situation visible:
Two nonreal roots, and they are not conjugates of each other: is nowhere on that list, and neither is . Nothing about requires either of them to be there. So the pairing is not a property of the number . It is a property of the polynomial that has it as a root, and specifically of that polynomial's coefficients: the same number is paired inside and unpaired inside .
In one line
The pair and forces the real quadratic factor . Dividing by it leaves , so the roots of are , and . The classmate's claim does not survive: is not zero, and is free to behave that way because two of its coefficients, and , are not real. The pairing belongs to a polynomial's coefficients, not to the number that happens to be a root.
Another way: Find the real root first
Part B can be worked from the other end. The polynomial has integer coefficients and leading coefficient , so any rational root divides , and is on that list:
Dividing by leaves , whose discriminant is , so the quadratic formula finishes the job:
The same three roots arrive, and the conjugate pair shows up without ever being invoked.
When it is worth it When no root has been handed to you, so there is nothing to pair with. It is the slower route here, since the candidate list for is long while the given root produces the quadratic factor immediately.
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
Identifies the second root the real-coefficient hypothesis forces, and attributes it to that hypothesis rather than assuming a second root or inventing one. . Worth 2 points.
Builds the quadratic from the pair's sum and product, and reports coefficients with no left anywhere in them. . Worth 1 point.
Part B 3 points
Reduces the cubic by dividing out a factor whose presence has been established, and finds the remaining root inside the quotient rather than asserting three roots with no division shown. . Worth 2 points.
Completes the division and reports a full list of three roots, not a partial factorization. . Worth 1 point.
Part C 4 points
Rules on the claim and backs the ruling by evaluating at the partner, rather than by citing the theorem or by inspecting the polynomial's appearance. . Worth 3 points. needs an explanation, not just an answer
Names the feature a polynomial must have for the pairing to be guaranteed, and checks 's coefficients against it one at a time. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Given that is a root of , find every root.
The answer
, and .
The coefficients are real, so is a root as well. The pair has sum and product , so it forces the real quadratic factor
Watch the middle sign: that coefficient is the negative of the sum, and the sum is negative here, so it comes out positive.
Divide. The first step gives , and ; subtracting leaves , which is exactly times the divisor, so the remainder is zero:
The third root is , and a direct check confirms it: .
-
-
2. The other conjugate . Application, 9 points. Question 2 of 5.
Swap for and the proof of the pairing runs again word for word, but it is charged a different price: the coefficients now have to survive the new swap, and the numbers this swap leaves alone are the rational ones. The theorem that comes out looks like a twin of the first. This question keeps the two side by side and asks what each one is actually worth.
- Part A.
A polynomial has rational coefficients, and is one of its roots. Write down the monic quadratic with rational coefficients that must divide .
Write the expression An equation or an expression is enough here. Show how you built it. 2 points
- Part B.
Given that is a root of , find every root of .
Write the expression An equation or an expression is enough here. Show how you built it. 3 points
- Part C.
A classmate proposes a cheaper hypothesis: real coefficients ought to be enough, since is itself a real number and real coefficients were enough to pair roots before. Decide whether a polynomial with real coefficients having among its roots must also have among them, and say what real coefficients do and do not buy.
Justify your claim State the claim, then give the reason it has to be true. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
The bar and the star are two different swaps. Each one proves its own pairing theorem, and each one demands that every coefficient be left untouched as it passes through.
-
Hint 2 of 3 · Part A
Take the sum of the two partners and their product separately. The product is where the radical cancels, by the difference-of-squares pattern, and it is the constant term you need.
-
Hint 3 of 3 · Part C
Every rational number is real, but the claim needs the traffic to run the other way. Look for the smallest polynomial you can write that has the given root, now that irrational coefficients are allowed.
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
.
Part B
, and .
Part C
It need not. The polynomial has real coefficients and as its only root. Real coefficients guarantee the complex pairing and guarantee nothing at all about the surd partner, which is what the rational hypothesis is for.
- Any polynomial with real coefficients that has as a root and does not have as one will serve, such as . The degree- witness is simply the cheapest to check.
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
Every coefficient is rational and is irrational, so the surd conjugate theorem applies. Its swap changes the sign of the term and nothing else:
The two partners are different numbers, so both linear factors divide , and so does their product. Take the sum and the product of the pair:
The product is where the radical dies, by the difference-of-squares pattern. Assembling the quadratic,
and both of its coefficients are rational, as they had to be. This is the general shape with , and , since . Only ever enters the factor, so the sign of makes no difference to it. Mind the sign in that constant term. The complex pair produced , a sum, because flipped a sign on the way; here flips nothing, so a difference is what appears.
Part B
Part A supplies the divisor. The two partners are distinct roots of , so divides exactly, and every number the division touches is rational.
The first step is , and ; subtracting leaves . The next step is , and ; subtracting leaves nothing:
The remaining factor gives the third root, and the cubic has exactly three roots counted with multiplicity, so the list is complete:
That third root had no choice about being rational. The surd pair used two of the three slots, and what was left came from dividing one rational polynomial by another, so the leftover factor has rational coefficients, and a rational linear factor has a rational root.
Part C
The question is whether the weaker hypothesis is strong enough on its own, so try to build something that satisfies it and defies the conclusion. Nothing says the polynomial has to be complicated:
Its coefficients are and . Both are real numbers, since is real, so meets the classmate's hypothesis exactly. A polynomial of degree has one root, and that root is . The proposed partner is not it:
So real coefficients do not force the surd partner, and the proposal fails.
Nothing has gone wrong with the conjugate root theorem, either. It applies perfectly well to , and what it says is empty here: is a real number, a real number is its own complex conjugate, so the theorem hands back the root you already had. All of its content lives in the nonreal roots.
The two hypotheses buy two different things because the two swaps fix two different sets of numbers. Complex conjugation fixes exactly the real numbers, so real coefficients pass through it untouched and the complex pairing follows. The surd swap fixes exactly the rational numbers, and it does not fix every real number: it moves the coefficient of to , which is precisely the step at which the proof refuses to run for .
One caution in the other direction, because it is easy to overcorrect into a second false claim. Rational coefficients are sufficient for the partner, not necessary: has irrational coefficients and carries both partners among its roots. What is true is that with merely real coefficients there is no guarantee either way, and the polynomial in part B and the polynomial here show the two outcomes occurring side by side.
In one line
The partner is forced, and the pair forces the rational quadratic factor . Dividing by it leaves , so the roots of are , and . The classmate's weakening fails: has real coefficients and the root without the partner. Real coefficients buy the complex pairing and nothing else; the surd pairing is what rational coefficients buy, and rational is sufficient for it rather than necessary.
Another way: Reach the quadratic without naming the partner
Part A can be done by isolating the radical instead of invoking the theorem. If then , and squaring both sides removes the radical:
So is a root of the monic rational quadratic , reached without the partner being mentioned once.
A shared root is not yet a divisor, though, so one step remains. Divide inside the rational numbers: with and rational, since is monic and rational. Substituting , where and , leaves . If were not zero then would be a ratio of rational numbers and so rational, which is not. So , then , the remainder vanishes, and divides .
When it is worth it As a check on the partner the theorem hands you, and whenever a root is written in a form whose partner you are unsure of. Squaring is what quietly introduces the partner, since leads to the same equation.
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 2 points
Produces the quadratic from the pair's sum and product, reporting a constant term with no radical left in it and a sign that matches the surd pattern rather than the complex one. . Worth 2 points.
Part B 3 points
Divides out a factor whose presence has been established and works the third root out of the quotient, instead of naming it with no reduction shown. . Worth 2 points.
Completes the division and reports all three roots, keeping the surd pair in exact form rather than rounding it. . Worth 1 point.
Part C 4 points
Rules on the proposal and, where the ruling calls for one, exhibits a specific polynomial that meets every stated condition and fails the proposed conclusion. . Worth 3 points. needs an explanation, not just an answer
Separates what the real hypothesis guarantees from what the rational hypothesis guarantees, instead of treating the two pairing theorems as one theorem with two notations. . Worth 1 point.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Given that is a root of , find every root.
The answer
, and .
The coefficients are rational and is irrational, so the partner is a root. The swap flips the sign of the radical term only, so the partner is not .
The pair has sum and product , giving the rational factor
Divide. The first step gives , and ; subtracting leaves , which is times the divisor, so the remainder is zero:
The third root is , and checking directly, .
-
-
3. Built to order, twice over . Application, 11 points. Question 3 of 5.
Prescribing roots is easy. Prescribing which number system the coefficients have to live in is what makes the degree hard to predict, because that choice decides how many extra roots come along uninvited. Here two roots are prescribed, one of them repeated, and the same question is asked twice under two different demands on the coefficients. Keeping the two pairing theorems apart is what settles each one.
Throughout, is a polynomial having as a root and as a root of multiplicity .
- Part A.
Suppose has rational coefficients. What is the least possible degree of ? State what your number counts.
Solve and show your work Write each step out, and end with the value and its units. 2 points
- Part B.
Still with rational coefficients, write the monic polynomial of that least degree. Leaving it as a product of factors with rational coefficients is enough; nothing is learned by expanding it.
Write the expression An equation or an expression is enough here. Show how you built it. 4 points
- Part C.
Now weaken the demand: is required only to have real coefficients, with the same two roots and the same multiplicity as before. Give the least possible degree under that weaker demand, and account for any difference from your answer to part A.
Justify your claim State the claim, then give the reason it has to be true. 5 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 3
A repeated nonreal root does not merely force its partner to appear. It forces the partner to appear the same number of times, and that costs degree.
-
Hint 2 of 3 · Part A
Count the roots the hypotheses force before writing any polynomial down. Each root costs one degree, and a root of multiplicity two costs two.
-
Hint 3 of 3 · Part C
Two theorems were firing at once in the first case. Weakening the coefficients switches exactly one of them off, so ask which pair loses its guarantee and what that pair was contributing.
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
, counting the roots the two hypotheses force, each as often as its multiplicity requires.
Part B
.
Part C
, one less than before. Real coefficients still force to appear twice, but they force no partner for , so meets every condition.
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
Rational coefficients are real coefficients as well, so both pairing theorems fire at once, and the roots they force have to be counted before any polynomial is written down.
The surd theorem applies to , since , and are all rational and is irrational. It forces the partner : one further root.
The conjugate root theorem applies to and forces . It forces more than a bare appearance, though. A root and its conjugate occur with the same multiplicity, because every nonreal root of a real polynomial comes from a real quadratic factor , and each appearance of that factor supplies one copy of each. So is a root of multiplicity as well.
Now add up the forced roots, counting each as often as its multiplicity requires:
A polynomial cannot carry more roots counted with multiplicity than its degree, so the degree is at least . A lower bound is only worth what meets it, and part B builds a polynomial of degree exactly satisfying every condition, so the least possible degree is .
Part B
Build each pair into its own quadratic first. That is the move that clears the radical in one case and the in the other.
The surd pair has sum and product :
The conjugate pair has sum and product :
That second quadratic supplies once and once. The requirement is two of each, so it appears squared. Multiplying the pieces gives a polynomial of degree :
Every factor has rational coefficients, so the product does too, and the leading coefficients multiply to , so it is monic. The factored form is also the informative one: it displays all six roots and the multiplicity of each, which any expansion would bury.
Part C
Weakening the hypothesis switches off exactly one of the two theorems, so the honest way to answer is to ask which.
The conjugate root theorem asks only for real coefficients, so it still applies in full. The root of multiplicity still forces of multiplicity , and is still a factor, consuming degree .
The surd theorem is the casualty. It asks for rational coefficients, and there is now no rational hypothesis to appeal to. So has to be present once and forces no partner at all, consuming degree :
A lower bound needs a polynomial that meets it, so exhibit one:
Its coefficients are real, since is a real number, and its roots are once and , twice each: every condition met, at degree .
The gap between and is the distinction the lesson keeps drawing, priced in degrees. Real coefficients pair up nonreal roots and say nothing whatever about irrational ones. The surd pairing was what the rational hypothesis was buying, and the cost of giving it up is exactly one root.
In one line
With rational coefficients the least degree is , achieved by , because both partners are forced: by the surd theorem and with multiplicity by the conjugate root theorem. With only real coefficients required the least degree is , achieved by , because the conjugate pairing survives untouched while the surd partner is no longer forced at all.
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 2 points
Adds up the roots the two hypotheses force, counting a repeated root as many times as its multiplicity rather than once. . Worth 1 point.
Says what the number counts and why nothing smaller is available, rather than reporting a bare figure. . Worth 1 point.
Part B 4 points
Turns each pair into its quadratic and raises the repeated pair's quadratic to the power the multiplicity demands, instead of writing that factor once. . Worth 3 points.
Presents a monic polynomial of the degree claimed, with every coefficient rational. . Worth 1 point.
Part C 5 points
Reaches a degree and accounts for how it stands to part A's by saying what each hypothesis was forcing, rather than reporting two numbers side by side with no account of the pair. . Worth 3 points. needs an explanation, not just an answer
Backs the degree it reports with a specific polynomial that satisfies every stated condition, the multiplicity included. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
A polynomial with rational coefficients has as a root and as a root of multiplicity . Give the least possible degree and the monic polynomial of that degree.
The answer
Least degree , with .
Rational coefficients bring both pairings into play. The surd theorem forces the partner , and the conjugate root theorem forces with the same multiplicity that has. Counting forced roots with multiplicity, , so the degree is at least .
The surd pair has sum and product , while the conjugate pair has sum and product :
The conjugate pair is needed twice over, so its quadratic is squared:
That is monic, has rational coefficients, and has degree , so the bound is achieved and is the least possible degree.
-
-
4. What the pairing forces on the count . Reasoning, 12 points. Question 4 of 5.
Nonreal roots of a real polynomial can never be counted one at a time, and that single arithmetic fact hardens into structure. It fixes the shape of the factorization over the real numbers, and at an odd degree it forces something into existence that no formula ever promised. The Fundamental Theorem of Algebra supplies the roots to be counted; the pairing supplies the parity.
- Part A.
Let have real coefficients and degree , and suppose its only real root is , a simple root. Describe the factorization of over the real numbers as far as the information allows: how many linear factors, how many quadratic ones, and what must be true of each quadratic. Say also how many of 's roots are nonreal, counted with multiplicity.
Explain what it means Words, not just symbols. Say what the number is telling you about the situation. 3 points
- Part B.
Prove that every polynomial with real coefficients whose degree is odd has at least one real root. Argue from the count of the roots and the pairing, not from a picture of the curve.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 5 points
- Part C.
Two edits to the hypothesis of part B. First, replace "real coefficients" with "rational coefficients". Second, drop the condition on the coefficients altogether. Rule on each edited statement, and support each ruling with an argument or with a specific polynomial.
Justify your claim State the claim, then give the reason it has to be true. 4 points
Hints
One at a time, each one a step further than the last. Take only as many as you need.
-
Hint 1 of 4
Every root is real or nonreal, and only one of those two piles is forced to have an even size. Split the degree into the two piles before anything else.
-
Hint 2 of 4 · Part A
Each conjugate pair multiplies into one quadratic with real coefficients, and that quadratic cannot be broken up further without producing a real root the question says is not there.
-
Hint 3 of 4 · Part B
Write the degree as the number of real linear factors plus twice the number of quadratic ones, and then look only at whether each side is odd or even.
-
Hint 4 of 4 · Part C
One of the two edits shrinks the collection of polynomials the statement talks about and the other enlarges it. Only one of those directions can possibly create a counterexample.
That is every hint for this question.
Answer and solution
Check your answer first. If it is wrong, go back to your paper: the worked solution will still be here.
The answer
Part A
with the leading coefficient and each a monic real quadratic of negative discriminant: one linear factor, three quadratic ones, and nonreal roots counted with multiplicity.
Part B
At least one real root, always. With real linear factors and paired quadratics, , so has the same parity as ; an odd makes odd, and an odd count is never .
Part C
The rational version holds and needs no new proof: every rational number is real, so such a polynomial is already covered by part B. With no condition on the coefficients it fails, as shows: degree , roots , and , not one of them real.
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
Sort the roots into two piles and let the degree pay for each. The Fundamental Theorem of Algebra says has exactly roots counted with multiplicity, and every one of them is real or nonreal.
The real pile is settled by the hypothesis. The only real root is and it is simple, so it contributes the single linear factor , and the real pile consumes of the .
The nonreal pile is where the pairing works. Each nonreal root brings with it, and the two multiply into a quadratic with real coefficients:
So the nonreal roots arrive packaged as real quadratics, each consuming of the degree. Writing for how many such quadratics there are,
The factorization therefore has the shape
with the leading coefficient: one linear factor and three quadratic ones. Each is monic, since the display above builds it as a product of two monic linear factors, which is what leaves as the leading coefficient of the whole product. Each must also have a negative discriminant, and that is forced rather than assumed. A real quadratic whose discriminant is zero or more splits into real linear factors, which would give real linear factors beyond the single one it is allowed, whether they repeat or introduce a new real root. The hypothesis leaves room for neither.
The count of nonreal roots follows immediately: three quadratics with two roots each gives nonreal roots out of the . That number is even, as the pairing demands, and the one root left over is the real one.
Part B
Let have real coefficients and odd degree . Everything turns on showing that the nonreal roots can only be counted in twos.
Suppose is a nonreal root, so with . Two facts about matter. First, is a root as well, by the conjugate root theorem, which applies because the coefficients are real. Second, : conjugation fixes a number exactly when that number is real, and is not. So a nonreal root never partners itself, and the nonreal roots fall into genuine two-element pairs.
The multiplicities match too, so the pairing survives being counted with multiplicity. Each pair contributes the real quadratic , and every appearance of that quadratic in the factorization supplies one copy of and one copy of . Writing for the number of such quadratic factors and for the number of real linear factors, the Fundamental Theorem of Algebra accounts for the entire degree:
Now read the parity rather than the size. The term is even whatever is, so
has the same parity as . Since is odd, is odd. Now is a count, so it is a whole number that is at least , and an odd whole number is never :
So at least one factor with real appears in the factorization, and that is a real root of . Nothing about the size of was used beyond its parity, so the argument holds at degree , at degree , and everywhere odd in between.
Part C
Edit one, rational coefficients. The statement still holds, and it needs no new proof at all. Every rational number is a real number, so a polynomial with rational coefficients is in particular a polynomial with real coefficients, and part B already speaks about it. Narrowing a hypothesis can never break a theorem: it only makes the theorem address fewer polynomials, and every one of those was already being addressed. The conclusion does not get stronger either. It still promises a real root and nothing more.
Edit two, no condition on the coefficients. Now the statement fails, and one polynomial is enough to say so. Take
Its degree is , which is odd. Its roots are from the first factor, and from the two numbers and . Not one of the three is real, so the conclusion of part B is false for , and the coefficients and are exactly what allow it to be false.
It is worth seeing where the proof of part B stopped working, since a counterexample is far more useful when you can point at the line it breaks. The nonreal roots of are , and , and they do not pair off: has no beside it, because the conjugate root theorem never applied. Once the pairing is gone, the count of nonreal roots is free to be odd, and here it is odd: there are three of them. The parity argument had nothing left to stand on.
In one line
Since , the factorization is with three real quadratic factors, each of negative discriminant because any further real linear factor is forbidden, and of the roots are nonreal. At odd degree makes odd, so and a real root always exists. Replacing real by rational leaves that true, since every rational number is real; dropping the condition entirely makes it false, as has odd degree and the three nonreal roots , , .
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
Splits the degree into the real linear part and the paired quadratic part, and gets a count for each of them from the degree. . Worth 2 points.
States the condition each quadratic factor has to satisfy and ties that condition to the absence of any further real root, rather than asserting it. . Worth 1 point.
Part B 5 points
Argues from a parity rather than from an example or a sketch: derives that the count of nonreal roots is even, then reads the remainder off the degree. . Worth 3 points. needs an explanation, not just an answer
Says why a nonreal root cannot be its own partner, which is what makes the pairing a genuine pairing rather than a relabelling. . Worth 2 points.
Part C 4 points
Handles the two edits separately, giving each its own ruling and its own support, rather than issuing a single verdict on the pair. . Worth 2 points. needs an explanation, not just an answer
Supports whichever ruling needs a witness with a specific polynomial, and checks both its degree and each of its roots against the statement. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
A polynomial with real coefficients has degree , and its only real root is , with multiplicity . How many nonreal roots does it have counted with multiplicity, and how many quadratic factors does its factorization over the reals carry?
The answer
nonreal roots, forming one conjugate pair, and exactly one quadratic factor.
The Fundamental Theorem of Algebra gives roots counted with multiplicity. The real ones account for of them, since is the only real root and it is triple.
So roots are nonreal, and they can only be a single conjugate pair, which is consistent with the requirement that the count of nonreal roots be even. Each conjugate pair contributes one real quadratic factor of negative discriminant, so
carries exactly one quadratic factor, and accounts for the whole degree.
-
-
5. Reading it backwards . Reasoning, 13 points. Question 5 of 5.
The conjugate root theorem runs in one direction only, and the traffic coming the other way deserves to be inspected rather than waved through. The converse would read: if the nonreal roots of come in conjugate pairs, then the coefficients of are real. This question puts that sentence to the test and then asks how much of it can be salvaged, and what survives depends on something the sentence never mentioned.
- Part A.
Construct a polynomial of degree whose nonreal roots are a conjugate pair, each occurring once, and whose coefficients are not all real. Show that your polynomial has the roots you claim for it.
Construct a counterexample Give one specific case, and show it breaks the claim. 3 points
- Part B.
Let . Its nonreal roots are and , which are conjugates of one another. Decide whether is a nonzero constant times a polynomial with real coefficients, and support the decision.
Justify your claim State the claim, then give the reason it has to be true. 4 points
- Part C.
Now prove the statement that does survive. Let be a nonzero polynomial in which every nonreal root has its conjugate as a root with the same multiplicity. Prove that is a nonzero constant times a polynomial with real coefficients, and point to the step at which the equal multiplicities are spent.
Complete the derivation Each line should follow from the one above it. Say what lets you take each step. 6 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
Multiplying a polynomial by a nonzero constant changes every coefficient and moves no root at all, which makes it the first thing to try against any claim that a root list controls the coefficients.
-
Hint 2 of 3 · Part B
A root list is more than a set of numbers: each entry arrives with a count. Ask what a real polynomial's factorization would have forced those two counts to be.
-
Hint 3 of 3 · Part C
The Fundamental Theorem of Algebra hands the polynomial to you as a product of linear factors. Multiply each matched couple of them together before looking at what has to remain outside the product.
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
, whose roots are , and , and not one of whose four coefficients is real.
- , or any nonreal constant times any real cubic with one real root and one conjugate pair, since a constant multiple moves no root
- , the same real cubic scaled by a different nonreal constant
Part B
It is not. In the root occurs twice while occurs once, a real polynomial gives a conjugate pair equal multiplicities, and dividing by a nonzero constant changes no multiplicity.
Part C
Grouping the complete factorization pairs each nonreal factor with its conjugate into a real quadratic and leaves each real root a real linear factor, so with real and the leading coefficient. The equal multiplicities are what leave no unpaired factor behind.
Not what you got? Look for the slip on your own paper before you open the solution. Finding it yourself is worth more than reading it.
Worked solution
Part A
The converse asks a root list to control the coefficients, and the quickest way to break a claim of that shape is a nonzero constant multiple: multiplying by a nonzero constant changes every coefficient while leaving every root where it was, since happens precisely when .
Start from a real cubic whose nonreal roots already pair and whose roots are easy to read:
Its roots are from the first factor and, from , the pair and . Now scale it by the nonreal constant :
The roots have not moved, so has degree , the real root , and the conjugate pair and , each occurring once. Check one of them straight from the factored form:
And read the coefficients: , , and . Not one of them is real, so satisfies the converse's hypothesis and fails its conclusion as completely as a polynomial can. The converse is false.
The choice of was not special. Any nonreal constant would have done, and so would any real cubic with one real root and one conjugate pair.
Part B
Read the root list with its multiplicities, which is exactly what the factored form is telling you: occurs once, occurs twice, and the degree is in total.
Suppose, for contradiction, that for some nonzero constant and some polynomial with real coefficients. Dividing by changes neither where a polynomial vanishes nor how many times a linear factor divides it, so has precisely the same roots as with precisely the same multiplicities: once and twice.
But a polynomial with real coefficients cannot list a conjugate pair unevenly. Its nonreal roots all come from real quadratic factors , and every appearance of such a factor supplies one copy of and one copy of , so the two finish with the same multiplicity:
Here those multiplicities would have to be and . No such exists, so is not a nonzero constant times a polynomial with real coefficients.
Notice how narrowly this misses. The two nonreal roots of genuinely are conjugates of each other, so the root list passes any inspection that reads only the values. What it fails is the count, and the count is not a technicality: it is the difference between a matched pair and an unmatched leftover.
Part C
Let be nonzero, of degree , with leading coefficient . If then is the constant , which is times the real polynomial , so assume .
The Fundamental Theorem of Algebra, applied repeatedly, factors completely over the complex numbers:
Here is the complete root list, each root written as often as its multiplicity. Now sort those factors into two heaps.
A factor with real is already a polynomial with real coefficients, so it can be set aside exactly as it stands.
A factor with nonreal is where the hypothesis is spent. It says appears in the list with the same multiplicity as , so the copies of and the copies of can be matched one to one, with none of either left over. Multiply each matched couple together:
Both of those coefficients are real, because and are the two quantities a conjugate pair makes real.
Every factor has now been absorbed into a real linear factor or a real quadratic one, and a product of polynomials with real coefficients has real coefficients. Calling that product ,
which is the claim, with monic into the bargain.
The equal multiplicities were spent at exactly one step: the matching. Without them the heap of nonreal factors cannot be exhausted two at a time, and a factor such as is left standing alone, unabsorbed and carrying an that nothing cancels. Part B is that failure in its smallest form.
In one line
The converse is false: has the real root and the conjugate pair , , with no real coefficient anywhere. Nor is a nonzero constant times a real polynomial, because occurs twice where occurs once, while a real polynomial gives a conjugate pair equal multiplicities. What survives is the repaired statement: once the pairing matches multiplicities, grouping the complete factorization into real linear and real quadratic factors gives with real and the leading coefficient.
Another way: Test the constant by dividing coefficients
Expanding gives . If with real, then every coefficient of is times a real number, so the ratio of any two nonzero coefficients of is a ratio of two real numbers, and is therefore real. Here
which is not real, so no such and exist.
When it is worth it When the polynomial is already expanded and the multiplicities are not on display. The multiplicity argument is the one that generalizes to any degree, but this ratio test settles a single expanded example in one line.
Rubric
Mark your own paper against this. Give yourself the points for each element you actually wrote down, not the ones you meant to.
Part A 3 points
Produces a specific polynomial of the stated degree and identifies its roots, saying which of them are nonreal. . Worth 2 points.
Establishes both required features: that the two nonreal roots are conjugates occurring equally often, and that at least one coefficient is not real. . Worth 1 point.
Part B 4 points
Rules on the question by comparing how often each of the two conjugates occurs, not merely which numbers occur. . Worth 3 points. needs an explanation, not just an answer
Says what a nonzero constant factor does and does not change about a root's multiplicity, instead of leaving the constant unexamined. . Worth 1 point.
Part C 6 points
Starts from the complete factorization over the complex numbers and groups it, rather than arguing about the coefficients one at a time or citing the result as known. . Worth 4 points. needs an explanation, not just an answer
Identifies the step the equal-multiplicity assumption pays for, and says what would be left over without it. . Worth 2 points.
Try a similar problem (Optional)
Same idea, different numbers. Work it on paper, then check yourself the same way.
Decide, for each of and , whether it is a nonzero constant times a polynomial with real coefficients.
The answer
is: it is the constant times the real polynomial . is not: its roots and occur with different multiplicities.
Take first. It is already presented as a constant times something else, and that something else is , whose coefficients are all real. The constant is nonzero, so is a nonzero constant times a real polynomial, and its root list agrees: , and , with the conjugate pair occurring once each.
Now . Its roots are with multiplicity and with multiplicity :
Dividing by a nonzero constant changes no multiplicity, so a real polynomial with would have to list a conjugate pair unequally, which a real polynomial cannot do. So is not a constant multiple of a real polynomial, even though both of its nonreal roots are conjugates of each other as values.
-