This note provides asymptotic formulas for approximating the sequence factorial of members of a finite arithmetic progression by using Stirling, Burnside and other more accurate asymptotic formulas for large factorials that have appeared in the literature.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados