Hyperoperators [n] basics for large n
#4
3. 2 [n] 2 = 4

Proof:

2 [1] 2 = 2 + 2 = 4

Suppose 2 [n] 2 = 4 for a given n, then we wish to prove that 2 [n+1] 2 is also 4.

2 [n+1] 2 = 2 [n] (2 [n+1] 1) = 2 [n] 2 = 4

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:24 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  Interesting commutative hyperoperators ? tommy1729 3 8,607 12/17/2022, 02:03 PM
Last Post: MphLee
  All Maps Have Flows & All Hyperoperators Operate on Matrices Daniel 0 4,526 03/14/2020, 06:22 AM
Last Post: Daniel
  Logic hyperoperators hixidom 0 5,514 10/14/2015, 08:26 PM
Last Post: hixidom
  Theorem in fractional calculus needed for hyperoperators JmsNxn 5 21,763 07/07/2014, 06:47 PM
Last Post: MphLee
  Hyperoperators Mr. Pig 4 17,004 06/20/2010, 12:26 PM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)