Roots of a nth degree polynomial

[ajayguhan]

why does a nth degree polynomial has atleast one root and a maximum of n root...?

In my book it's given, it's the fundamental theorem of algebra.


Is there a proof...?





Thank's for help. (In advance)

 

[Number Nine]

Roots over what? A polynomial with real coefficients does not necessarily have any real roots, though it does have n roots over the complex numbers. The wikipedia article on "The fundamental theorem of algebra" contains several proofs.

 

[ajayguhan]

It's not specified, i guess it over real number. I saw wikipedia but the proof are difficult .

 

[SteamKing]

Sadly, many proofs are difficult. Some are even book length.

 

[HallsofIvy]

The "fundamental theorem of algebra" is normally stated as "every polynomial equation has at least one root in the complex numbers." Since a root, a, implies "z- a" is a factor, we can reduce to another equation of degree n-1, which has a root, then to a polynomial of degree n-2, which has a root, etc. until we are reduce to a linear polynomial. What we might call "the extended fundamental of algebra" says that any n^the degree polynomial has n roots where we are counting "multiple roots". That is, z^3- 3z^2+ 3z- 1= 0, (z- 1)^3= 0 has three roots, all of them equal to "1".

Yes, there are a number of proofs. Two distinctly different proofs, one using very basic properties of algebra and fairly lengthy, the other much more sophisticated and shorter.

The simpler, but longer, proof can be found on Wikipedia:
http://en.wikipedia.org/wiki/Fundamental_theorem_of_algebra
which I found by googling "fundamental theorem of algebra".

 

[pwsnafu]

The "fundamental theorem of algebra" is normally stated as "every polynomial equation has at least one root in the complex numbers."

Unless your coefficients are [strike]p-adics[/strike]

Edit: Well technically $C_p$ is isomorphic to $\mathbb{C}$ but only through AoC.