The Logarithm of the Gamma Function over the Complex Plane with a Smooth Principal Value
As an approximation of course (where applicable) done with the Stirling series but that information would have made the header a wee bit too long.
The problem with the Stirling series is that the number of summands depend on the input; there is an ideal number of summands for a given precision. But don’t worry, D.E.G. Hare did all the math for us. Continue reading
A very basic but working big integer implementation
In this episode we will build a basic set of operations, namely addition,
subtraction and multiplication. Division is not needed but will be given,
too, as I am without mercy. Continue reading
This is the first post of what will be a very long series about calculating factorials and it is even a long way to the first calculation of a factorial.
available for free and for money, and the author has a lot of that stuff already written. The last argument is the winning one, of course.
Oh, and: yes, this implementation will be with FFT!