Author 
Topic: Integral of a factorial function (Read 14072 times) 

howard roark
Full Member
Posts: 241


Integral of a factorial function
« on: Jan 7^{th}, 2009, 5:49pm » 
Quote Modify

What is the integral of a factorial function, say f(n)=n!


IP Logged 



ThudnBlunder
Uberpuzzler
The dewdrop slides into the shining Sea
Gender:
Posts: 4489


Re: Integral of a factorial function
« Reply #1 on: Jan 7^{th}, 2009, 6:35pm » 
Quote Modify

y = n! is just a series of points in the plane. How can it have an integral? However, its generalization y = Gamma(x) is a continuous curve except when x = 0,1,2,3, etc. But even this does not seem to be integrable, at least not by the Online Integrator.


IP Logged 
THE MEEK SHALL INHERIT THE EARTH.....................................................................er, if that's all right with the rest of you.



howard roark
Full Member
Posts: 241


Re: Integral of a factorial function
« Reply #2 on: Jan 7^{th}, 2009, 7:57pm » 
Quote Modify

Actually I want to find asymptotic tight bound for the function Sum(i=1 to n) (i!) That was the reason I asked integral of a factorial....


IP Logged 



Henk
Newbie
Gender:
Posts: 2


Re: Integral of a factorial function
« Reply #3 on: Nov 5^{th}, 2009, 9:25am » 
Quote Modify

Use Euler's integral representation of GAMMA(z), Re(z) > 0, and integrate z under the integral sign. If asked from Maple12: identify( int( GAMMA(x), x = 1 ... 3 ) ) => 4/3 + 2/7*(e + ln( 2 ) )


IP Logged 



SWF
Uberpuzzler
Posts: 879


Re: Integral of a factorial function
« Reply #4 on: Apr 13^{th}, 2012, 6:58pm » 
Quote Modify

To estimate S= n! + (n1)! + (n2)! + ..., integrating gamma(x+1) is not going to work well because the function increases so rapidly with n. Just estimating S by n! may be more accurate than integrating gamma. Since S increases rapidly with n, a good estimate would be to use the largest few terms of S. You can group them by threes by using: m! + (m1)! + (m2)! = m^{2}(m2)! (assuming m>1) S= n! + (n1)^{2}(n3)! + (n4)^{2}(n6)! + (n7)^{2}(n9)! + ... S= n!*{ 1 + (n1)/n/(n2) + (n4)/n/(n1)/(n2)/(n3)/(n5) + (n7)/n/(n1)/(n2)/(n3)/(n4)/(n5)/(n6)/(n8 ) + ... } Each additional term is much less than the last. For small n, make sure not use too many terms or you will get a zero in the denominator.


IP Logged 



