Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Hyperoperators [n] basics for large n
#1
Hyperoperators [n] basics for large n

We could inductively define hyperoperators as follows:

a, b, n being positive integers:

a[1]b := a + b
n > 1 -> a[n]1 := a
a[n+1](b + 1) := a[n](a[n+1]b)

From this some lemmas can be proven:

1. a[2]b = a * b
2. a[3]b = a ^ b
3. 2[n]2 = 4
4. n > 2 -> 1[n]b = 1
5. a > 1 -> a[n](b + 1) > a[n]b
6. (a + 1)[n]b > a[n]b
7. ((a > 2 or b > 2) and a > 1 and b > 1) -> a[n+1]b > a[n]b

8.
1 < a < b
c = rounded up to integer
m > 0, k >= 0
Then: a [4] m >= c * (b + k) -> a [4] (m + k + 1) >= b [4] (k + 2)


Is this the common definition here?

Have proofs been given somewhere for the lemmas?
I wrote them down long time ago, and I was about to do it again before I discovered this forum.Smile

[edit]Some minor corrections made in this post[/edit]
Reply


Messages In This Thread
Hyperoperators [n] basics for large n - by dyitto - 03/06/2011, 01:20 AM

Possibly Related Threads...
Thread Author Replies Views Last Post
  Iteration basics Ivars 27 23,992 01/02/2017, 05:21 PM
Last Post: Xorter
  Logic hyperoperators hixidom 0 1,363 10/14/2015, 08:26 PM
Last Post: hixidom
  Theorem in fractional calculus needed for hyperoperators JmsNxn 5 6,193 07/07/2014, 06:47 PM
Last Post: MphLee
  2 [n] b and 3 [n] b for (large) integer n, b dyitto 2 3,656 03/12/2011, 10:52 PM
Last Post: dyitto
  Hyperoperators Mr. Pig 4 5,118 06/20/2010, 12:26 PM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)