Add tail recursive version of the factorial function

[enimiste]

This version doesn't causes the StackOverflowException when n is big Long type is used in the return type to avoid int overflow with big multiplications.