# A New Method for Fast Computation of Factorials of Numbers

### Journal Name:

- Balkan Journal of Mathematics

### Publication Year:

- 2013

Author Name |
---|

### REFERENCES

[1] Cormen, T. H., Leiserson, C.E., Rivest, R. L., Stein, C., “Introductions to algorithms”, 2nd Ed.,

The MIT Press, 2001, Printed and bound in the United States of America.ISBN 0-262-03293-7

(hc.: alk. Paper, MIT Press).ISBN 0-07-013151-1 (McGraw-Hill).

[2] N. L. Biggs, (1979) “The roots of combinatorics, Historia Math. 6”, pp. 109−136.

[3] Higgins, Peter (2008), “Number Story: From Counting to Cryptography”, New York: Copernicus,

p.p 12, ISBN 978-1-84800-000-1 says Krempe though.

[4] Peter Borwein. "On the Complexity of Calculating Factorials". Journal of Algorithms 6,

[5] Sedgewick, R., (1992) “Algorithms in C++”. Addison-Wesley.

[6] Ugur, A.;Thompson, H., “The p-sized partitioning algorithm for fast computation of factorials of

numbers”, The Journal of Supercomputing, 38(1)/October, 2006, pp. 73-82.

[7] BoitenA. (1992) “Factorisation of the factorial-An example of inverting the flow of computation”.

Periodica Polytechnica Ser El Eng 35(2):pp. 77–99.

[8] Peter Luschny, Fast Factorial Functions, http://www.luschny.de/math/factorial/FastFactorial

Functions.htm, [Accessed: 21.07.2011].

[9] Albahari, J, Albahari, B., “C# 4.0 In a Nutshell”, 4th Ed., O’Reilly Media, 2010,

ISBN: 978-0-596-80095-6.