An algorithm for calculating terms of the Stirling’s formula remainder
摘要
In this note, we deal with Stirling’s approximation to N!. We employ elementary mathematical techniques to provide an algorithm to calculate many terms of Stirling’s formula remainder. Our algorithm, based on a recursive scheme using polynomials, is an alternative to some methodologies already proposed in the literature.