Lesson plan

Hyperoperation

In mathematics, the hyperoperation sequence is an infinite sequence of arithmetic operations (called hyperoperations in this context) that starts with a unary operation (the successor function with ). The sequence continues with the binary operations of addition ( ), multiplication ( ), and exponentiation ( ). After that, the sequence proceeds with further binary operations extending beyond exponentiation, using right-associativity. For the operations beyond exponentiation, the -th member of this sequence is named by Reuben Goodstein after the Greek prefix of suffixed with -ation (such as tetration ( ), pentation ( ), hexation ( ), etc.) and can be written using arrows in Knuth's up-arrow notation. Each hyperoperation may be understood recursively in terms of the previous one by: a[n]b = \underbrace{a[n-1](a[n-1](a[n-1](\cdots a[n-1](a[n-1](a[n-1]a))\cdots)))}_{\displaystyle b \mbox{ copies of } a},\quad n \ge 2 It may also be defined according to the recursion rule part of the definition, as in Knuth's up-arrow version of the Ackermann function: a[n]b = a[n-1]\left(a[n]\left(b - 1\right)\right),\quad n \ge 1 This can be used to easily show numbers much larger than those which scientific notation can, such as Skewes's number and googolplexplex (e.g.…

Back to article

Article summary

In mathematics, the hyperoperation sequence is an infinite sequence of arithmetic operations (called hyperoperations in this context) that starts with a unary operation (the successor function with ). The sequence continues with the binary operations of addition ( ), multiplication ( ), and exponentiation ( ). After that, the sequence proceeds with further binary operations extending beyond exponentiation, using right-associativity. For the operations beyond exponentiation, the -th member of this sequence is named by Reuben Goodstein after the Greek prefix of suffixed with -ation (such as tetration ( ), pentation ( ), hexation ( ), etc.) and can be written using arrows in Knuth's up-arrow notation. Each hyperoperation may be understood recursively in terms of the previous one by: a[n]b = \underbrace{a[n-1](a[n-1](a[n-1](\cdots a[n-1](a[n-1](a[n-1]a))\cdots)))}_{\displaystyle b \mbox{ copies of } a},\quad n \ge 2 It may also be defined according to the recursion rule part of the definition, as in Knuth's up-arrow version of the Ackermann function: a[n]b = a[n-1]\left(a[n]\left(b - 1\right)\right),\quad n \ge 1 This can be used to easily show numbers much larger than those which scientific notation can, such as Skewes's number and googolplexplex (e.g.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.