- In mathematics,
tetration (or hyper-4) is an
operation based on iterated, or repeated, exponentiation.
There is no
standard notation for tetration, though...
- than
regular factorials or even hyperfactorials, in fact
exhibiting tetrational growth. The
number of
digits in the
exponential factorial of 6 is approximately...
-
containing only the
empty set, and so forth.) This
sequence exhibits tetrational growth. The set V5
contains 216 = 65536 elements; the set V6 contains...
-
exponential growth, f 3 ( x ) {\displaystyle f_{3}(x)} is
comparable to
tetrational growth and is upper-bounded by a
function involving the
first four hyperoperators;...
-
although it is not real on the real axis; it
cannot be
interpreted as
tetrational,
because the
condition S ( 0 ; x ) = x {\displaystyle S(0;x)=x} cannot...
-
shortest proof has
length at
least 10002,
where 02 = 1 and n +12 = 2(n2) (
tetrational growth). The
statement is a
special case of Kruskal's
theorem and has...
- (?) of β < α
ordinals less than α, but
rather the
epsilon numbers, "
tetrationally indecomposable"
refers to the zeta numbers, "pentationally indecomposable"...
- A^{3^{13n}}\right\rfloor } is
prime for all
positive integers n {\displaystyle n} . A
tetrationally growing prime-generating
formula similar to Mills'
comes from a theorem...
- logarithm, and the
smallest number of a
given additive persistence grows tetrationally. Some
functions only
allow persistence up to a
certain degree. For example...
-
Exponentially indecomposable ordinals are
equal to the
epsilon numbers,
tetrationally indecomposable ordinals are
equal to the zeta
numbers (fixed points...
