Thread Rating:
• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Constructing the "analytical" formula for tetration. mike3 Long Time Fellow Posts: 368 Threads: 44 Joined: Sep 2009 02/10/2011, 04:20 AM (This post was last modified: 02/10/2011, 04:31 AM by mike3.) (01/28/2011, 09:12 PM)mike3 Wrote: Then, the not-quite-symbolic but still "explicit" and "non-recursive" formula is $a_n = \sum_{j=1}^{2^{n-2}} \prod_{k=1}^{(\mathrm{number\ of\ 1\ bits\ in\ }2^{n-1} + 2j - 1)} r_{(\mathrm{position\ of\ }k\mathrm{th\ 1\ bit\ in\ }2^{n-1} + 2j - 1\mathrm{,\ with\ the\ LSB\ counted\ as\ position\ 1}),(\mathrm{if\ }k-1 > 0\mathrm{,\ position\ of\ }k-1\mathrm{th\ 1\ bit\ in\ }2j - 1\mathrm{,\ with\ the\ LSB\ counted\ as\ position\ 1,\ otherwise\ 1})}$. I just came up with a symbolic form for this formula. It may not be the best (the "nth one bit's index" translations may not be the most "elegant" possible), but at least it gives the result. $a_n = \sum_{j=1}^{2^{n-2}} \prod_{k=1}^{\left(2j -\ \sum_{i=1}^{\lfloor\log_2(2j - 1)\rfloor} \lfloor\frac{2j - 1}{2^i}\rfloor\right)} r_{\left(1 +\ \sum_{i=0}^{\lfloor\log_2(2^{n-1} + 2j - 1)\rfloor}\mathbf{1}_{\{\nu \in \mathbb{N}_0: \nu < k\}}\left(\sum_{s=0}^{i} \frac{1 - (-1)^{\lfloor\frac{2^{n-1} + 2j - 1}{2^s}\rfloor}}{2}\right)\right),\left(1 +\ \sum_{i=0}^{\lfloor\log_2(2j - 1)\rfloor}\mathbf{1}_{\{\nu \in \mathbb{N}_0: \nu < k-1\}}\left(\sum_{s=0}^{i} \frac{1 - (-1)^{\lfloor\frac{2j - 1}{2^s}\rfloor}}{2}\right)\right)}$. Letting $r_{n, m} = \frac{u^{n-1}}{1 - u^{n-1}} \frac{m!}{n!} \left{{n \atop m}\right}$, we now have $\chi_n = a_n$, thus an explicit, non-recursive formula for the coefficients of the regular Schroder function of the decremented exponential. However, as can be seen, this formula looks to be far too complicated and too general to be of any use in and of itself. However, it shows (or at least it will once the rigorous proof is complete!) that an explicit formula exists. The big question now is, is there a simpler one? Note that this can be used to derive an explicit formula for the Lagrange inversion formula, thus we can plug all that together to get the fully-explicit, non-recursive formula for the coefficients of the regular inverse Schroder function of the decremented exponential, and so a fully-explicit, non-recursive formula for the coefficients of the Fourier series regular superfunctions of the exponential. But plugging together all those substitutions in this form is just a horrid nightmare. Yet if this monster formula exists, then it would seem likely that a simpler one does, too, considering how general this is. I got this by plugging in the following formulas: $\mathrm{number\ of\ 1\ bits\ in\ }N = N -\ \sum_{i=1}^{\lfloor\log_2(N)\rfloor} \lfloor\frac{N}{2^i}\rfloor$ $\mathrm{position\ of\ }k\mathrm{th\ 1\ bit\ in\ }N\mathrm{,\ with\ the\ LSB\ counted\ as\ position\ 1} =\ \sum_{i=0}^{\lfloor\log_2(N)\rfloor} \mathbf{1}_{\{\nu \in \mathbb{N}_0 : \nu < k}}\left(\sum_{s=0}^{i} \frac{1 - (-1)^{\lfloor\frac{N}{2^s}\rfloor}}{2}\right)$. Also, note that the sth bit of N, with s = 0 being the LSB, is $\frac{1 - (-1)^{\lfloor\frac{N}{2^s}\rfloor}}{2}$. « Next Oldest | Next Newest »

 Messages In This Thread Constructing the "analytical" formula for tetration. - by mike3 - 01/17/2011, 01:05 PM RE: Constructing the "analytical" formula for tetration. - by Gottfried - 01/17/2011, 10:10 PM RE: Constructing the "analytical" formula for tetration. - by mike3 - 01/22/2011, 04:00 AM RE: Constructing the "analytical" formula for tetration. - by Gottfried - 01/24/2011, 08:56 AM RE: Constructing the "analytical" formula for tetration. - by mike3 - 01/28/2011, 03:12 AM RE: Constructing the "analytical" formula for tetration. - by Gottfried - 01/28/2011, 02:49 PM RE: Constructing the "analytical" formula for tetration. - by mike3 - 01/28/2011, 09:12 PM RE: Constructing the "analytical" formula for tetration. - by Gottfried - 01/28/2011, 10:42 PM RE: Constructing the "analytical" formula for tetration. - by mike3 - 01/29/2011, 12:10 AM RE: Constructing the "analytical" formula for tetration. - by mike3 - 02/10/2011, 04:20 AM RE: Constructing the "analytical" formula for tetration. - by sheldonison - 02/10/2011, 05:59 AM RE: Constructing the "analytical" formula for tetration. - by mike3 - 02/10/2011, 07:35 AM RE: Constructing the "analytical" formula for tetration. - by tommy1729 - 01/23/2011, 10:59 PM RE: Constructing the "analytical" formula for tetration. - by mike3 - 01/24/2011, 04:34 AM

 Possibly Related Threads... Thread Author Replies Views Last Post Constructing real tetration solutions Daniel 4 929 12/24/2019, 12:10 AM Last Post: sheldonison Recursive formula generating bounded hyper-operators JmsNxn 0 1,710 01/17/2017, 05:10 AM Last Post: JmsNxn Extrapolated Faá Di Bruno's Formula Xorter 1 2,408 11/19/2016, 02:37 PM Last Post: Xorter on constructing hyper operations for bases > eta JmsNxn 1 3,006 04/08/2015, 09:18 PM Last Post: marraco Explicit formula for the tetration to base $$e^{1/e}$$? mike3 1 3,259 02/13/2015, 02:26 PM Last Post: Gottfried Number theoretic formula for hyper operators (-oo, 2] at prime numbers JmsNxn 2 4,356 07/17/2012, 02:12 AM Last Post: JmsNxn fractional iteration by schröder and by binomial-formula Gottfried 0 2,776 11/23/2011, 04:45 PM Last Post: Gottfried simple base conversion formula for tetration JmsNxn 0 3,481 09/22/2011, 07:41 PM Last Post: JmsNxn Change of base formula using logarithmic semi operators JmsNxn 4 8,532 07/08/2011, 08:28 PM Last Post: JmsNxn Breaking New Ground In The Quest For The "Analytical" Formula For Tetration. mike3 5 9,128 05/09/2011, 05:08 AM Last Post: mike3

Users browsing this thread: 1 Guest(s)