An improved computational algorithm for finding the factorial

DOI10.1134/S0001434608050246MaRDI QIDQ2518042zbMATH OpenOpenAlexFDO

Authors A. V. Ladikov

Publication date 12 January 2009

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434608050246

zbMATH Keywords

algorithm complexitycomputational algorithmfactorial

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• On the complexity of calculating factorials
• Asymptotically Fast Factorization of Integers
• Factoring: algorithms, computations, and computers
• scientific article; zbMATH DE number 4179778
• A note on Stirling's expansion for factorial n

Cited in

(4)

• Partial correctness of a factorial algorithm
• Constant that improve (double) factorial
• On the complexity of calculating factorials
• Computation of quantum factorials and their inverses

This page was built for publication: An improved computational algorithm for finding the factorial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2518042)