@inproceedings{e58111685d4c4e53bd2e7b29c434e909,

title = "Fast computation of factorials of numbers",

abstract = "Computing products of large numbers has always been a challenging task in the field of computing. One such example would be the factorial Junction. Several methods have been implemented to compute this function. The method discussed here is unique in the sense that the -way the numbers multiplied to compute the factorial is regrouped into a new sequence of numbers, which has at most half as many elements of the original number sequence. When the terms of this new sequence is multiplied together, it yields the result. The cardinality of the new sequence can further be reduced by partitioning. Each element is replaced by additions necessary in order to compute each new term of the sequence. The sequence is computed by using several difference tables that assist in establishing the pattern that determines the sequence. Experiments performed shows that the execution time can be reduced by the algorithm presented.",

keywords = "Difference table, Fast factorial algorithm, Partitioning",

author = "Henry Thompson and Ahmet Ugur",

year = "2004",

language = "English",

isbn = "1932415343",

series = "Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, MSV'04 and Proceedings of the Int. Conference on Algorithmic Mathematics and Comput. Sci., AMCS'04",

pages = "419--422",

editor = "H.R. Arabnia and R. Joshua and I.A. Ajwa and G.A. Gravvanis",

booktitle = "Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, MSV'04 and Proceddings of the Int. Conference on Algorithmic Mathematics and Comput. Sci., AMCS'04",

note = "null ; Conference date: 21-06-2004 Through 24-06-2004",

}