Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [hyperoperation]

Hyperoperation is a field of mathematics which studies indexed families of binary operations, Hyperoperations families, that generalize and extend the standard sequence of the basic arithmetic operations of addition, multiplication and exponentiation.

55
votes
12answers
7k views

Why are addition and multiplication commutative, but not exponentiation?

We know that the addition and multiplication operators are both commutative, and the exponentiation operator is not. My question is why. As background there are plenty of mathematical schemes that ...
23
votes
3answers
644 views

What combinatorial quantity the tetration of two natural numbers represents?

Tetration is a generalization of exponentiation in arithmetic and a part of a series of other generalized notions, Hyperoperators. Consider $m\uparrow n$ denotes the tetration of $m$ and $n$. i.e. $$\...
21
votes
5answers
1k views

what operation repeated $n$ times results in the addition operator?

I had a difficult time in phrasing my question. But I was wondering if there is an operation that, when repeated n times, results in the addition operator. Same way as repeating addition n times ...
19
votes
7answers
2k views

Why do we stop at exponentiation stage in arithmetic of natural numbers?

In natural numbers the unary successor operator $S$ is the most natural function which maps each number to the next one. Furthermore we may consider the binary relation $+$ as an iteration of $S$. ...
18
votes
2answers
852 views

Proof of strictly increasing nature of $y(x)=x^{x^{x^{\ldots}}}$ on $[1,e^{\frac{1}{e}})$?

The title is fairly self explanatory: I have been trying to rigorously prove that $y(x)=x^{x^{x^{\ldots}}}$ is a strictly increasing function over the interval $[1,e^{\frac{1}{e}})$ for a while now, ...
16
votes
2answers
835 views

Could someone tell me how large this number is?

