This site is supported by donations to The OEIS Foundation.
Tetra-logarithms
From OeisWiki
The tetra-logarithm (super-logarithm) with base b is the inverse function of the tetra-exponential (super-exponential) with base b.
Just as the two exponentiation functions (powers and exponentials) have two inverse functions (roots and logarithms), the two tetration functions (tetra-powers and tetra-exponentials, also called super-powers and super-exponentials) have two inverse functions (tetra-roots and tetra-logarithms, also called super-roots^{[1]} and super-logarithms^{[2]}).
The base b tetra-logarithm (super-logarithm)^{[3]}^{[4]}
is the logarithmic-like inverse of the tetra-exponential
The natural tetra-logarithm (natural super-logarithm)
is the [natural] logarithmic-like inverse of the [natural] tetra-exponential
If x is a positive integer, for example, consider the tower of height 4
then
or consider the tower of height 5
then
For a tower of height x = 0, we have
and
since we have the empty product.
Contents |
Iterated logarithm
- Main article page: Iterated logarithm
The iterated natural logarithm, denoted log* (usually read "log star"), is defined as the number of iterations of the natural logarithm before the result is less than or equal to 1. It is defined recursively as
It is thus given by the ceiling of the natural tetra-logarithm (super-logarithm), i.e.
The base b iterated logarithm is defined as the number of iterations of the base logarithm before the result is less than or equal to 1, i.e.
It is thus given by the ceiling of the base b tetra-logarithm, i.e.
One might want to find if there is a base β such that the iteration ends exactly at x = 1, by trying tetra-roots of height h, for h = {2, 3, ...}. In that case
Note that we only have a countable infinity of integer heights h to try... (while there are an uncountable infinity of real numbers greater than 1).
See also
Hierarchical list of operations pertaining to numbers ^{[5]} ^{[6]}
0^{th} iteration
- Successor S(n)
- Predecessor P(n)
1^{st} iteration
- Addition, S(S(... s times ...(S(n)))), the sum n+s
- Subtraction, P(P(... s times ...(P(n)))), the difference n-s
2^{nd} iteration
- Multiplication, n+(n+(... m times ...(n+(n)))), the product n∗m
- Division, the ratio n/d
3^{rd} iteration
- Exponentiation (d as "dimension", b as "base", n as "variable")
- Powers, n∗(n∗(... d times ...(n∗(n)))), written n^d
- Exponentials, b∗(b∗(... n times ...(b∗(b)))), written b^n
- Exponential function e^n, where e is Euler's number
- Exponentiation inverses
- Roots,
- Logarithms, log_{b}n
- Natural logarithm function log n, or log_{e}, where e is Euler's number
4^{th} iteration
- Tetration (d as "dimension", b as "base", n as "variable")
- Tetra-powers (super-powers), n^(n^(... d times ...(n^(n)))), written n^^d or n↑↑d
- Tetra-exponentials (super-exponentials), b^(b^(... n times ...(b^(b)))), written b^^n or b↑↑n
- Tetration inverses
- Tetra-roots (super-roots)
- Tetra-logarithms (super-logarithms),
5^{th} iteration
- Pentation (d as "dimension", b as "base", n as "variable")
- Penta-powers, n^^(n^^(... d times ...(n^^(n^^(n))))), written n^^^d or n↑↑↑d
- Penta-exponentials, b^^(b^^(... n times ...(b^^(b^^(b))))), written b^^^n or b↑↑↑n
- Pentation inverses
6^{th} iteration
- Hexation (d as "dimension", b as "base", n as "variable")
- Hexa-powers, n^^^(n^^^(... d times ...(n^^^(n)))), written n^^^^d or n↑↑↑↑d
- Hexa-exponentials, b^^^(b^^^(... n times ...(b^^^(b)))), written b^^^^n or b↑↑↑↑n
- Hexation inverses
7^{th} iteration
- Heptation (d as "dimension", b as "base", n as "variable")
- Hepta-powers, n^^^^(n^^^^(... d times ...(n^^^^(n)))), written n^^^^^d or n↑↑↑↑↑d
- Hepta-exponentials, b^^^^(b^^^^(... n times ...(b^^^^(b)))), written b^^^^^n or b↑↑↑↑↑n
- Heptation inverses
8^{th} iteration
- Octation (d as "dimension", b as "base", n as "variable")
- Octa-powers, n^^^^^(n^^^^^(... d times ...(n^^^^^(n)))), written n^^^^^^d or n↑↑↑↑↑↑d
- Octa-exponentials, b^^^^^(b^^^^^(... n times ...(b^^^^^(b)))), written b^^^^^^n or b↑↑↑↑↑↑n
- Octation inverses
Notes
- ↑ Super-root—Wikipedia.org.
- ↑ Super-logarithm—Wikipedia.org.
- ↑ There is no standard or generally accepted notation for the tetra-logarithm yet, although the down-arrow notation (derived from Knuth's up-arrow notation) seems the most intuitive one.
- ↑ Weisstein, Eric W., Down Arrow Notation, from MathWorld—A Wolfram Web Resource. [http://mathworld.wolfram.com/DownArrowNotation.html]
- ↑ Hyperoperation—Wikipedia.org.
- ↑ Grzegorczyk hierarchy—Wikipedia.org.