sqrt thingy at MSE
#1
I got inspired by this nested root topic at MSE

https://math.stackexchange.com/questions...tx2-0?rq=1

regards

tommy1729
Reply
#2
Very interesting, thank you!
Recently, I posted another (and maybe easier) question on the same line that I would like to be answered: convergence value of this series.
I suspect that the constant above could be very close to \( e^{\frac{1}{e}} \), but I cannot find the exact value... it would be interesting since it compares (asymptotically) a unitary increment on hyper-2 to a unitary increment on hyper-4.
Let \(G(n)\) be a generic reverse-concatenated sequence. If \(G(1) \notin \{2, 3, 7\}\), then \(^{G(n)}G(n) \pmod {10^d}≡^{G({n+1})}G({n+1}) \pmod {10^d}\), \(\forall n \in \mathbb{N}-\{0\}\)
("La strana coda della serie n^n^...^n", p. 60).
Reply
#3
(08/13/2022, 06:51 PM)marcokrt Wrote: Very interesting, thank you!
Recently, I posted another (and maybe easier) question on the same line that I would like to be answered: convergence value of this series.
I suspect that the constant above could be very close to \( e^{\frac{1}{e}} \), but I cannot find the exact value... it would be interesting since it compares (asymptotically) a unitary increment on hyper-2 to a unitary increment on hyper-4.

Its not an exact proof, but we can take for granted that \(f_m(x):=^{m+1}x-^mx\to\infty\) for \(m\to\infty\) if \(x>e^{\frac{1}{e}}=:\eta\) and \(f_m(x)\to 0\) for \(1<x\le\eta\). Also that it is strictly increasing for each m.
Hence there is an M, such that \(f_M(\eta)<1\) and can not be a solution for all \(x\le \eta\) and \(m\ge M\). 
On the other hand for each \(x_1>\eta\) there is another M such that \(f_m(x)>1\) for all \(x\ge x_1\) and \(m\ge M\).
So for each \(x_2>\eta\) there is an m such that the solution of \(f_m(x)=1\) is in the open interval \((\eta,x_2)\).
So the limit is \(\eta\).
Reply
#4
(08/13/2022, 08:48 AM)tommy1729 Wrote: I got inspired by this nested root topic at MSE

https://math.stackexchange.com/questions...tx2-0?rq=1

regards

tommy1729


Fuck, that's a good thread. I really don't think it's as hard as they're making it though. For the simply reason, you can find constants:



\[

f_n(x-q_n) = g_n(x)\\

\]



Which centers the solution for \(\Re(x) > 0\). Then we can check that, for \(x_n \approx 0\), that:



\[

\sum_{n=0}^\infty |g_n(x_n)| < \infty\\

\]



Because:



\[

\sum_{n=0}^\infty |g'_n(x)|< \infty

\]



This tells us that \(g_n(x_n)\) converges; which casts a net of values about \(0\). It won't be a neighborhood. But instead it'll mean that: The function \(g(x)\) is real analytic, and probably holomorphic for \(\Re(x) > 0\). I think the fact no one in this thread is mentioning that, is something crucial to the problem. I could go into detail on why this converges, but it would require me explaining about 3 years worth of infinite compositions.
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  Computing sqrt 2 with rational functions. tommy1729 0 2,332 03/31/2023, 11:49 AM
Last Post: tommy1729
  sqrt(!) and sqrt(exp) Kouznetsov 4 15,172 06/08/2022, 05:32 AM
Last Post: Catullus
  Inspired by the sqrt tommy1729 0 5,141 02/13/2017, 01:11 AM
Last Post: tommy1729
  tetration base sqrt(e) tommy1729 2 10,832 02/14/2015, 12:36 AM
Last Post: tommy1729
  [2014] sqrt boundary tommy1729 0 5,378 06/19/2014, 08:03 PM
Last Post: tommy1729
  Crazy conjecture connecting the sqrt(e) and tetrations! rsgerard 7 30,570 03/27/2014, 11:20 PM
Last Post: tommy1729
  regular tetration base sqrt(2) : an interesting(?) constant 2.76432104 Gottfried 7 29,229 06/25/2013, 01:37 PM
Last Post: sheldonison
  regular iteration of sqrt(2)^x (was: eta as branchpoint of tetrational) JmsNxn 5 20,482 06/15/2011, 12:27 PM
Last Post: Gottfried
  Regular slog for base sqrt(2) - Using z=2 jaydfox 13 44,306 03/10/2010, 12:47 PM
Last Post: Gottfried



Users browsing this thread: 2 Guest(s)