Exponential vs. Factorial

DOI10.2307/27642031MaRDI QIDQ5452345zbMATH OpenOpenAlexFDO

Authors Daniel J. Velleman

Publication date 26 March 2008

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/27642031

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Factorials, binomial coefficients, combinatorial functions (05A10) Asymptotic results on arithmetic functions (11N37) Rate of growth of arithmetic functions (11N56) Connections of number theory and logic (11U99)

Recommendations

• Analytic combinatorics for a certain well-ordered class of iterated exponential terms
• scientific article; zbMATH DE number 4051925
• scientific article; zbMATH DE number 24563
• An elementary proof of the convergence of iterated exponentials
• On the rate of convergence of iterated exponentials

Cited in

(3)

• How to compare power towers?
• Analytic combinatorics for a certain well-ordered class of iterated exponential terms
• Exponential versus factorial revisited

This page was built for publication: Exponential vs. Factorial

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