Abstract
We give new lower bound and upper bound for Papenfuss-Bach inequality and improve Ruehr-Shafer inequality by providing a new lower bound.
1. Introduction
Papenfuss [1] proposes an open problem described as follows.
Theorem 1.1. Let . Then
Bach [2] prove Theorem 1.1 and obtain a further result.
Theorem 1.2. Let . Then
Ge gives a lower bound of the above inequality in [3] as follows.
Theorem 1.3. Let . Then Furthermore, 64 and are the best constants in (1.3).
Besides, Bach [2] obtain the improvement of the Papenfuss-Bach inequality as another one.
Theorem 1.4. Let . Then
In this note, we firstly obtain better bounds for Papenfuss-Bach inequality as in the following statement.
Theorem 1.5. Let . Then
And then we give the refinement of the Ruehr-Shafer inequality as follows.
Theorem 1.6. Let . Then
Remark 1.7. Since , we know that the upper bound in the inequality (1.5) is better than the one in (1.3). At the same time, we find that the lower estimate in (1.5) is larger than the one in (1.3) on the interval meanwhile the lower estimate in (1.3) is larger than the one in (1.5) on .
2. Lemmas
Lemma 2.1 (see [4–7]). Let be the even-indexed Bernoulli numbers. Then
Lemma 2.2 (see [7–9]). Let . Then
Lemma 2.3. Let and . Then
Proof. By using Lemma 2.2, we have We calculate The proof of Lemma 2.3 is completed.
Lemma 2.4. Let . Then
3. The Proof of Theorem 1.5
The proof of Theorem 1.5 is completed when proving the truth of the following double inequality:
We firstly process the left-hand side of the above inequality. We compute that where for and .
We calculate and . For , by using Lemma 2.1, we can estimate as follows:
Since, for , we have so for and . Combining with the results of and , we finish the proof of the left-hand side of inequality (3.1).
Now, Let’s discuss the right-hand side of inequality (3.1) by taking the same method. We compute that where and, for We can reckon that, for
As we can see, holds for , so we conclude that for and . Observing the value of and , we complete the proof of the right-hand side of inequality (3.1).
4. The Proof of Theorem 1.6
Now we prove the left-hand side of the inequality in Theorem 1.6, which is equivalent to By using the power series expansions of and , we can rewrite the above inequality as follows:
Now we simplify the left expression and prove that it is positive: where for . Particularly, ,, and . We also use Lemma 2.1 in order to give the lower bound of for :
We denote that where
Let , and We compute that So is increasing on . Since and , we have that is decreasing firstly and then increasing. Let be only one point of minimum of the function . Then and ; this implies that , so and for .
Combining with for , we have proved Theorem 1.6.
5. Open Problem
In the last section we pose a problem as follows: Let . Then hold, where and are the best constants in (5.1).