Misplaced Pages

Pentation

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
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 message)
Arithmetic operation
The first three values of the expression x2. The value of 32 is 7625597484987; values for higher x, such as 42, which is about 2.361 × 10 are much too large to appear on the graph.

In mathematics, pentation (or hyper-5) is the fifth hyperoperation. Pentation is defined to be repeated tetration, similarly to how tetration is repeated exponentiation, exponentiation is repeated multiplication, and multiplication is repeated addition. The concept of "pentation" was named by English mathematician Reuben Goodstein in 1947, when he came up with the naming scheme for hyperoperations.

The number a pentated to the number b is defined as a tetrated to itself b - 1 times. This may variously be denoted as a [ 5 ] b {\displaystyle ab} , a ↑ ↑ ↑ b {\displaystyle a\uparrow \uparrow \uparrow b} , a 3 b {\displaystyle a\uparrow ^{3}b} , a b 3 {\displaystyle a\to b\to 3} , or b a {\displaystyle {_{b}a}} , depending on one's choice of notation.

For example, 2 pentated to the 2 is 2 tetrated to the 2, or 2 raised to the power of 2, which is 2 2 = 4 {\displaystyle 2^{2}=4} . As another example, 2 pentated to the 3 is 2 tetrated to the result of 2 tetrated to the 2. Since 2 tetrated to the 2 is 4, 2 pentated to the 3 is 2 tetrated to the 4, which is 2 2 2 2 = 65536 {\displaystyle 2^{2^{2^{2}}}=65536} .

Based on this definition, pentation is only defined when a and b are both positive integers.

Definition

Pentation is the next hyperoperation (infinite sequence of arithmetic operations, based off the previous one each time) after tetration and before hexation. It is defined as iterated (repeated) tetration (assuming right-associativity). This is similar to as tetration is iterated right-associative exponentiation. It is a binary operation defined with two numbers a and b, where a is tetrated to itself b − 1 times.

The type of hyperoperation is typically denoted by a number in brackets, . For instance, using hyperoperation notation for pentation and tetration, 2 [ 5 ] 3 {\displaystyle 23} means tetrating 2 to itself 2 times, or 2 [ 4 ] ( 2 [ 4 ] 2 ) {\displaystyle 2(22)} . This can then be reduced to 2 [ 4 ] ( 2 2 ) = 2 [ 4 ] 4 = 2 2 2 2 = 2 2 4 = 2 16 = 65 , 536. {\displaystyle 2(2^{2})=24=2^{2^{2^{2}}}=2^{2^{4}}=2^{16}=65,536.}

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.

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 a [ 5 ] b {\displaystyle ab} . In this format, a [ 3 ] b {\displaystyle ab} may be interpreted as the result of repeatedly applying the function x a [ 2 ] x {\displaystyle x\mapsto ax} , for b {\displaystyle b} repetitions, starting from the number 1. Analogously, a [ 4 ] b {\displaystyle ab} , tetration, represents the value obtained by repeatedly applying the function x a [ 3 ] x {\displaystyle x\mapsto ax} , for b {\displaystyle b} repetitions, starting from the number 1, and the pentation a [ 5 ] b {\displaystyle ab} represents the value obtained by repeatedly applying the function x a [ 4 ] x {\displaystyle x\mapsto ax} , for b {\displaystyle b} repetitions, starting from the number 1. This will be the notation used in the rest of the article.
  • In Knuth's up-arrow notation, a [ 5 ] b {\displaystyle ab} is represented as a ↑ ↑ ↑ b {\displaystyle a\uparrow \uparrow \uparrow b} or a 3 b {\displaystyle a\uparrow ^{3}b} . In this notation, a b {\displaystyle a\uparrow b} represents the exponentiation function a b {\displaystyle a^{b}} and a ↑ ↑ b {\displaystyle a\uparrow \uparrow b} represents tetration. The operation can be easily adapted for hexation by adding another arrow.
  • In Conway chained arrow notation, a [ 5 ] b = a b 3 {\displaystyle ab=a\rightarrow b\rightarrow 3} .
  • Another proposed notation is b a {\displaystyle {_{b}a}} , though this is not extensible to higher hyperoperations.

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 A ( n , m ) {\displaystyle A(n,m)} is defined by the Ackermann recurrence A ( m 1 , A ( m , n 1 ) ) {\displaystyle A(m-1,A(m,n-1))} with the initial conditions A ( 1 , n ) = a n {\displaystyle A(1,n)=an} and A ( m , 1 ) = a {\displaystyle A(m,1)=a} , then a [ 5 ] b = A ( 4 , b ) {\displaystyle ab=A(4,b)} .

As tetration, its base operation, has not been extended to non-integer heights, pentation a [ 5 ] b {\displaystyle ab} 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:

  • 1 [ 5 ] b = 1 {\displaystyle 1b=1}
  • a [ 5 ] 1 = a {\displaystyle a1=a}