Context: If you guys didn't know, I'm running a nice little contest to see who can program the largest number. More specific rules if you are interested may be found in my chat room (click here to ...
14
votes
2answers
1k views

How exactly does Knuth's Up-Arrow notation work?

I've done some research, and found this on Wikipedia. \begin{matrix}a\uparrow b=a^{b}=&\underbrace {a\times a\times \dots \times a} \\&b{\mbox{ copies of }}a\end{matrix} \begin{matrix}a\...
13
votes
2answers
1k views

Continuum between addition, multiplication and exponentiation?

I noticed this old post which attempts to find the shades of grey between a linear and log scale where results are between zero and one. However, I was looking for the more general case where we find ...
13
votes
2answers
364 views

Superassociative operation

Background: Addition and multiplication are associative, but exponentiation is not. Question: Does an operation $\circ_1:\mathbb{N}\times\mathbb{N}\to\mathbb{N}$ exist such that $$\circ_i(x,y)=\...
12
votes
4answers
584 views

Can tetration 'escape' the complex plane?

Considering subtraction can break out of the natural numbers and into integers, division can break out of integers and into rational numbers, and exponentiation can break out of rational numbers and ...
11
votes
2answers
1k views

Example of Tetration in Natural Phenomena

Tetration is a natural extension of the concept of addition, multiplication, and exponentiation. It is quite obvious that there are things in the physics world which can be modeled by these 3 lowest ...
11
votes
1answer
701 views

Has this phenomenon been discovered and named?

If $$x-\frac{x}{2}=\frac{x}{2},$$ and $$\frac{x}{\sqrt{x}}=\sqrt{x},$$ and $$x-\uparrow(x-\uparrow^22)=x-\uparrow^22$$ when $(x\uparrow^n-[A])\uparrow^nA=x$, where $A$ is some constant, and one uses ...
8
votes
1answer
188 views

Are there nontrivial equations for hyperoperations above exponentiation?

A similar question was asked in comments elsewhere. A paper by Roberto Di Cosmo and Thomas Dufour ("The Equational Theory of 〈ℕ, 0, 1, + , ×, ↑〉 Is Decidable, but Not Finitely Axiomatisable") asserts ...
8
votes
1answer
217 views

How to define $A\uparrow B$ with a universal property as well as $A\oplus B$, $A\times B$, $A^B$ in category theory?

In category theory there are definitions for $A\oplus B$, $A\times B$ and $A^B$ via universal properties. I wonder if it is possible to isolate a particular universal property to represent the ...
8
votes
1answer
314 views

Transfinite Knuth-arrow hierarchy vs. fast-growing hierarchy

Suppose Knuth arrow notation (and hence the hyperoperation sequence) is extended to transfinite ordinal indices as follows: Let μ be a large countable ordinal such that a fundamental sequence is ...
7
votes
2answers
275 views

Are hyperoperators primitive recursive?

I apologize if this question is too basic. I have read that the Ackerman function is the first example of a computable but NOT primitive recursive function. Hyperoperators seem to be closely related ...
7
votes
2answers
254 views

Power tower inequality

I want to prove the following power tower inequality: $$ 3 \uparrow \uparrow 100 > 4 \uparrow \uparrow 99 $$ but I don't know how to do this. I think that induction will not work, because I think ...
7
votes
3answers
690 views

Algorithm for tetration to work with floating point numbers

So far, I've figured out an algorithm for tetration that works. However, although the variable a can be floating or integer, unfortunately, the variable ...
7
votes
1answer
270 views

Algorithm for comparing the size of extremely large numbers

Is there a simple algorithm to decide which of the numbers $$a \uparrow ^b c \text{ and } d \uparrow ^e f$$ is the bigger one ? Using the hyperoperation, the numbers can be denoted with $$H_{b+2}(...
7
votes
1answer
174 views

Are points on the complex plane sufficient to solve every solvable equation composed of the hyperoperators, their inverses, and complex numbers?

Some background: I'm programming a maths environment. I'm computer science, so please excuse any probable ignorance and lack of precision in my question. It seems $i$ and complex numbers were "...
6
votes
3answers
468 views

Does anything precede incrementation in the operator “hierarchy?”

I here define the hierarchy of basic mathematical operators and their respective "inverse" operation (see hyperoperation). $$ \begin{array}{c|c|c|} & \text{Operator} & \text{"Inverse"} \\ \...
6
votes
2answers
472 views

Ordinal tetration: The issue of ${}^{\epsilon_0}\omega$

So in the past few months when trying to learn about the properties of the fixed points in ordinals as I move from $0$ to $\epsilon_{\epsilon_0}$ I noticed when moving from $\epsilon_n$ to the next ...
6
votes
0answers
308 views

Notation for n-ary exponentiation

We have $n$-ary sums ($\sum$) and products ($\prod$). Is there an $n$-ary exponentiation operator? $$\underset{i=1}{\overset{n}{\LARGE{\text{E}}}}\, x_i = x_1 \text{^} (x_2 \text{^} (\cdots \text{^} (...
5
votes
2answers
842 views

Example $x$, $y$ and $z$ values for $x\uparrow^\alpha y=z$ where $\alpha\in \Bbb R-\Bbb N$

$\uparrow^n$ and $G(n,\cdot,\cdot)$ are notations for hyperoperation. http://en.m.wikipedia.org/wiki/Hyperoperation $n$ is the hyperoperations rank. Can example $x$, $y$ and $z$ values be provided ...
5
votes
3answers
465 views

Is there a notation for the repetition of basic operations?

I mean... multiplication is the repetition of addition: $2*2 = 2+2$ $3*3 = 3+3+3$ exponential is the repetition of multiplication: $2^2 = 2 * 2$ $3^3 = 3*3*3$ .. it is an obvious pattern. I ...
5
votes
2answers
160 views

How fast do iterated exponentiation converge?

Iterated exponentiation is defined by $$x \mapsto x^{x^{x^{\cdot^{\cdot^{\cdot}}}}}$$ or more conveniently, we denote by $^rx$ the expression $\underbrace{x^{x^{\cdot^{\cdot^{\cdot^{x}}}}}}_{r \text{ ...
5
votes
2answers
308 views

Pentation Notation - How does it work? [duplicate]

When going through with learning Grahams number, I got stuck at $$3↑↑↑3$$ Working it through, we have $$3↑3=3^3$$ $$3↑↑3=3^{3^3}=3↑(3↑3)$$ As such, it would appear to me that $$3↑↑↑3=3^{3^{3^3}}=...
4
votes
2answers
277 views

With $f(n) = n!$, what is the least $k$ such that $f^k(\text{googolplex}) > \text{Graham's number}$?

$\text{googolplex} = 10^{(10^{100})}$ Is $\text{googolplex}!$ greater than $\text{Graham's number}$? How would this be proven? If $\text{googolplex}! \le \text{Graham's number}$, (which I expect) ...
4
votes
2answers
577 views

What is the geometric, physical or other meaning of the tetration?

What is the geometric, physical or other meaning of the tetration or more high hyperoperations? Is it exists in general or it has only math concept?
4
votes
1answer
638 views

Where can I learn more about commutative hyperoperations?

I just learned about commutative hyperoperations, and they look interesting. However, the wikipedia page doesn't link to more information. Is there an article or book where I can learn more? I'm ...
4
votes
1answer
189 views

Tighter bounds on the fast growing hierarchy?

Not a dupe of this question, as I'm searching for tighter bounds. We define the fast growing hierarchy for finite values as follows: $$f_k(n)=\begin{cases}n+1,&k=0\\f_{k-1}^n(n),&k>0\end{...
4
votes
1answer
168 views

Comparing up-arrow's

Is it true that $$3\uparrow^{n+1} 3\ >\ n\uparrow^n n $$ holds for every $n\ge 1$ Since $3\uparrow^{n+1}3=3\uparrow ^n 3\uparrow ^n 3$ and $3\uparrow^n3$ is much bigger than $n$ for $n\ge 3$, ...
4
votes
1answer
196 views

If Graham's number used $4$s instead of $3$s, at which $G$ would that number be bigger than Graham's number?

If $3\uparrow \uparrow\uparrow\uparrow3=G_1$, $ \quad G_2=\underbrace{3 \uparrow \ldots\uparrow3}_{G_1 \ \text{times}}, \quad G_3=\underbrace{3 \uparrow \ldots\uparrow3}_{G_2 \ \text{times}}$ , $ \...
4
votes
0answers
311 views

Is there a notation for exponentiation analog to capital-sigma notation Σ for addition and capital pi Π notation for multiplications?

There are the following common notations: Sums: $$\sum_{i=2}^4 i = 2 + 3 + 4 = 9$$ Products: $$\prod_{i=2}^4 i = 2\times 3\times 4 = 24$$ Is there a (theoretical) one for: Exponentiation (...
3
votes
2answers
143 views

Is this a new operation? [duplicate]

I was thinking "What is before addition", and came up with this. This analogy describes it: Addition is to multiplication as [operation] is to addition. On wikipedia it says it is just "1+b". I came ...
3
votes
2answers
116 views

Where does this array-based fast-growing function fall in the fast-growing hierarchy, and how does it compare to TREE(n)?

[See below for a clarification edit and progress thus far] So I have been reading into the "fast-growing hierarchy" of functions, and I devised this (somewhat convoluted) function for generating very ...
3
votes
2answers
368 views

Limit of a hyperpower function

i have a question regarding this class of equations: Let $\gamma(x)=x^x$ Let $\Psi_n(x)=\underbrace{\gamma(x)\circ\gamma(x)\circ\gamma(x)}_n$, such that $\Psi_1(x)=\gamma(x)$ and $\Psi_2(x)=(\gamma\...
3
votes
0answers
77 views

For which n does the nth “hyperoperation number” n[n]n begin with n in base 2?

If $[n]$ denotes the $n$th binary hyperoperation in the sequence $(+,\times,\uparrow,\uparrow\uparrow,...)$, then the following equality is readily verified for $n=1,2,3,4:$ $$n\,[n]\,n\ =\ (n_2...)...
3
votes
0answers
165 views

Order of Recursion?

Define an extended algebraic function $f(a)$ as a function on $a$ that utilizes any combination of recursive extensions and inverses of sequentiation. Example: $a + 1$ , sequentiation. $a + a$, ...
2
votes
2answers
133 views

What can we say about the prime factors of $​^{10}10+23$?

In a video on ultrafinitism I saw a claim that the number $​^{10}10+23$ does not have prime factorization. While I don't accept the premise of ultrafinitism, I got curious, what can we say about the ...
2
votes
2answers
388 views

Integrate $x$ to the power $x$… to the power $x$… infinitely

This came across my mind, integrating $x$ to the power $x$ infinitely, I couldn't find anything on it. $$\Large \int x^{x^{x^{x\,\cdots}}} \, dx$$ How would you go about this?
2
votes
1answer
91 views

Question about $TREE(3)$ and Graham's Number

Lets say: $G=\text{Graham's Number}$. And: $$ \begin{align*} \alpha_1&=G\uparrow^G G, \\ \alpha_2&=\alpha_1\uparrow^{\alpha_1} \alpha_1 \\ &\vdots\\ \beta_1 &= \alpha_G\uparrow^{\...
2
votes
1answer
137 views

Does domination of exponential-factorial by tetration generalize to higher-order hyperoperations?

Let $\star$ be any operation in the sequence of hyperoperations $(\text{Succ},+,\times,\uparrow,\uparrow\uparrow,\ldots)$, and consider the $\star$-factorial function defined as follows on the ...
2
votes
1answer
98 views

Is there a mathematical term, practical application, or area of math that covers a function raised to itself?

Some abstract examples would be: $f(x)^{f(x)}$ or $f(x)^{f(x)^{f(x)...}}$ Actual equations I've attempted to look at can be viewed here on desmos.com There seems to be a pattern of common convergence, ...
2
votes
1answer
228 views

Tetration and Fractions

Recently I discovered Tetration, and was wondering about having tetration with fractional "tetronents", take the example $$^{7/2}3\;\Bbb{or}\;3\uparrow\uparrow{\frac72}$$Initially it seems difficult ...
2
votes
2answers
117 views

Can $10\uparrow^n m<2\uparrow^n (m+2)$ be formally proven?

See here : http://googology.wikia.com/wiki/Arrow_notation for the definition of the up-arrow function. Can $10\uparrow^n m<2\uparrow^n (m+2)$ be formally proven for all $m\ge 1$ and $n\ge 3$ ?...
2
votes
1answer
29 views

Hyperoperation: Why does $H_n(0,b) = 0$ for $n\ge4$, $b$ odd ($\ge -1$)

On the Wikipedia for hyperoperations is says that $H_n(0,b) = 0$ if $n\ge4$, $b$ odd ($\ge -1$). From what I gether, the basic jist of what this is saying is that $0^{0^0}=0$ and from that we can ...
2
votes
1answer
620 views

hyper, super and meta. Meaning vs emphasis?

Various mathematical terms use the following prefixes, which are presumably also morphemes: hyper super meta These have different dictionary definitions, as I ...
2
votes
1answer
228 views

Identities of the Hyperoperation heirarchy [duplicate]

The hyperoperation heirarchy in the naturals starts with addition, then multiplication, then exponentiation, then tetration, and so on. Each operation is defined as repeated application of the ...
2
votes
2answers
157 views

definition of primes for higher hyperoperations

I was reading yesterday when I came across the history of counting. There was some evidence of an early understanding of prime numbers. I thought that I would try changing the definition of primality ...