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

Proof:

n = 3 gives 1 ^ b = 1 which is indeed true for any b

Now suppose that for a given n > 2, it is proven that
1 [n] b = 1 (for any b)
Then we wish to prove that
1 [n+1] b = 1 (for any b)

b = 1 :
1 [n+1] 1 = 1 by definition

b > 1:
1 [n+1] b = 1 [n] (1 [n+1] (b - 1)) = 1 because of the induction hypothesis


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

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



Users browsing this thread: 1 Guest(s)