- Research
- Open access
- Published:
Inequalities and asymptotic formulas for \((1+1/x)^{x+a}\)
Journal of Inequalities and Applications volume 2015, Article number: 114 (2015)
Abstract
(i) Let \(a\neq\frac{1}{2}\) be a given real number. We give a formula for determining the coefficients \(b_{j}\equiv b_{j}(a)\) such that \((1+\frac{1}{x} )^{x+a}\sim\exp (1+\frac{(a-\frac {1}{2})x}{ (x+\sum_{j=0}^{\infty}b_{j}x^{-j} )^{2}} )\), \(x \to\infty\). This solves an open problem of Hu and Mortici. (ii) Hu and Mortici presented the following asymptotic representation: \((1+\frac{1}{x} )^{x+\frac{1}{2}}\sim\exp (1+\frac{\frac {1}{12}x}{ (x+\sum_{j=0}^{\infty}a_{j}x^{-j} )^{3}} )\), \(x\to\infty\); the coefficients \(a_{j}\) can be inductively obtained by equating the following relation: \((\sum_{j=3}^{\infty}(-1)^{j-1}\frac{6(j-2)}{j(j-1)x^{j}} ) (x+\sum_{j=0}^{\infty}\frac{a_{j}}{x^{j}} )^{3}=1\). We here provide a recurrence relation for determining the coefficients \(a_{j}\). The representation using recursive algorithm is better for numerical evaluations. (iii) We present new inequalities and asymptotic formulas for \((1+1/x)^{x+a}\).
1 Introduction
The constant e is the base in the natural logarithm. e can be defined by the limit
With the possible exception of π, e is the most important constant in mathematics since it appears in myriad mathematical contexts involving limits and derivatives. It is noted (see, e.g., [1]; see also [2], pp.26-27) that approximations to e were first discovered in the 1600s. For the various inequalities and approximations of the constants e, the reader may be referred to several recent works (see, e.g., [3–9]).
Batir and Cancan (see [3], Theorem 2.5 and Theorem 2.6) proved that for \(n\in\mathbb{N}:=\{1, 2, \ldots\}\),
and
with the best possible constants
and
Inspired by (1.1) and (1.2), Hu and Mortici (see [6], Theorem 1 and Theorem 2) established the following inequalities:
and
for \(x\geq1\).
Also in [6], the authors proved
(see [6], Theorem 6), and they proposed as an open problem the following approximation formula:
for \(a\in[0, 1]\setminus\{\frac{1}{2}\}\).
For
where \(\theta=0.82462 \ldots\) is the unique zero of \(675a^{3}-1{,}098a^{2}+558a-92\), Hu and Mortici (see [6], Theorems 3 to 5) considered the inequalities for \((1+1/x)^{x+a}\). In fact, the authors obtained the following approximation formula:
In the case \(a = \frac{1}{2}\), Hu and Mortici [6] presented the following asymptotic representation:
Moreover, the authors showed that the coefficients \(a_{j}\) in (1.8) can be inductively obtained by equating the following relation:
The first few coefficients \(a_{j}\) are
We then obtain the following explicit asymptotic expansion:
In this paper, our tasks are as follows:
-
(i)
We consider the above open problem of Hu and Mortici and develop the approximation formula (1.6) to produce a complete asymptotic expansion. More precisely, we give a formula for determining the coefficients \(b_{j}\equiv b_{j}(a)\) such that
$$ \biggl(1+\frac{1}{x} \biggr)^{x+a}\sim\exp \biggl(1+ \frac{(a-\frac {1}{2})x}{ (x+\sum_{j=0}^{\infty}b_{j}x^{-j} )^{2}} \biggr) \quad \biggl(x \to\infty; a\neq\frac{1}{2} \biggr). $$ -
(ii)
We provide a recurrence relation for determining the coefficients \(a_{j}\) in (1.8). The representation using recursive algorithm is better for numerical evaluations.
-
(iii)
We present new inequalities and asymptotic expansions for \((1+1/x)^{x+a}\).
The following lemma is required in the sequel.
Lemma 1.1
(see [10])
Let \(g(x)\) be a function with an asymptotic expansion (\(q_{0}=1\))
Then for all real r we have
where
2 Asymptotic formulas
Theorem 2.1 develops the approximation formula (1.6) to produce a complete asymptotic expansion.
Theorem 2.1
Let \(a\neq\frac{1}{2}\) be a given real number. The following asymptotic expansion holds:
with the coefficients \(b_{j}\equiv b_{j}(a)\) given by
where the \(P_{j}(-\frac{1}{2})\) are given by the recurrence relation
Proof
To determine the coefficients \(b_{j}\) in (2.1), we write (2.1) as
where
Using the Maclaurin expansion of \(\ln(1+t)\) with \(t = x^{-1}\) yields
with
By Lemma 1.1, we have
with the coefficients \(P_{j}(-\frac{1}{2})\) given by
where the \(q_{k}\) are given by (2.5).
Hence, it follows from (2.4) and (2.6) that
we then obtain
where the \(P_{j}(-\frac{1}{2})\) are given in (2.7). The proof of Theorem 2.1 is complete. □
Remark 2.1
Using (2.2) and (2.3), we now show that we easily can determine the \(b_{j}\) in (2.1). The first few coefficients \(b_{j}\equiv b_{j}(a)\) are
In particular, setting \(a=0\) and \(a=1\) in (2.1), respectively, we have the following complete asymptotic expansions:
and
as \(x\to\infty\).
Theorem 2.2 provides a recurrence relation for determining the coefficients \(a_{j}\) in (1.8).
Theorem 2.2
The coefficients \(a_{j}\) in (1.8) are given by
where the \(P_{j}(-\frac{1}{3})\) are given by the recurrence relation
Proof
A similar argument to the proof of Theorem 2.1 will establish the result in Theorem 2.2. To determine the coefficients \(a_{j}\) in (1.8), we write (1.8) as
where
Using the Maclaurin expansion of \(\ln(1+t)\) with \(t = x^{-1}\) yields
with
By Lemma 1.1, we have
with the coefficients \(P_{j}(-\frac{1}{3})\) given by
where the \(p_{k}\) are given by (2.13).
Hence, it follows from (2.12) and (2.14) that
we then obtain
where the \(P_{j}(-\frac{1}{3})\) are given in (2.15). The proof of Theorem 2.2 is complete. □
Remark 2.2
Using (2.10) and (2.11), we now show how easily we can determine the \(a_{j}\) in (1.8). The first few coefficients \(a_{j}\) are
We note that the values of \(a_{j}\) (for \(j=0, 1, 2, 3\)) here are equal to the coefficients of \(1/x^{j}\) (for \(j=0, 1, 2, 3\)) in (1.10), respectively.
Theorems 2.3 and 2.4 present new asymptotic expansions for \((1+1/x)^{x+\alpha}\) (with \(\alpha\neq\frac{1}{2}\)) and \((1+1/x)^{x+1/2}\), respectively. As the proofs of Theorems 2.3 and 2.4 are similar to the proof of Theorem 2.1, we omit them.
Theorem 2.3
Let \(\alpha\neq\frac{1}{2}\) be a given real number. The following asymptotic expansion holds:
with the coefficients \(\beta_{j}\equiv\beta_{j}(\alpha)\) given by
where the \(P_{j}(-1)\) are given by the recurrence relation
Remark 2.3
The first few coefficients \(\beta_{j}\equiv\beta_{j}(\alpha)\) are
In particular, setting \(\alpha=0\) and \(\alpha=1\) in (2.16), respectively, we have the following complete asymptotic expansions:
and
as \(x\to\infty\).
Theorem 2.4
The following asymptotic expansion holds:
with the coefficients \(c_{j}\) given by
where the \(P_{j}\) are given by the recurrence relation
Remark 2.4
Here, from (2.21), we give the following explicit asymptotic expansion:
Here, we show the superiority of our new approximation formulas over Hu and Mortici’s approximation formulas.
It follows from (2.8) and (2.19) that
and
Moreover, we find by the Maple software that, as \(x \rightarrow\infty\),
We now prove that
Elementary calculation shows that
with
Hence, we have \(f_{1}(x)< g_{1}(x)\) for \(x\geq1\).
The second inequality in (2.27) is obtained by considering the function \(F(x)\) defined for \(x\geq1\) by
Differentiation yields
Hence, \(F(x)\) is strictly decreasing for \(x\geq1\), and we have
This means that the second inequality in (2.27) holds for \(x\geq1\).
The double inequality (2.27) shows that (2.26) is better than (2.25).
It follows from (2.9) and (2.20) that
and
Moreover, we find by the Maple software that, as \(x \rightarrow\infty\),
In fact, the following double inequality holds:
As the proofs of the inequalities (2.30) are similar to the proofs of the inequalities (2.27), we omit them. The double inequality (2.30) shows that (2.29) is better than (2.28).
It follows from (1.10) and (2.24) that
and
Moreover, we find by the Maple software that, as \(x \rightarrow\infty\),
In fact, the following double inequality holds:
As the proofs of the inequalities (2.33) are similar to the proofs of the inequalities (2.27), we omit them. The double inequality (2.33) shows that (2.32) is better than (2.31).
3 Inequalities
Equations (2.19), (2.20), and (2.24) motivated us to observe Theorem 3.1.
Theorem 3.1
(i) The following inequality holds:
The first inequality in (3.1) is valid provided \(x\geq1\), while the second inequality in (3.1) holds for \(x>0\).
(ii) The following inequality holds:
The first inequality in (3.2) holds for \(x>0\), while the second inequality in (3.2) is valid provided \(x\geq1\).
(iii) The following inequality holds:
The first inequality in (3.3) holds for \(x>0\), while the second inequality in (3.3) is valid provided \(x\geq1\).
Proof
In order to prove the inequalities (3.1), (3.2) and (3.3), it suffices to show that
and
Differentiation yields
We then obtain
The proof of Theorem 3.1 is complete. □
Remark 3.1
The inequalities (3.1) are sharper than the inequalities (1.3). The inequalities (3.2) are sharper than the inequalities (1.4). The inequalities (3.3) are sharper than the inequalities (1.5).
References
Knox, JA, Brothers, HJ: Novel series-based approximations to e. Coll. Math. J. 30(4), 269-275 (1999)
Maor, E: e: The Story of a Number. Princeton University Press, Princeton (1994)
Batir, N, Cancan, M: Sharp inequalities involving the constant e and the sequence \((1 + 1/n)^{n}\). Int. J. Math. Educ. Sci. Technol. 40(8), 1101-1109 (2009)
Chen, CP, Mortici, C: Sharp form of inequality for the constant e. Carpath. J. Math. 27(2), 185-191 (2011)
Chen, CP, Choi, J: Asymptotic formula for \((1+1/x)^{x}\) based on the partition function. Am. Math. Mon. 121(4), 338-343 (2014)
Hu, Y, Mortici, C: Sharp inequalities related to the constant e. J. Inequal. Appl. 2014, 382 (2014). Available at http://www.journalofinequalitiesandapplications.com/content/pdf/1029-242X-2014-382.pdf
Mortici, C: Refinements of some bounds related to the constant e. Miskolc Math. Notes 12(1), 105-111 (2011)
Mortici, C: A quicker convergence toward the gamma constant with the logarithm term involving the constant e. Carpath. J. Math. 26(1), 86-91 (2010)
Mortici, C: On the sequence related to the irrationality of e. J. Inequal. Spec. Funct. 3(2), 22-25 (2012)
Chen, CP, Elezović, N, Vukšić, L: Asymptotic formulae associated with the Wallis power function and digamma function. J. Class. Anal. 2(2), 151-166 (2013)
Acknowledgements
The authors thank the referees for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
The authors have made equal contributions to each part of this paper. All authors have read and approved the final manuscript.
Rights and permissions
Open Access This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.
About this article
Cite this article
Lin, L., Liu, SW. & Chen, CP. Inequalities and asymptotic formulas for \((1+1/x)^{x+a}\) . J Inequal Appl 2015, 114 (2015). https://doi.org/10.1186/s13660-015-0629-0
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-015-0629-0