Tetration convergence
#1
\[(1+a)^n = \sum_{k=0}^n {n \choose k}a^k \]

Consider the following transseries


\[\text{Let } n=\;^{m-1}(1+a) \text{ with } a\in\mathbb{N}\]

\[^m(1+a) =(1+a)^{(^{m-1}(1+a))} = \sum_{k=0}^{^{m-1}(1+a)} {{^{m-1}(1+a)} \choose k}a^k\]

\[{{^{m-1}(1+a)} \choose k} = 0 \text{ for } ^{m-1}(1+a)>k\]

\[\text{Thus } ^m(1+a) \text{ is convergent.}\]
Daniel
Reply


Messages In This Thread
Tetration convergence - by Daniel - 04/24/2023, 12:05 PM
RE: Tetration convergence - by tommy1729 - 04/25/2023, 09:59 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  Flow and convergence Daniel 3 4,182 03/03/2023, 01:17 PM
Last Post: tommy1729
  Iterated function convergence Daniel 1 4,168 12/18/2022, 01:40 AM
Last Post: JmsNxn
  Integer tetration and convergence speed rules marcokrt 5 20,870 12/21/2011, 06:21 PM
Last Post: marcokrt
  What is the convergence radius of this power series? JmsNxn 9 37,908 07/04/2011, 09:08 PM
Last Post: JmsNxn
  Nowhere analytic superexponential convergence sheldonison 14 52,609 02/10/2011, 07:22 AM
Last Post: sheldonison
  using the sum , hoping for convergence tommy1729 4 15,761 08/28/2010, 12:10 PM
Last Post: tommy1729



Users browsing this thread: 1 Guest(s)