- Open Access
New upper bounds of n!
© Mahmoud et al; licensee Springer. 2012
Received: 15 October 2011
Accepted: 13 February 2012
Published: 13 February 2012
In this article, we deduce a new family of upper bounds of n! of the form
We also proved that the approximation formula for big factorials has a speed of convergence equal to n-2m- 3for m = 1,2,3,..., which give us a superiority over other known formulas by a suitable choice of m.
Mathematics Subject Classification (2000): 41A60; 41A25; 57Q55; 33B15; 26D07.
We can't take infinite sum of the series (3) because the series diverges. Also, Impens  deduce Artin result with different proof and show that the Bernoulli numbers in this series cannot be improved by any method whatsoever.
The organization of this article is as follows. In Section 2, we deduce a general double inequality of n!, which already obtained in  with different proof. Section 3 is devoted to getting a new family of upper bounds of n! different from the partial sums of the Stirling's series. In Section 4, we measure the speed of convergence of our approximation formula for big factorials. Also, we offer some numerical computations to prove the superiority of our formula over other known formulas.
2 A double inequality of n!
Now we obtain the following result
A q-analog of the inequality (20) was introduced in .
3 A new family of upper bounds of n!
In the following Lemma, we will see that the upper bound will improved with increasing the value of m.
The following Lemma show that is an improvement of the upper bound .
4 The speed of convergence of the approximation formula for big factorials
In what follows, we need the following result, which represents a powerful tool to measure the rate of convergence.
This Lemma was first used by Mortici for constructing asymptotic expansions, or to accelerate some convergences [15–21]. By using Lemma (4.1), clearly the sequence (w n )n≥1converges more quickly when the value of k satisfying (29) is larger.
The following table shows numerically that our new formula has a superiority over the the Mortici's formula μ n .
|n! -μ n |
|n! - λn,1|
1.1 × 1015
2.8 × 1014
6.8 × 1052
1.7 × 1052
6.5 × 10144
1.4 × 10144
This project was founded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant No. 448/130/1431. The authors, therefore, acknowledge with thanks DSR support for Scientific Research.
- De Moivre A: Miscellanea Analytica de Seriebus et Quadraturis. London; 1730.Google Scholar
- Stirling J: Methodus Differentialis. London; 1730.Google Scholar
- Hummel PM: A note on Stirling's formoula. Am Math Monthly 1940, 42(2):97–99.MathSciNetView ArticleGoogle Scholar
- Cesàro E: Elements Lehrbuch der algebraischen analysis und der In-finitesimalrechnung. Leipzig, Teubner; 1922.Google Scholar
- Uspensky JV: Introduction to Mathematical Probability. McGraw Hill, New York; 1937.Google Scholar
- Robbins H: A remark on Stirling's formula. Am Math Monthly 1955, 62: 26–29. 10.2307/2308012View ArticleGoogle Scholar
- Nanjundiah TS: Note on Stirling's formula. Am Math Monthly 1965, 66: 701–703.MathSciNetView ArticleGoogle Scholar
- Maria AJ: A remark on Striling's formula. Am Math Monthly 1965, 72: 1096–1098. 10.2307/2315957MathSciNetView ArticleGoogle Scholar
- Beesack PR: Improvement of Stirling's formula by elementary methods. Univ. Beograd, Publ. Elektrotenhn. Fak Ser Mat Fiz 1969, 17–21. No. 274–301Google Scholar
- Michel R: On Stirling's formula. Am. Math. Monthly. 2002, 109(4):388–390.Google Scholar
- Artin E: The Gamma Function (translated by M Butler). Holt, Rinehart and Winston. New York; 1964.Google Scholar
- Impens C: Stirling's series made easy. Am Math Monthly 2003, 110(8):730–735. 10.2307/3647856MathSciNetView ArticleGoogle Scholar
- Mansour M, Obaid MA: Bounds of q -factorial [ n ] q ! Ars Combinatoria CII 2011, 313–319.Google Scholar
- Andrews GE, Askey R, Roy R: Special Functions. Cambridge University Press, Cambridge; 1999.View ArticleGoogle Scholar
- Mortici C: An ultimate extremely accurate formula for approximation of the factorial function. Archiv der Mathematik (Basel) 2009, 93(1):37–45. 10.1007/s00013-009-0008-5MathSciNetView ArticleGoogle Scholar
- Mortici C: Product approximations via asymptotic integration. Am Math Monthly 2010, 117: 434–441. 10.4169/000298910X485950MathSciNetView ArticleGoogle Scholar
- Mortici C: New approximations of the gamma function in terms of the digamma function. Appl Math Lett 2010, 23: 97–100. 10.1016/j.aml.2009.08.012MathSciNetView ArticleGoogle Scholar
- Mortici C: New improvements of the Stirling formula. Appl Math Comput 2010, 217(2):699–704. 10.1016/j.amc.2010.06.007MathSciNetView ArticleGoogle Scholar
- Mortici C: Best estimates of the generalized Stirling formula. Appl Math Comput 2010, 215(11):4044–4048. 10.1016/j.amc.2009.12.013MathSciNetView ArticleGoogle Scholar
- Mortici C: A class of integral approximations for the factorial function. Comput Math Appl 2010, 59(6):2053–2058. 10.1016/j.camwa.2009.12.010MathSciNetView ArticleGoogle Scholar
- Mortici C: Ramanujan formula for the generalized Stirling approximation. Appl Math Comput 2010, 217(6):2579–2585. 10.1016/j.amc.2010.07.070MathSciNetView ArticleGoogle Scholar
- Mortici C: A new Stirling series as continued fraction. Numer Algorithm 2011, 56(1):17–26. 10.1007/s11075-010-9370-4MathSciNetView ArticleGoogle Scholar
- Burnside W: A rapidly convergent series for Log N! Messenger Math 1917, 46: 157–159.Google Scholar
- Batir N: Sharp inequalities for factorial n . Proyecciones 2008, 27(1):97–102.MathSciNetView ArticleGoogle Scholar
- Gosper RW: Decision procedure for indefinite hypergeometric summation. Proc Natl Acad Sci USA 1978, 75: 40–42. 10.1073/pnas.75.1.40MathSciNetView ArticleGoogle Scholar
- Ramanujan S: The Lost Notebook and Other Unpublished Papers (Introduced by Andrews, GE). Narosa Publishing House, New Delhi; 1988.Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.