Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Exponential factorial

From Wikipedia, the free encyclopedia
Recursive mathematical formula

Theexponential factorial is a positiveintegernraised to the power ofn − 1, which in turn is raised to the power ofn − 2, and so on in a right-grouping manner. That is,

n(n1)(n2){\displaystyle n^{(n-1)^{(n-2)\cdots }}}

The exponential factorial can also be defined with therecurrence relation

a1=1,an=nan1{\displaystyle a_{1}=1,\quad a_{n}=n^{a_{n-1}}}

The first few exponential factorials are1,2,9,262144, ... (OEISA049384 orOEISA132859). For example, 262144 is an exponential factorial since

262144=4321{\displaystyle 262144=4^{3^{2^{1}}}}

Using the recurrence relation, the first exponential factorials are:

1
21 = 2
32 = 9
49 = 262144
5262144 = 6206069878...8212890625 (183231 digits)

The exponential factorials grow much more quickly than regularfactorials or evenhyperfactorials, in fact exhibiting tetrational growth. The number of digits in the exponential factorial of 6 is approximately 5 × 10183 230.

The sum of thereciprocals of the exponential factorials from 1 onwards is the followingtranscendental number:

11+121+1321+14321+154321+1654321+=1.611114925808376736111111111111111111111111183212272243682859{\displaystyle {\frac {1}{1}}+{\frac {1}{2^{1}}}+{\frac {1}{3^{2^{1}}}}+{\frac {1}{4^{3^{2^{1}}}}}+{\frac {1}{5^{4^{3^{2^{1}}}}}}+{\frac {1}{6^{5^{4^{3^{2^{1}}}}}}}+\ldots =1.611114925808376736\underbrace {111111111111\ldots 111111111111} _{183212}272243682859\ldots }

This sum is transcendental because it is aLiouville number.

Liketetration, there is currently no accepted method of extension of the exponential factorial function toreal andcomplex values of its argument, unlike thefactorial function, for which such an extension is provided by thegamma function. But it is possible to expand it if it is defined in a strip width of 1.

Similarly, there is disagreement about the appropriate value at 0; any value would be consistent with the recursive definition. A smooth extension to the reals would satisfyf(0)=f(1){\displaystyle f(0)=f'(1)}, which suggests a value strictly between 0 and 1.

Related functions, notation and conventions

[edit]

References

[edit]


Stub icon

Thisnumber theory-related article is astub. You can help Wikipedia byexpanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Exponential_factorial&oldid=1282028267"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp