Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
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 0 25 02/17/2020, 11:07 PM
Last Post: tommy1729
  Iteration basics Ivars 27 26,056 01/02/2017, 05:21 PM
Last Post: Xorter
  Logic hyperoperators hixidom 0 1,481 10/14/2015, 08:26 PM
Last Post: hixidom
  Theorem in fractional calculus needed for hyperoperators JmsNxn 5 6,662 07/07/2014, 06:47 PM
Last Post: MphLee
  2 [n] b and 3 [n] b for (large) integer n, b dyitto 2 3,868 03/12/2011, 10:52 PM
Last Post: dyitto
  Hyperoperators Mr. Pig 4 5,478 06/20/2010, 12:26 PM
Last Post: bo198214



Users browsing this thread: 1 Guest(s)