Tetration
  Main Identities Code Graphs Paper  
  History Definitions Error Tables Links  

Welcome to the Home of Tetration


         This site is about Tetration. Tetration is an obscure mathematical operation that currently falls under the category of Pure Mathematics, because it has almost no application. Even so, many mathematicians have been interested in tetration, because of the historical significance of its relatives in the hyper-operation sequence, and because it is easy to make very large numbers with tetration.
         The hyper-operation sequence is the technical name for the list of mathematical operators you already know: addition (a + b) is the first, multiplication (a*b = ab) is the second, and exponentiation (a^b = ab) is the third. The reason why these are in the same list, and in this order is because you can think of multiplication as repeated addition, and you can think of exponentiation as repeated multiplication. The fourth operation in this sequence is called tetration, because it is the fourth (tetra). Tetration then, would be repeated exponentiation. The problem is that there are two ways to do that, lets say for repeating exponentiation on 3 threes:          From Algebra, we know that (ab)c = a(bc), so the bottom-up method is not really a new operator, but is simply expressible in terms of exponentiation. Munafo uses the notation x(4)y for this "lower" form of repeated exponentiation, and gives the relationship:          When we talk about tetration, we are only talking about the top-down method, because this makes a new operation. Now that we know what tetration is, it is easy to see why such an obscure mathematical operation would be studied for hundreds of years, even without any substantial progress.
         Another problem with tetration is that the values at real y in yx are unknown. Many extensions of tetration have been devised, but none so far have satisfied all the requirements tetration should have. Hopefully, my paper will provide new insight into tetration and its inverse, the super-logarithm, by providing a definition of an extension that does satisfy those requirements, and a method that approximates that definition. For more information, read my paper, available from the menu above.

Visited: times, last updated: 2006-02-15, by: Andrew Robbins, contact: and_j_rob(at)yahoo(dot)com