Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Hyperoperators [n] basics for large n
#3
(03/06/2011, 08:52 AM)bo198214 Wrote: PS: at a[n]1 = a you should add n>1
Indeed, thanks for checkingSmile

1. a[2]b = a * b

Proof:

For b = 1:
By definition a[2]1 = a = a * 1

If a[2]b = a * b for a given b, then we wish to prove that a[2](b + 1) = a * (b + 1):

a[2](b + 1) = a[1](a[2]b) = a + (a[2]b) = a + (a * b) = a * (b + 1)

So it is proven by induction.


2. a[3]b = a ^ b

Proof:

For b = 1:
By definition a[3]1 = a = a ^ 1

If a[3]b = a ^ b for a given b, then we wish to prove that a[3](b + 1) = a ^ (b + 1):

a[3](b + 1) = a[2](a[3]b) = a * (a[3]b) = a * (a ^ b) = a ^ (b + 1)

So it is proven by induction.
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, 03:19 PM

Possibly Related Threads...
Thread Author Replies Views Last Post
  All Maps Have Flows & All Hyperoperators Operate on Matrices Daniel 0 66 03/14/2020, 06:22 AM
Last Post: Daniel
  Interesting commutative hyperoperators ? tommy1729 0 92 02/17/2020, 11:07 PM
Last Post: tommy1729
  Iteration basics Ivars 27 26,778 01/02/2017, 05:21 PM
Last Post: Xorter
  Logic hyperoperators hixidom 0 1,521 10/14/2015, 08:26 PM
Last Post: hixidom
  Theorem in fractional calculus needed for hyperoperators JmsNxn 5 6,839 07/07/2014, 06:47 PM
Last Post: MphLee
  2 [n] b and 3 [n] b for (large) integer n, b dyitto 2 3,940 03/12/2011, 10:52 PM
Last Post: dyitto
  Hyperoperators Mr. Pig 4 5,625 06/20/2010, 12:26 PM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)