A Computer Proof of Turan's Inequality

Simple item page
dc.creatorGerhold, S.
dc.creatorKauers, M.
dc.date2005-09-21
dc.date.accessioned2026-07-07T06:18:31Z
dc.date.available2026-07-07T06:18:31Z
dc.descriptionWe show how Turan'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 $|x|P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$, $-1\leq x\leq 1$, effortlessly with the aid of our method.
dc.identifierhttps://arxiv.org/abs/math/0509468
dc.identifierhttp://arxiv.org/abs/math/0509468
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94764
dc.subjectClassical Analysis and ODEs
dc.subjectCombinatorics
dc.subject26D07; 33C45; 33F10
dc.titleA Computer Proof of Turan's Inequality
dc.typetext

Files

Collections

arXiv