Pentation

From HandWiki
Short description: Arithmetic operation
The first three values of the expression x[5]2. The value of 3[5]2 is about 7.626 × 1012; values for higher x, such as 4[5]2, which is about 2.361 × 108.072 × 10153 are much too large to appear on the graph.

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, 2[5]3 means tetrating 2 to itself 2 times, or 2[4](2[4]2). This can then be reduced to 2[4](22)=2[4]4=2222=224=216=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.[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 a[5]b. In this format, a[3]b may be interpreted as the result of repeatedly applying the function xa[2]x, for b repetitions, starting from the number 1. Analogously, a[4]b, tetration, represents the value obtained by repeatedly applying the function xa[3]x, for b repetitions, starting from the number 1, and the pentation a[5]b represents the value obtained by repeatedly applying the function xa[4]x, for b 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, a[5]b is represented as ab or a3b. In this notation, ab represents the exponentiation function ab and ab represents tetration. The operation can be easily adapted for hexation by adding another arrow.
  • In Conway chained arrow notation, a[5]b=ab3.[5]
  • Another proposed notation is ba, 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 A(n,m) is defined by the Ackermann recurrence A(m1,A(m,n1)) with the initial conditions A(1,n)=an and A(m,1)=a, then a[5]b=A(4,b).[7]

As tetration, its base operation, has not been extended to non-integer heights, pentation a[5]b 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
  • a[5]1=a

Additionally, we can also define:

  • a[5]2=a[4]a
  • a[5]0=1
  • a[5](1)=0
  • a[5](2)=1
  • a[5](b+1)=a[4](a[5]b)

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:

  • 2[5]2=2[4]2=22=4
  • 2[5]3=2[4](2[5]2)=2[4](2[4]2)=2[4]4=2222=224=216=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=2222 (a power tower of height 65,536) exp1065,533(4.29508) (shown here in iterated exponential notation as it is far too large to be written in conventional notation. Note exp10(n)=10n)
  • 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)=2222 (a power tower of height 2[4]65,536) exp102[4]65,5363(4.29508)
  • 3[5]2=3[4]3=333=327=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=3333 (a power tower of height 7,625,597,484,987) exp107,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)=3333 (a power tower of height 3[4]7,625,597,484,987) exp103[4]7,625,597,484,9871(1.09902)
  • 4[5]2=4[4]4=4444=44256exp103(2.19) (a number with over 10153 digits)
  • 5[5]2=5[4]5=55555=5553125exp104(3.33928) (a number with more than 10102184 digits)

See also

References

  1. Perstein, Millard H. (June 1962), "Algorithm 93: General Order Arithmetic", Communications of the ACM 5 (6): 344, doi:10.1145/367766.368160 .
  2. "Transfinite ordinals in recursive number theory", The Journal of Symbolic Logic 12 (4): 123–129, 1947, doi:10.2307/2266486 .
  3. "Mathematics and computer science: Coping with finiteness", Science 194 (4271): 1235–1242, 1976, doi:10.1126/science.194.4271.1235, PMID 17797067, Bibcode1976Sci...194.1235K .
  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 .
  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 .
  6. "Tetration.org - Tetration". http://www.tetration.org/Tetration/index.html. 
  7. Nambiar, K. K. (1995), "Ackermann functions and transfinite ordinals", Applied Mathematics Letters 8 (6): 51–53, doi:10.1016/0893-9659(95)00084-4 .