Pentation
 | This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (January 2023) (Learn how and when to remove this template message) |
In mathematics, pentation (or hyper-5) is the next hyperoperation (infinite sequence of arithmetic operations) after tetration and before hexation. It is defined as iterated (repeated) tetration (assuming right-associativity), just as tetration is iterated right-associative exponentiation.[1] It is a binary operation defined with two numbers a and b, where a is tetrated to itself b − 1 times. (The number in the brackets, [], represents the type of hyperoperation.) For instance, using hyperoperation notation for pentation and tetration, [math]\displaystyle{ 2[5]3 }[/math] means tetrating 2 to itself 2 times, or [math]\displaystyle{ 2[4](2[4]2) }[/math]. This can then be reduced to [math]\displaystyle{ 2[4](2^2)=2[4]4=2^{2^{2^2}}=2^{2^4}=2^{16}=65,536. }[/math]
Etymology
The word "pentation" was coined by Reuben Goodstein in 1947 from the roots penta- (five) and iteration. It is part of his general naming scheme for hyperoperations.[2]
Notation
There is little consensus on the notation for pentation; as such, there are many different ways to write the operation. However, some are more used than others, and some have clear advantages or disadvantages compared to others.
- Pentation can be written as a hyperoperation as [math]\displaystyle{ a[5]b }[/math]. In this format, [math]\displaystyle{ a[3]b }[/math] may be interpreted as the result of repeatedly applying the function [math]\displaystyle{ x\mapsto a[2]x }[/math], for [math]\displaystyle{ b }[/math] repetitions, starting from the number 1. Analogously, [math]\displaystyle{ a[4]b }[/math], tetration, represents the value obtained by repeatedly applying the function [math]\displaystyle{ x\mapsto a[3]x }[/math], for [math]\displaystyle{ b }[/math] repetitions, starting from the number 1, and the pentation [math]\displaystyle{ a[5]b }[/math] represents the value obtained by repeatedly applying the function [math]\displaystyle{ x\mapsto a[4]x }[/math], for [math]\displaystyle{ b }[/math] repetitions, starting from the number 1.[3][4] This will be the notation used in the rest of the article.
- In Knuth's up-arrow notation, [math]\displaystyle{ a[5]b }[/math] is represented as [math]\displaystyle{ a \uparrow \uparrow \uparrow b }[/math] or [math]\displaystyle{ a \uparrow^{3}b }[/math]. In this notation, [math]\displaystyle{ a\uparrow b }[/math] represents the exponentiation function [math]\displaystyle{ a^b }[/math] and [math]\displaystyle{ a\uparrow \uparrow b }[/math] represents tetration. The operation can be easily adapted for hexation by adding another arrow.
- In Conway chained arrow notation, [math]\displaystyle{ a[5]b = a\rightarrow b\rightarrow 3 }[/math].[5]
- Another proposed notation is [math]\displaystyle{ {_{b}a} }[/math], though this is not extensible to higher hyperoperations.[6]
Examples
The values of the pentation function may also be obtained from the values in the fourth row of the table of values of a variant of the Ackermann function: if [math]\displaystyle{ A(n,m) }[/math] is defined by the Ackermann recurrence [math]\displaystyle{ A(m-1,A(m,n-1)) }[/math] with the initial conditions [math]\displaystyle{ A(1,n)=an }[/math] and [math]\displaystyle{ A(m,1)=a }[/math], then [math]\displaystyle{ a[5]b=A(4,b) }[/math].[7]
As tetration, its base operation, has not been extended to non-integer heights, pentation [math]\displaystyle{ a[5]b }[/math] is currently only defined for integer values of a and b where a > 0 and b ≥ −2, and a few other integer values which may be uniquely defined. As with all hyperoperations of order 3 (exponentiation) and higher, pentation has the following trivial cases (identities) which holds for all values of a and b within its domain:
- [math]\displaystyle{ 1[5]b = 1 }[/math]
- [math]\displaystyle{ a[5]1 = a }[/math]
Additionally, we can also define:
- [math]\displaystyle{ a[5]2 = a[4]a }[/math]
- [math]\displaystyle{ a[5]0 = 1 }[/math]
- [math]\displaystyle{ a[5](-1) = 0 }[/math]
- [math]\displaystyle{ a[5](-2) = -1 }[/math]
- [math]\displaystyle{ a[5](b+1) = a[4](a[5]b) }[/math]
Other than the trivial cases shown above, pentation generates extremely large numbers very quickly such that there are only a few non-trivial cases that produce numbers that can be written in conventional notation, as illustrated below:
- [math]\displaystyle{ 2[5]2 = 2[4]2 = 2^2 = 4 }[/math]
- [math]\displaystyle{ 2[5]3 = 2[4](2[5]2) = 2[4](2[4]2) = 2[4]4 = 2^{2^{2^2}} = 2^{2^4} = 2^{16} = 65,536 }[/math]
- [math]\displaystyle{ 2[5]4 = 2[4](2[5]3) = 2[4](2[4](2[4]2)) = 2[4](2[4]4) = 2[4]65,536 = 2^{2^{2^{\cdot^{\cdot^{\cdot^{2}}}}}} \mbox{ (a power tower of height 65,536) } \approx \exp_{10}^{65,533}(4.29508) }[/math] (shown here in iterated exponential notation as it is far too large to be written in conventional notation. Note [math]\displaystyle{ \exp_{10}(n) = 10^n }[/math])
- [math]\displaystyle{ 2[5]5 = 2[4](2[5]4) = 2[4](2[4](2[4](2[4]2))) = 2[4](2[4](2[4]4)) = 2[4](2[4]65,536) = 2^{2^{2^{\cdot^{\cdot^{\cdot^{2}}}}}} \mbox{ (a power tower of height 2[4]65,536) } \approx \exp_{10}^{2[4]65,536-3}(4.29508) }[/math]
- [math]\displaystyle{ 3[5]2 = 3[4]3 = 3^{3^3} = 3^{27} = 7,625,597,484,987 }[/math]
- [math]\displaystyle{ 3[5]3 = 3[4](3[5]2) = 3[4](3[4]3) = 3[4]7,625,597,484,987 = 3^{3^{3^{\cdot^{\cdot^{\cdot^{3}}}}}} \mbox{ (a power tower of height 7,625,597,484,987) } \approx \exp_{10}^{7,625,597,484,986}(1.09902) }[/math]
- [math]\displaystyle{ 3[5]4 = 3[4](3[5]3) = 3[4](3[4](3[4]3)) = 3[4](3[4]7,625,597,484,987) = 3^{3^{3^{\cdot^{\cdot^{\cdot^{3}}}}}} \mbox{ (a power tower of height 3[4]7,625,597,484,987) } \approx \exp_{10}^{3[4]7,625,597,484,987-1}(1.09902) }[/math]
- [math]\displaystyle{ 4[5]2 = 4[4]4 = 4^{4^{4^4}} = 4^{4^{256}} \approx \exp_{10}^3(2.19) }[/math] (a number with over 10153 digits)
- [math]\displaystyle{ 5[5]2 = 5[4]5 = 5^{5^{5^{5^5}}} = 5^{5^{5^{3125}}} \approx \exp_{10}^4(3.33928) }[/math] (a number with more than 10102184 digits)
See also
References
- ↑ Perstein, Millard H. (June 1962), "Algorithm 93: General Order Arithmetic", Communications of the ACM 5 (6): 344, doi:10.1145/367766.368160.
- ↑ "Transfinite ordinals in recursive number theory", The Journal of Symbolic Logic 12 (4): 123–129, 1947, doi:10.2307/2266486.
- ↑ "Mathematics and computer science: Coping with finiteness", Science 194 (4271): 1235–1242, 1976, doi:10.1126/science.194.4271.1235, PMID 17797067, Bibcode: 1976Sci...194.1235K.
- ↑ Blakley, G. R.; Borosh, I. (1979), "Knuth's iterated powers", Advances in Mathematics 34 (2): 109–136, doi:10.1016/0001-8708(79)90052-5.
- ↑ Conway, John Horton; Guy, Richard (1996), The Book of Numbers, Springer, p. 61, ISBN 9780387979939, https://books.google.com/books?id=0--3rcO7dMYC&pg=PA61.
- ↑ "Tetration.org - Tetration". http://www.tetration.org/Tetration/index.html.
- ↑ Nambiar, K. K. (1995), "Ackermann functions and transfinite ordinals", Applied Mathematics Letters 8 (6): 51–53, doi:10.1016/0893-9659(95)00084-4.
 |  |