Additionally, we can also introduce the following defining relations:

  • a [ 5 ] 2 = a [ 4 ] a {\displaystyle a2=aa}
  • a [ 5 ] 0 = 1 {\displaystyle a0=1}
  • a [ 5 ] ( 1 ) = 0 {\displaystyle a(-1)=0}
  • a [ 5 ] ( 2 ) = 1 {\displaystyle a(-2)=-1}
  • a [ 5 ] ( b + 1 ) = a [ 4 ] ( a [ 5 ] b ) {\displaystyle a(b+1)=a(ab)}

Other than the trivial cases shown above, pentation generates extremely large numbers very quickly. As a result, there are only a few non-trivial cases that produce numbers that can be written in conventional notation, which are all listed below.

Some of these numbers are written in power tower notation due to their extreme size. Note that exp 10 ( n ) = 10 n {\displaystyle \exp _{10}(n)=10^{n}} .

  • 2 [ 5 ] 2 = 2 [ 4 ] 2 = 2 2 = 4 {\displaystyle 22=22=2^{2}=4}
  • 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 {\displaystyle 23=2(22)=2(22)=24=2^{2^{2^{2}}}=2^{2^{4}}=2^{16}=65,536}
  • 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 2  (a power tower of height 65,536)  exp 10 65 , 533 ( 4.29508 ) {\displaystyle 24=2(23)=2(2(22))=2(24)=265,536=2^{2^{2^{\cdot ^{\cdot ^{\cdot ^{2}}}}}}{\mbox{ (a power tower of height 65,536) }}\approx \exp _{10}^{65,533}(4.29508)} .
  • 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 2  (a power tower of height 265,536)  exp 10 2 [ 4 ] 65 , 536 3 ( 4.29508 ) {\displaystyle 25=2(24)=2(2(2(22)))=2(2(24))=2(265,536)=2^{2^{2^{\cdot ^{\cdot ^{\cdot ^{2}}}}}}{\mbox{ (a power tower of height 265,536) }}\approx \exp _{10}^{265,536-3}(4.29508)}
  • 3 [ 5 ] 2 = 3 [ 4 ] 3 = 3 3 3 = 3 27 = 7 , 625 , 597 , 484 , 987 {\displaystyle 32=33=3^{3^{3}}=3^{27}=7,625,597,484,987}
  • 3 [ 5 ] 3 = 3 [ 4 ] ( 3 [ 5 ] 2 ) = 3 [ 4 ] ( 3 [ 4 ] 3 ) = 3 [ 4 ] 7 , 625 , 597 , 484 , 987 = 3 3 3 3  (a power tower of height 7,625,597,484,987)  exp 10 7 , 625 , 597 , 484 , 986 ( 1.09902 ) {\displaystyle 33=3(32)=3(33)=37,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)}
  • 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 3  (a power tower of height 37,625,597,484,987)  exp 10 3 [ 4 ] 7 , 625 , 597 , 484 , 987 1 ( 1.09902 ) {\displaystyle 34=3(33)=3(3(33))=3(37,625,597,484,987)=3^{3^{3^{\cdot ^{\cdot ^{\cdot ^{3}}}}}}{\mbox{ (a power tower of height 37,625,597,484,987) }}\approx \exp _{10}^{37,625,597,484,987-1}(1.09902)}
  • 4 [ 5 ] 2 = 4 [ 4 ] 4 = 4 4 4 4 = 4 4 256 exp 10 3 ( 2.19 ) {\displaystyle 42=44=4^{4^{4^{4}}}=4^{4^{256}}\approx \exp _{10}^{3}(2.19)} (a number with over 10 digits)
  • 5 [ 5 ] 2 = 5 [ 4 ] 5 = 5 5 5 5 5 = 5 5 5 3125 exp 10 4 ( 3.33928 ) {\displaystyle 52=55=5^{5^{5^{5^{5}}}}=5^{5^{5^{3125}}}\approx \exp _{10}^{4}(3.33928)} (a number with more than 10 digits)

See also

References

  1. Perstein, Millard H. (June 1961), "Algorithm 93: General Order Arithmetic", Communications of the ACM, 5 (6): 344, doi:10.1145/367766.368160, S2CID 581764.
  2. Goodstein, R. L. (1947), "Transfinite ordinals in recursive number theory", The Journal of Symbolic Logic, 12 (4): 123–129, doi:10.2307/2266486, JSTOR 2266486, MR 0022537, S2CID 1318943.
  3. Knuth, D. E. (1976), "Mathematics and computer science: Coping with finiteness", Science, 194 (4271): 1235–1242, Bibcode:1976Sci...194.1235K, doi:10.1126/science.194.4271.1235, PMID 17797067, S2CID 1690489.
  4. 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, MR 0549780.
  5. Conway, John Horton; Guy, Richard (1996), The Book of Numbers, Springer, p. 61, ISBN 9780387979939.
  6. "Tetration.org - Tetration". www.tetration.org. Retrieved 2022-09-12.
  7. Nambiar, K. K. (1995), "Ackermann functions and transfinite ordinals", Applied Mathematics Letters, 8 (6): 51–53, CiteSeerX 10.1.1.563.4668, doi:10.1016/0893-9659(95)00084-4, MR 1368037.
Hyperoperations
Primary
Inverse for left argument
Inverse for right argument
Related articles
Large numbers
Examples
in
numerical
order
Expression
methods
Notations
Operators
Related
articles
(alphabetical
order)
Categories: