Tetration

in math prevents it from being rendered as HTML, which
can't handle nested exponents -->
Tetration (also '''exponential map''', '''hyperpower''', '''power tower''', '''super-exponentiation''', and '''hyper4''') is '''iterated exponentiation''', the first Hyper Operator after exponentiation. The Portmanteau Word ''tetration'' was coined by Reuben Louis Goodstein from Tetra- (four) and Iteration . Tetration is used for the Notation Of Very Large Numbers .
Tetration follows Exponentiation in the sequence:
# Addition
#:

a+b\,

# Multiplication
#:

\atop b}

# Exponentiation
#:

\atop b}

#tetration
#:

{\ ^{b}a = \atop {\ }} }}}} \atop b}

where each operation is defined by iterating the previous one.

Multiplication (

a 	imes b

) can be thought of as ''B instances of A added together'', and consequently exponentiation (

a^b

) can be thought of as ''B instances of A multiplied together''. So a step further can be taken, and tetration (

a \uparrow\uparrow b

) can be thought of as ''B instances of A exponentiated together''.

Note that when evaluating multiple-level exponentiation, the exponentiation is done at the deepest level first (in the notation, at the highest level). In other words:
:

\,\!2^{2^{2^2}} = 2^{\left(2^{\left(2^2
ight)}
ight)} = 2^{\left(2^4
ight)} = 2^{16} = 65,\!536

\,\!2^{2^{2^2}}

is not equal to

\,\! \left({\left(2^2
ight)}^2
ight)^2 = 256

NOTATION

To generalize the first case (tetration) above, a new notation is needed (see below); however, the second case can be written as
:

\,\! \left(\left(2^2
ight)^2
ight)^2 = 2^{2 \cdot 2 \cdot 2} = 2^{2^3}

Thus, ''its'' general form still uses ordinary exponentiation notation.

The notations in which tetration can be written (some of which allow even higher levels of iteration) include:

Standard notation: ${}^ba$ — first used by Maurer ; Rudy Rucker 's book Infinity and the Mind popularized the notation.

Knuth's Up-arrow Notation : $a \uparrow\uparrow b$ — allows extension by putting more arrows, or equivalently, an indexed arrow

Conway Chained Arrow Notation : $a
ightarrow b
ightarrow 2$ — allows extension by increasing the number 2 (equivalent with the extensions above), but also, even more powerfully, by extending the chain

hyper4 notation: $a^{(4)}b = \operatorname{hyper4}(a, b) = \operatorname{hyper}(a, 4, b)$ — allows extension by increasing the number 4; this gives the family of Hyper Operator s

For the Ackermann Function we have

2 \uparrow\uparrow b = \operatorname{A}(4, b - 3) + 3

, i.e.

\operatorname{A}(4, n) = 2 \uparrow\uparrow (n+3) - 3

The up-arrow is used identically to the caret (^), so that the tetration operator may be written as ^^ in ASCII : a^^b.

EXAMPLES

$1 \uparrow\uparrow 2 = 1^1 = 1$

$2 \uparrow\uparrow 2 = 2^2 = 4$

$3 \uparrow\uparrow 2 = 3^3 = 27$

$4 \uparrow\uparrow 2 = 4^4 = 256$

$5 \uparrow\uparrow 2 = 5^5 = 3,125$

$6 \uparrow\uparrow 2 = 6^6 = 46,656$

$7 \uparrow\uparrow 2 = 7^7 = 823,543$

$8 \uparrow\uparrow 2 = 8^8 = 16,777,216$

$9 \uparrow\uparrow 2 = 9^9 = 387,420,489$

$10 \uparrow\uparrow 2 = 10^{10} = 10,000,000,000$

$1 \uparrow\uparrow 3$ $\,\!= 1^{1^1}$ $= 1$

$\,\!2 \uparrow\uparrow 3$ $\,\!= 2^{2^2}$ $= 16$

$\,\!3 \uparrow\uparrow 3$ $\,\!= 3^{3^3}$ $= 7,625,597,484,987$

$\,\!4 \uparrow\uparrow 3$ $\,\!= 4^{4^4}$ $= 4^{256} \approx 1.34078079 imes 10^{154}$

$\,\!5 \uparrow\uparrow 3$ $\,\!= 5^{5^5}$ $= 5^{3125} \approx 1.91 imes 10^{2184}$ (over 2,000 Digit s long)

$\,\!6 \uparrow\uparrow 3$ $\,\!= 6^{6^6}$ $= 6^{46656} \approx 2.66 imes 10^{36305}$ (over 36,000 digits long)

$\,\!7 \uparrow\uparrow 3$ $\,\!= 7^{7^7}$ $= 7^{823543} \approx 1.97 imes 10^{402472}$ (over 400,000 digits long)

$\,\!1 \uparrow\uparrow 4$ $\,\!= 1^{1^{1^1}}$ $= 1$

$\,\!2 \uparrow\uparrow 4$ $\,\!= 2^{2^{2^2}}$ $= 65,536$

$\,\!3 \uparrow\uparrow 4$ $\,\!= 3^{3^{3^3}}$ $= 3^{7,625,597,484,987} \approx 1.258 imes 10^{3,638,334,640,024}$ (over three Trillion digits long)

$\,\!1 \uparrow\uparrow 5$ $\,\!= 1^{1^{1^{1^1}}}$ $= 1$

$\,\!2 \uparrow\uparrow 5$ $\,\!= 2^{2^{2^{2^2}}}$ $= 2^{65536} \approx 2.00 imes 10^{19728}$ (nearly 20,000 digits long)

EXTENSION TO LOW VALUES OF THE SECOND OPERAND

Using the relation

n \uparrow\uparrow k = \log_n \left(n \uparrow\uparrow (k+1)
ight)

(which follows from the definition of tetration), one can derive (or define) values for

n \uparrow\uparrow k

where

k \in \{-1, 0, 1\}

\begin{matrix}
  n \uparrow\uparrow 1
    & = &
  \log_n \left(n \uparrow\uparrow 2
ight)
    & = &
  \log_{n} \left(n^n
ight)
    & = & 
  n \log_{n} n 
    & = & 
  n
\
  n \uparrow\uparrow 0
    & = &
  \log_{n} \left(n \uparrow\uparrow 1
ight)
    & = & 
  \log_{n} n
    & & & = &
  1
\
  n \uparrow\uparrow -1
    & = &
  \log_{n} \left(n \uparrow\uparrow 0
ight)
    & = &
  \log_{n} 1
    & & & = & 
  0
\end{matrix}

This confirms the intuitive definition of

n \uparrow\uparrow 1

as simply being

n

. However, no further values can be derived by further iteration in this fashion, as

\log_n 0

is undefined.

Similarly, since

\log_{1} 1

is also undefined (

\log_{1} 1 = \begin{matrix}rac{\log_n 1}{\log_n 1} = rac{0}{0}\end{matrix}

), the derivation above does not hold when

n

= 1. Therefore,

1 \uparrow\uparrow {-1}

must remain an undefined quantity as well. (The figure

1 \uparrow\uparrow {0}

can safely be defined as 1, however.)

Sometimes,

0^0

is taken to be an undefined quantity. In this case, values for

0\uparrow\uparrow{k}

cannot be defined directly. However,

\lim_{n
ightarrow0} n\uparrow\uparrow{k}

is well defined, and exists:
:

\lim_{n
ightarrow0} n\uparrow\uparrow k = \begin{cases} 1, & k \mbox{ even} \ 0, & k \mbox{ odd} \end{cases}

This limit holds for negative

n

, as well.

0 \uparrow\uparrow {k}

could be defined in terms of this limit and this would agree with a definition of

0^0 = 1

.

COMPLEX TETRATION

Since Complex Number s can be raised to powers, tetration can be applied to numbers of the form

a + bi

, where

i

is the Square Root of −1. For example,

n \uparrow\uparrow k

where

n=i

, tetration is achieved by using the Principal Branch of the natural logarithm, and noting the relation:

:

i^{a+bi} = e^ \left(\cos{a\pi \over 2} + i \sin{a\pi \over 2}
ight)

This suggests a recursive definition for

i \uparrow\uparrow (k+1) = a'+b'i

given any

i \uparrow\uparrow k = a+bi

:

:

a' = e^{-{b\pi \over 2}} \cos{a\pi \over 2}

b' = e^{-{b\pi \over 2}} \sin{a\pi \over 2}

The following approximate values can be derived, where

i \uparrow n

is ordinary exponentiation (i.e.

i ^ n

$i \uparrow\uparrow 1 = i$

$i \uparrow\uparrow 2 = i \uparrow\left(i \uparrow\uparrow 1
ight) \approx 0.2079$

$i \uparrow\uparrow 3 = i \uparrow\left(i \uparrow\uparrow 2
ight) \approx 0.9472 + 0.3208i$

$i \uparrow\uparrow 4 = i \uparrow\left(i \uparrow\uparrow 3
ight) \approx 0.0501 + 0.6021i$

$i \uparrow\uparrow 5 = i \uparrow\left(i \uparrow\uparrow 4
ight) \approx 0.3872 + 0.0305i$

$i \uparrow\uparrow 6 = i \uparrow\left(i \uparrow\uparrow 5
ight) \approx 0.7823 + 0.5446i$

$i \uparrow\uparrow 7 = i \uparrow\left(i \uparrow\uparrow 6
ight) \approx 0.1426 + 0.4005i$

$i \uparrow\uparrow 8 = i \uparrow\left(i \uparrow\uparrow 7
ight) \approx 0.5198 + 0.1184i$

$i \uparrow\uparrow 9 = i \uparrow\left(i \uparrow\uparrow 8
ight) \approx 0.5686 + 0.6051i$

Solving the relation yields the expected

i \uparrow\uparrow 0 = 1

and

i \uparrow\uparrow -1 = 0

, with negative values of

k

giving infinite results on the imaginary axis. Plotted in the Complex Plane , the entire sequence spirals to the limit

0.4383 + 0.3606i

, which could be interpreted as the value where

k

is infinite.

Such tetration sequences have been studied since the time of Euler but are poorly understood due to their chaotic behavior. Most published research historically has focused on the convergence of the power tower function. Current research has greatly benefited by the advent of powerful computers with fractal and symbolic mathematics software. Much of what is known about tetration comes from general knowledge of complex dynamics and specific research of the exponential map.

EXTENSION TO REAL NUMBERS

Extending

x \uparrow\uparrow b

to real numbers

x > 0

is straightforward and gives, for each natural number

b

, a super-power function

\operatorname{f}(x) = x \uparrow\uparrow b

. (The term ''super'' is sometimes replaced by ''hyper'': '''hyper-power function''').

As mentioned above, for positive integers

b

the function tends to 1 for

x

tending to 0 if

b

is even, and to 0 if

b

is odd, while for

b = 0

and

b = -1

the function is constant, with values 1 and 0, respectively.

At this time there is no commonly accepted solution to the general problem of extending tetration to the real or complex numbers, although it is an active area of research.

Consider the problem of finding a super-exponential function or '''hyper-exponential function'''

\operatorname{f}(x) = a \uparrow\uparrow x

which is an extension to real

x > -2

to what was defined above, satisfying (for

a > 1

$a \uparrow\uparrow(b+1) = a^{\left(a\uparrow \uparrow b
ight)}$

it is monotonically increasing

it is continuous

When

a \uparrow\uparrow x

is defined for an interval of length one, the whole function easily follows for all

x > -2

A simple solution is given by

a \uparrow\uparrow x = x+1

for

-1, hence a \uparrow\uparrow x = a^x for 0, \,\!a \uparrow\uparrow x=a^{a^{(x-1)}} for 1, etc.

However, it is only piecewise differentiable; at integer values of x the derivative is multiplied by

\log_n{a}

10 \uparrow\uparrow 0.99 = 9.77

10 \uparrow\uparrow 1 = 10

10 \uparrow\uparrow 1.01 = 10.55

.

Other, more complicated solutions may be smoother and/or satisfy additional properties.

A super-exponential function grows even faster than a Double-exponential Function ; for example, if

a

= 10:

$\operatorname{f}(-1)=0$

$\operatorname{f}(0)=1$

$\operatorname{f}(1)=10$

$\operatorname{f}(2)=10^{10}$

$\operatorname{f}(2.3)=10^{100}$ ( Googol )

$\,\!\operatorname{f}(3)=10^{10^{10}}$

$\,\!\operatorname{f}(3.3)=10^{10^{100}}$ ( Googolplex )

It passes $\,\!10^{10^x}$ at $x = 2.376$ : $\operatorname{f}(x) \approx 4.83 imes 10^{237}$

When defining

a \uparrow\uparrow x

for every a, another possible requirement could be that

a \uparrow\uparrow x

is monotonically increasing with a.

The Inverse Function s are called super-root or '''hyper-root''', and '''super-logarithm''' or '''hyper-logarithm'''

\mathrm{slog}_a

defined for all real numbers, also negative numbers.

The function

\mathrm{slog}_a

satisfies:
:

\mathrm{slog}_a a^b = 1 + \mathrm{slog}_a b

\mathrm{slog}_a b = 1 + \mathrm{slog}_a \log_a b

\mathrm{slog}_a b > -2

Examples:

$\mathrm{slog}_{10} -3 = -1 + \mathrm{slog}_{10} 0.001 = -1 + -0.999 = -1.999$

$\mathrm{slog}_{10} 3 = \log_{10} 3 = .477$

$\mathrm{slog}_{10} 10^{6 imes 10^{23}} = 1 + \mathrm{slog}_{10} 6 imes 10^{23} = 2 + \mathrm{slog}_{10} 23.778 = 3 + \mathrm{slog}_{10} 1.376 = 3 + \log_{10} 1.376 = 3.139$

INFINITELY HIGH POWER TOWERS

\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{\sqrt{2}^{..}}}}}}

