A Computer Proof of Turan's Inequality

Details A Computer Proof of Turan's Inequality A Computer Proof of Turan's Inequality

2005-09-21

arxiv.org/abs/math/0509468v1

Mathematics

Classical Analysis and ODEs

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

A Computer Proof of Turan's Inequality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Computer Proof of Turan's Inequality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Computer Proof of Turan's Inequality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486485