Abstract
In olden times, when algebraic theorems were scanty, the following statement received the title of the Fundamental Theorem of Algebra: “A given polynomial of degree n with complex coefficients has exactly n roots (multiplicities counted).” The first to formulate this statement was Alber de Girard in 1629, but he did not even try to prove it. The first to realize the necessity of proving the Fundamental Theorem of Algebra was d’Alembert. His proof (1746) was not, however, considered convincing. Euler (1749), Faunsenet (1759) and Lagrange (1771) offered their proofs but these proofs were not without blemishes, either. The first to give a satisfactory proof of the Fundamental Theorem of Algebra was Gauss. He gave three different versions of the proof (1799, 1815 and 1816) and in 1845 he additionally published a refined version of his first proof. For a review of the different proofs of the Fundamental Theorem of Algebra, see [Ti]. We confine ourselves to one proof. This proof is based on the following Rouché’s theorem, which is of interest by itself.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Prasolov, V.V. (2004). Roots of Polynomials. In: Polynomials. Algorithms and Computation in Mathematics, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03980-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-03980-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03979-9
Online ISBN: 978-3-642-03980-5
eBook Packages: Springer Book Archive