93
Views
2
CrossRef citations to date
0
Altmetric
Classroom Notes

Asymptotic formulas for sequence factorial of arithmetic progression

Pages 947-952 | Received 09 Oct 2013, Published online: 07 Mar 2014
 

Abstract

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.

Acknowledgements

The author wishes to thank the referees for the helpful comments.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 372.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.