Abstract

g(x) = a0x0 + a1x1 + · · · + an xn , where α0 < α1 < · · · < αn are arbitrary real numbers and an = 0, has no more than n roots. Proof. We proceed by induction on n, noting that for n = 1 the statement is obvious. Assume that for some n the claim is true, but for n + 1, it is not. Hence, for some real numbers α0 < α1 < · · · < αn < αn+1 and an+1 = 0, there is a function g(x) = a0x0 + a1x1 + · · · + an xn + an+1xn+1 , whose number of positive roots is larger than n + 1. These roots are identical with the roots of the new function

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.