Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
slog(superfactorial(x)) = ?
Define the superfactorial as superfactorial(x) = super!(x) and
super!(x+1) = factorial(super!(x)) = super!(x)!

Where the factorial is computed from the gamma function and super!(-oo) = 2 and super!(0) = 3.

Now I wonder how slog(super!(x)) looks like for large real x ?
We know from basechange and the fact that gamma grows faster than exp that slog(super!(x)) must be strictly increasing for x > y for some real y.

I wonder how fast this is.
Could it be O(x/ln(x)) ? or O(ln(x) sqrt(x)) ?
I have no theoretical reasons to assume anything apart from lim sup slog(super!(x)) < 2x.

I could make up some arguments for this or that based upon asymptotics of gamma , but formal analysis instead of dubious arguments seems not easy.

There are superfunctions known of the factorial but we only need integer iterations for the general behaviour ... on the other hand maybe the other values are needed in some proof ...

I wonder what you guys think.

I was thinking about a plot , but im not sure how we do this since superfactorial grows faster than tetration !!

Maybe this requires some sort of ' simplify ' ( as math apps and books call it ) *command* towards slog(super!(x)) for which i have no idea how to do it.

It looks a bit like basechange , but to me it looks harder.

I think this is intresting because it might learn us alot about iteration in general and slog in particular.


(11/14/2012, 08:30 PM)tommy1729 Wrote: Define the superfactorial as superfactorial(x) = super!(x) and
super!(x+1) = factorial(super!(x)) = super!(x)!
Hey Tommy,
Interesting question, I'll post more later. The fixed point=2, super! has a well defined schroder and inverse schroder function. I think it comes down to how big is and it seems like its not going to be that much bigger than . So should converge to a constant for integer values of n. I would expect a constant plus a 1-cyclic function real values of n.
updateThe , for large enough x, the log(x) multiplier term becomes arbitrarily accurate. .

The important thing is that slog((x+1)log(x)), if x is big enough, approaches arbitrarily close slog(x), so slog(super!(n))-n approaches a constant as n increases.
- Sheldon
Lim x-> +oo slog(super!(x)) < x(1+eps).

The reason is gamma(x) grows slower than exp(sexp(slog(x)+eps)).

Thus Lim x-> +oo [slog(super!(x))-x]/x = 0

However statements as slog(super!(x)) = x + O(ln(x)) are still mysterious.

I guess slog(super!(x)) = x + O(sqrt(slog(x log(x)))).

Although my guess looks strong , sheldon's statement is even stronger : slog(super!(x)) = x + O(1).

In other words , Im not convinced yet ...


Sheldon is right.

This follows from the " growth rate " insights recently discovered (posts around may 2014).

I agreed with him for much longer but forgot to reply that.

So for completeness and avoiding confusion , my reply now.




Possibly Related Threads…
Thread Author Replies Views Last Post
Question Slog(Exponential Factorial(x)) Catullus 17 442 Yesterday, 02:03 PM
Last Post: tommy1729
Question Slog(e4) Catullus 0 71 06/16/2022, 03:27 AM
Last Post: Catullus
  A support for Andy's (P.Walker's) slog-matrix-method Gottfried 4 5,639 03/08/2021, 07:13 PM
Last Post: JmsNxn
  Some slog stuff tommy1729 15 26,146 05/14/2015, 09:25 PM
Last Post: tommy1729
  A limit exercise with Ei and slog. tommy1729 0 3,704 09/09/2014, 08:00 PM
Last Post: tommy1729
  A system of functional equations for slog(x) ? tommy1729 3 8,784 07/28/2014, 09:16 PM
Last Post: tommy1729
  [stuck] On the functional equation of the slog : slog(e^z) = slog(z)+1 tommy1729 1 4,932 04/28/2014, 09:23 PM
Last Post: tommy1729
  A simple yet unsolved equation for slog(z) ? tommy1729 0 3,483 04/27/2014, 08:02 PM
Last Post: tommy1729
  A kind of slog ? C + SUM f_n(x) ln^[n](x) ? tommy1729 1 4,627 03/09/2013, 02:46 PM
Last Post: tommy1729
  tetration base conversion, and sexp/slog limit equations sheldonison 44 99,935 02/27/2013, 07:05 PM
Last Post: sheldonison

Users browsing this thread: 1 Guest(s)