converges to 2, and can therefore be said to be equal to 2. In general, the infinite power tower

x^{x^{x^{..}}}

converges for

e^{-e} < x < e^{1/e}

. For arbitrary real

r

with

0 < r < e

, let

x = r^{1/r}

, then the limit is

r

. There is no convergence for

x > e^{1/e}

(max of

r^{1/r}

e^{1/e}

).

This may be extended to complex numbers

z

with the definition:

:

z^{z^{z^{.^{.^{.}}}}} = -rac{\mathrm{W}(-\ln{z})}{\ln{z}}

where

\mathrm{W}(z)

represents Lambert's W Function .

SEE ALSO

Ackermann Function

EXTERNAL LINKS

Extension of the hyper4 function to reals Robert Munafo discusses extending tetration to the real numbers.

Tetration of the Square Root of Two Another attempt to extend tetration to real numbers.

[http://ioannis.virtualcomposer2000.com/math/ Mathematics brain teasers] Ioannis Galidakis does extensive research on tetration. Galidakis’s web site contains the definitive list of references to tetration research. Lots of information on the Lambert W function, Riemann surfaces, and analytic continuation.

Power Tower From MathWorld--A Wolfram Web Resource. Nice website on background information relevant to tetration, with new content constantly being added.

Some Critical Points of the Hyperpower Function This site based on one of the few papers ever published specifically devoted to tetration.

Web pages for infinitely iterated exponentials Dave L. Renfro has compiled entries from questions about tetration on sci.math.

Home of Tetration Andrew Robbins has a paper about an infinitely differentiable extension of tetration to real numbers.

REFERENCES

R. Knobel. "Exponentials Reiterated." ''Amer. Math. Monthly'' 88, (1981), p. 235-252.

Hans Maurer . "Über die Funktion $y=x^{$ {Link without Title} }]} für ganzzahliges Argument (Abundanzen)." ''Mittheilungen der Mathematische Gesellschaft in Hamburg'' 4, (1901), p. 33-50; reference to usage of $\ ^ba$ from Knobel 's paper.

Reuben Louis Goodstein . "Transfinite ordinals in recursive number theory." ''Journal of Symbolic Logic'' 12, (1947).

	CATEGORIES ABOUT TETRATION

	arithmetic

	binary operations

	large numbers

	APPAREL
	BABY
	BEAUTY
	BOOKS
	CAR TOYS
	CELL PHONES
	DVD'S
	ELECTRONICS
	GOURMET FOOD
	GROCERIES
	HEALTH & PERSONAL
	HOME & GARDEN
	JEWELRY
	MUSIC
	MUSIC INSTRUMENTS
	OFFICE PRODUCTS
	SOFTWARE
	SPORTING GOODS
	TOOLS & HARDWARE
	TOYS
	VIDEO GAMES
	SHOPPING HOME

	MORE SHOPPING...

Information About

Tetration