Need help with Proof and conjugate roots theorem

AI Thread Summary
The discussion centers on proving the existence of conjugate roots in polynomials with real coefficients, specifically that if a polynomial f(x) has a root of the form (A+Bi), then it must also have a root of the form (A-iB). Participants reference the conjugate roots theorem and the Remainder Theorem, questioning the relevance of the latter in this context. One contributor suggests a direct proof approach, indicating that if (A+Bi) divides the polynomial, then (A-iB) must also divide it due to the absence of complex coefficients. Clarifications are sought regarding the meaning of "mod (A+Bi)" and the nature of the roots. The conversation emphasizes the logical connections between polynomial division and the properties of complex roots.
type_speed
Messages
2
Reaction score
0
Need Assistance w/ existence of conjugate roots in polynomial

Prove:
given that f(x) = Anx^n + An-1X^n-1+ ...A1X + A0 , and An does not = 0
=> if f(x) has a root of the form (A+Bi), then it must have a root of the form (A-iB). (complex roots)

So far I've come up with the conjugate roots theorem to help me where it states that if a function f(x) is given with real coefficients then the conjugate must exist also. My professor suggested I try the Remainder Theorem??
 
Last edited:
Physics news on Phys.org
What exactly are you stuck on? By inspection you know that if (A+Bi) divides your polynomial then (A-Bi) must also divide your polynomial because your polynomial does not have any complex coefficients. So, I'd recommend doing either a direct or indirect proof - though it seems as if a direct proof will be an easier way to go. Assume that (A+Bi) divides your polynomial. It follows then that:

A_{n}x^n + A_{n-1}x^{n-1} + ... + A_{1}x + A_{0} = 0 (mod (A+Bi))

The rest should fall out from there...
 
Last edited:
Appreciate the fast reply, Well first I'm stuck on why my professor told me to use the Remainder Theorem where if a polynomial f(x) is divided by x-c then f(x) is the remainder. Second, I'm not quite sure I can prove that the conjugate exists with only the given statement of the polynomial function not having any complex coefficients. Third, I doubt that our professor would assign such a easy problem for homework. (He only assigned one problem)

What does (mod(A+Bi)) mean?

I am assuming that the roots are (x-(A+Bi))= 0 and (x+(A-Bi))= 0? Right?

Tell me what you think. Regards, Chris
 
Mod is just a fancy way of saying remainder really. Example 4 mod 2 = 0.
 
Let's look at a simple polynomial as an example.

Say 0 = x^2 + 2x -3
Your solution would be (x+3)(x-1) = 0.
So your roots are x= -3, and x = 1.

That means something * (x+3) gives you x^2 + 2x -3.
And something * (x-1) gives you x^2 + 2x -3.

In this case we know what the something is, as we put in all the numbers.
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top