Hostname: page-component-77c89778f8-gq7q9 Total loading time: 0 Render date: 2024-07-16T13:54:25.631Z Has data issue: false hasContentIssue false
  • English
  • Français

Computation of the generalised factorial function

Published online by Cambridge University Press:  09 April 2009

H. E. Doran
H. E. Doran
Affiliation:
Department of Applied Mathematics, University of Sydney
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The generalised factorial function (z; K)! has been defined by Smith White and Buchwald [1] in terms of an infinite product which converges very slowly, about 105 terms being required for four figure accuracy if |z| = 10. A method is given for the computation of (z; k)! for 0 < |z|≦ 10 to four figure accuracy.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 4 , Issue 3 , August 1964 , pp. 342 - 346
Copyright
Copyright © Australian Mathematical Society 1964

References

[1]Smith-White, W. B. and Buchwald, V. T., A generalization of z!, this Journal 4 (1964), 327–341.Google Scholar
[2]Whittaker, E. T. and Watson, G. N., A Course of Modern Analysis, Fourth Edition, Cambridge (1927), p. 127.Google Scholar