JIPAM logo: Home Link
 
Home Editors Submissions Reviews Volumes RGMIA About Us
 

   
  Volume 7, Issue 2, Article 42
 
A Computer Proof of Turán's Inequality

    Authors: Stefan Gerhold, Manuel Kauers,  
    Keywords: Turán's inequality, Cylindrical Algebraic Decomposition.  
    Date Received: 20/09/05  
    Date Accepted: 10/03/06  
    Subject Codes:

26D07, 33C45, 33F10.

 
    Editors: Doru Stefanescu,  
 
    Abstract:

We show how Turán's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)geq 0$ for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities. For instance, we have found the stronger inequality $ vert xvert P_n(x)^2-P_{n-1}(x)P_{n+1}(x)geq 0$, $-1leq xleq 1$, effortlessly with the aid of our method.

         
       
  Download Screen PDF
  Download Print PDF
  Send this article to a friend
  Print this page
 

      search [advanced search] copyright 2003 terms and conditions login