Thread Rating:
  • 3 Vote(s) - 4.33 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Searching for an asymptotic to exp[0.5]
Ok after spending some time looking at the posts I take back most of my criticism. I did not have much time too think or read about this lately.

Btw sheldon edited his posts a few times, which makes them better naturally.

If we are talking in the context of growth approximation , rather than approximation of exp^[1/2] then it turn out my ideas and sheldons are similar and consistant with eachother and by themselves.

the tommy sheldon conjecture

1/a_n = O( exp(n * (ln^[1/2](n))^B ) )

For some real B > 0.

The conjecture made by sheldon that motivates his use of taking the derivative is true.

Hence h_n is justified.

The main difference between sheldon and me is then that i take ln^[1/2] or its " fake " and sheldon uses the h_n.

Although the h_n is more accurate ( since his derivative was justified ) it does not say how fast h_n " grows ".

So its basicly

ln[1/2](n) VS h_n

( I do not yet understand where his second derivative comes from , is this the same logic that goes from a_n to b_n ?? Also his integrals need more study and/or explaination. Forgive me if im a bit behind )

Some remarks first :

Its not so clear that

growth ( f(x) ) <=> growth ( exp^[1/2] ) <=> growth ( a_n )

is an equivalence relationship.
Just to avoid jumping into conclusions.

More importantly , we have encountered h_n before on this forum !
I do not know exactly where and how but I remember it.
That might be usefull.

Another remark of yet to determine value :
We could use the difference operator too :

a_n < exp( exp^[0.5](t_n) - n t_n )

where t_n is the inverse of exp^[1/2](x) - exp[1/2](x-1).


I Consider it important we only looked at

a_n < stuff

But a good boundary means

stuff < a_n < stuff

and the stuff < a_n is not adressed yet ...



ln[1/2](n) VS h_n

take the inverse on both sides

exp^[1/2](n) VS D exp^[1/2](n)

Now the key is too notice :

(exp^[1/2](n))^(1-o(1)) < D exp^[1/2](n) < (exp^[1/2](n))^(1+o(1))

Hence 50 % of the tommy sheldon conjecture has been proven, more specific :

1/a_n < O( exp(n * (ln^[1/2](n))^(1+o(1)) ) )

( B = 1 for the < part )


So it comes down (in part) to finding asymptotics to D exp^[1/2](n).

We know D exp^[1/2](n) = exp^[1/2](n) / ( n^( 1-o(1) ) )

from which the above follows easily.



Messages In This Thread
RE: Searching for an asymptotic to exp[0.5] - by tommy1729 - 05/14/2014, 11:42 PM

Possibly Related Threads...
Thread Author Replies Views Last Post
  Using a family of asymptotic tetration functions... JmsNxn 15 4,624 08/06/2021, 01:47 AM
Last Post: JmsNxn
  Reducing beta tetration to an asymptotic series, and a pull back JmsNxn 2 889 07/22/2021, 03:37 AM
Last Post: JmsNxn
  A Holomorphic Function Asymptotic to Tetration JmsNxn 2 1,329 03/24/2021, 09:58 PM
Last Post: JmsNxn
  An asymptotic expansion for \phi JmsNxn 1 1,153 02/08/2021, 12:25 AM
Last Post: JmsNxn
  Merged fixpoints of 2 iterates ? Asymptotic ? [2019] tommy1729 1 3,552 09/10/2019, 11:28 AM
Last Post: sheldonison
  Another asymptotic development, similar to 2sinh method JmsNxn 0 4,101 07/05/2011, 06:34 PM
Last Post: JmsNxn

Users browsing this thread: 1 Guest(s)