This articlemay be too technical for most readers to understand.(January 2023) |
Inmathematics,pentation(orhyper-5) is the fifthhyperoperation.Pentation is defined to be repeatedtetration,similarly to how tetration is repeatedexponentiation,exponentiation is repeatedmultiplication,and multiplication is repeatedaddition.The concept of "pentation" was named by English mathematicianReuben Goodsteinin 1947, when he came up with the naming scheme for hyperoperations.

The numberapentated to the numberbis defined asatetrated to itselfb - 1times. This may variously be denoted as,,,,or,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.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.
Based on this definition, pentation is only defined whenaandbare bothpositive integers.
Definition
editPentation is the nexthyperoperation(infinitesequenceof arithmetic operations, based on the previous one each time) aftertetrationand before hexation. It is defined asiterated(repeated) tetration (assuming right-associativity). This is similar to as tetration is iterated right-associativeexponentiation.[1]It is abinary operationdefined with two numbersaandb,whereais tetrated to itselfb − 1times.
The type of hyperoperation is typically denoted by a number in brackets, []. For instance, usinghyperoperationnotation for pentation and tetration,means tetrating 2 to itself 2 times, or.This can then be reduced to
Etymology
editThe word "pentation" was coined byReuben Goodsteinin 1947 from the rootspenta-(five) anditeration.It is part of his general naming scheme forhyperoperations.[2]
Notation
editThere 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 ahyperoperationas.In this format,may be interpreted as the result ofrepeatedly applyingthe function,forrepetitions, starting from the number 1. Analogously,,tetration, represents the value obtained by repeatedly applying the function,forrepetitions, starting from the number 1, and the pentationrepresents the value obtained by repeatedly applying the function,forrepetitions, starting from the number 1.[3][4]This will be the notation used in the rest of the article.
- InKnuth's up-arrow notation,is represented asor.In this notation,represents the exponentiation functionandrepresents tetration. The operation can be easily adapted for hexation by adding another arrow.
- InConway chained arrow notation,.[5]
- Another proposed notation is,though this is not extensible to higher hyperoperations.[6]
Examples
editThe 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 theAckermann function:ifis defined by the Ackermann recurrencewith the initial conditionsand,then.[7]
As tetration, its base operation, has not been extended to non-integer heights, pentationis currently only defined for integer values ofaandbwherea> 0 andb≥ −2, and a few other integer values whichmaybe uniquely defined. As with all hyperoperations of order 3 (exponentiation) and higher, pentation has the followingtrivialcases (identities) which holds for all values ofaandbwithin its domain:
Additionally, we can also introduce the following defining relations:
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 inpower towernotation due to their extreme size. Note that.
- .
- (a number with over 10153digits)
- (a number with more than 10102184digits)
See also
editReferences
edit- ^Perstein, Millard H. (June 1961), "Algorithm 93: General Order Arithmetic",Communications of the ACM,5(6): 344,doi:10.1145/367766.368160,S2CID581764.
- ^Goodstein, R. L.(1947), "Transfinite ordinals in recursive number theory",The Journal of Symbolic Logic,12(4):123–129,doi:10.2307/2266486,JSTOR2266486,MR0022537,S2CID1318943.
- ^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,PMID17797067,S2CID1690489.
- ^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,MR0549780.
- ^Conway, John Horton;Guy, Richard(1996),The Book of Numbers,Springer, p. 61,ISBN9780387979939.
- ^"Tetration.org - Tetration".www.tetration.org.Retrieved2022-09-12.
- ^Nambiar, K. K. (1995), "Ackermann functions and transfinite ordinals",Applied Mathematics Letters,8(6):51–53,CiteSeerX10.1.1.563.4668,doi:10.1016/0893-9659(95)00084-4,MR1368037.