Tetration — Definition, Formula & Examples
Tetration is repeated exponentiation. You stack copies of the same number into a tower of exponents, so means .
For a real base and a positive integer height , tetration is defined recursively by and . By convention . It is the fourth hyperoperation, after addition, multiplication, and exponentiation. In Knuth's up-arrow notation it is written . The tower is right-associative: you evaluate it from the top exponent downward.
Key Formula
Where:
- = the base, the number being stacked
- = the height, the number of copies of a in the tower (a positive integer)
- = the tetration of a to height n, read "a tetrated to n"
Worked Example
Problem: Evaluate , a power tower of four 2s.
Step 1: Start at the top of the tower. A tower of two 2s is an ordinary power.
Step 2: Use the recursive rule. The tower of three 2s puts the previous result in the exponent.
Step 3: Repeat once more for height 4.
Answer: . The next term, , already has 19,729 digits.
Why It Matters
Tetration shows how fast the hyperoperation sequence grows. That idea appears in computer science courses that study the Ackermann function and growth rates of algorithms. Up-arrow notation, built on tetration, is the standard way to describe enormous values such as Graham's number. The infinite tower is also a classic analysis problem: it converges exactly when .
Common Mistakes
Mistake: Evaluating the tower from the bottom up. For example, computing as .
Correction: Power towers are right-associative, so you start with the top exponent: . The bottom-up version simplifies to and is far smaller.
