Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-05T05:34:45.927Z Has data issue: false hasContentIssue false

Counting zeros of generalised polynomials: Descartes’ rule of signs and Laguerre’s extensions

Published online by Cambridge University Press:  01 August 2016

G. J. O. Jameson*
Affiliation:
Dept of Mathematics and Statistics, Lancaster University, Lancaster LA1 4YF e-mail: [email protected]

Extract

One of the bedrock theorems of mathematics is the statement that a real polynomial of degree n has at most n real zeros. Probably the best-known proof is the algebraic one, by factorisation. But there is also a pleasant analytic proof, by deduction from Rolle’s theorem.

A slightly different question is how many positive zeros a polynomial has. Here the basic result is known as ‘Descartes′ rule of signs’. It says that the number of positive zeros is no more than the number of sign changes in the sequence of coefficients. Descartes included it in his treatise La Géométrie which appeared in 1637. It can be proved by a method based on factorisation, but, again, just as easily by deduction from Rolle’s theorem.

Type
Articles
Copyright
Copyright © The Mathematical Association 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Henrici, P. Applied and Computational Complex Analysis, vol. 1, Wiley, New York (1974).Google Scholar
2. Householder, A. S. The Numerical Treatment of a Single Nonlinear Equation, McGraw Hill, New York (1970).Google Scholar
3. Laguerre, E. N. Sur la théorie des équations numériques, J. Math. Pures et Appl. 9 (1883) (in Oeuvres de Laguerre, vol. 1, Gauthier-Villars et files, Paris (1898), pp. 347).Google Scholar
4. Pólya, G. and Szegö, G. Aufgaben und Lehrsätze aus der Analysis, Band II, Springer Berlin (1925, 1964).Google Scholar