Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Hyperoperators [n] basics for large n
#7
6. (a + 1)[n]b > a[n]b


Proof:


For n = 1 & 2 lemma 6 is evident.


Let's assume lemma 6 to be true for a given n > 1.



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

Assume (a + 1) [n+1] b > a [n+1] b for some b > 0

Then we wish to prove that (a + 1) [n+1] (b + 1) > a [n+1] (b + 1)

This is proved by:
(a + 1) [n+1] (b + 1)
= (a + 1) [n] ((a + 1) [n+1] b)
> (a + 1) [n] (a [n+1] b)
> a [n] (a [n+1] b)
= a [n+1] (b + 1)

This proves lemma 6 for n + 1 by induction applied to b.

So lemma 6 also has been proved for all n by induction applied to n.
Reply


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

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



Users browsing this thread: 1 Guest(s)