A Computer Proof of Turan's Inequality
Classical Analysis and ODEs
2007-05-23 v1 Combinatorics
Abstract
We show how Turan's inequality 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 , , effortlessly with the aid of our method.
Keywords
Cite
@article{arxiv.math/0509468,
title = {A Computer Proof of Turan's Inequality},
author = {S. Gerhold and M. Kauers},
journal= {arXiv preprint arXiv:math/0509468},
year = {2007}
}