The early history of the factorial function
From MaRDI portal
(Redirected from The early history of the factorial function)
The author looks at the early history of the factorial function and analyses the work of De Moivre, Stirling, D. Bernoulli, Euler, Legendre and finally Gauss to this topic. Various formulas and approximations of the factorial function are described in detail.
Recommendations
Cites work
Cited in
(13)- An efficient algorithm for LCS problem between two arbitrary sequences
- Generalized Lucas polynomial sequence approach for fractional differential equations
- Optimal knockout tournaments: definition and computation
- The gamma function via interpolation
- Euler's constant: Euler's work and modern developments
- Gamma and factorial in the Monthly
- Recent advances in asymptotic analysis
- The space complexity of sum labelling
- On Fejér's inequality: generalizations and applications
- A sharp mid-point type inequality
- Certain classes of combinatorial polynomials involving (inverse) binomial coefficients with their applications
- Weibull-like bivariate probability density function and associated estimation algorithms
- Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
This page was built for publication: The early history of the factorial function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205970)