Abstract
We show how Turan's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq0$ 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)\geq0$ ($-1\leq x\leq 1$) effortlessly with the aid of our method},
journal = {Journal of Inequalities in Pure and Applied Mathematics
| Original language | English |
|---|---|
| Pages (from-to) | 1-4 |
| Number of pages | 4 |
| Journal | Journal of Inequalities in Pure and Applied Mathematics |
| Volume | 7 |
| Issue number | 2 |
| Publication status | Published - May 2006 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics