• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 simple base conversion formula for tetration JmsNxn Long Time Fellow Posts: 571 Threads: 95 Joined: Dec 2010 09/22/2011, 07:41 PM (This post was last modified: 09/22/2011, 07:44 PM by JmsNxn.) Well I finally decided to look a little deeper at my suggested base conversion, and to my surprise, the formula just popped out at me. given the definition $k \ge 0$: $a\,\,\bigtriangleup_{-k}^e\,\, b = \ln^{\circ k}(\exp^{\circ k}(a) + \exp^{\circ k}(b))$ we see instantly: $e^x\,\,\bigtriangleup_{-k}^e\,\,e^y = e^{x\,\,\bigtriangleup_{-k-1}^e\,\,y}$ which works for k = 0 as well since $\bigtriangleup_{1}^e$ is multiplication. It's easy now to generate a formula which works for base conversion using these operators. The notation for such is very cumbersome however, therefore I'll write it out step by step for 2, 3, 4. $b^b = e^{\ln(b) \cdot e^{\ln(b)}} = e^{e^{\ln(b) + \ln(\ln(b))}} = \,\,^{2+\text{slog}_e(\ln(b) + \ln(\ln(b)))}e$ $b^{b^b} = e^{\ln(b) \cdot e^{\ln(b) \cdot e^{\ln(b)}}} = e^{e^{e^{\ln(b) + \ln(\ln(b))\, \bigtriangleup_{-1}^e \,\ln(\ln(\ln(b)))}}}= \,\,^{3+\text{slog}_e(\ln(b) + \ln(\ln(b)) \bigtriangleup_{-1}^e \ln(\ln(\ln(b))))}e$ and which I think the process becomes obvious by this point $b^{b^{b^{b}}} = \,\,^{4 + \text{slog}_e(\ln(b) + \ln(\ln(b)) \,\bigtriangleup_{-1}^e\, \ln(\ln(\ln(b)))\,\bigtriangleup_{-2}^e\,\ln(\ln(\ln(\ln(b)))))} e$ and which by generality becomes: $^k b = \,\,^{k + \text{slog}_e(\ln(b) + \ln^{\circ 2}(b) \,\bigtriangleup_{-1}^e\,\ln^{\circ 3}(b)\,\bigtriangleup_{-2}^e\,\ln^{\circ 4}(b)\,...\,\bigtriangleup_{-k+1}\,\ln^{\circ k-1}(b)\,\bigtriangleup_{-k+2}^e\,\ln^{\circ k}(b))}e$ where we are sure to evaluate the highest operator first. this formula is very easily generalized to include conversion from base $b > \eta$ to any base $c > \eta$ « Next Oldest | Next Newest »

 Possibly Related Threads... Thread Author Replies Views Last Post Repetition of the last digits of a tetration of generic base Luknik 12 1,644 12/16/2021, 12:26 AM Last Post: marcokrt On the $$2 \pi i$$-periodic solution to tetration, base e JmsNxn 0 336 09/28/2021, 05:44 AM Last Post: JmsNxn Nixon-Banach-Lambert-Raes tetration is analytic , simple and “ closed form “ !! tommy1729 11 4,362 02/04/2021, 03:47 AM Last Post: JmsNxn There is a non recursive formula for T(x,k)? marraco 5 3,129 12/26/2020, 11:05 AM Last Post: Gottfried Complex Tetration, to base exp(1/e) Ember Edison 7 10,309 08/14/2019, 09:15 AM Last Post: sheldonison tommy's simple solution ln^[n](2sinh^[n+x](z)) tommy1729 1 5,201 01/17/2017, 07:21 AM Last Post: sheldonison Recursive formula generating bounded hyper-operators JmsNxn 0 3,333 01/17/2017, 05:10 AM Last Post: JmsNxn Is bounded tetration is analytic in the base argument? JmsNxn 0 3,129 01/02/2017, 06:38 AM Last Post: JmsNxn Extrapolated Faá Di Bruno's Formula Xorter 1 4,544 11/19/2016, 02:37 PM Last Post: Xorter tetration base sqrt(e) tommy1729 2 6,299 02/14/2015, 12:36 AM Last Post: tommy1729

Users browsing this thread: 2 Guest(s)