# Computing Non-zero End Digits of Large Factorials [closed]

Any large factorial will have a number of zero behind it, and one could write an expression to compute the number of trailing zeros, but how would one go about computing the non-zero end digits?

E.g. compute first 5 non-zero end digits of (10^12)!

-

## closed as too localized by Igor Rivin, Matthew Daws, Kevin O'Bryant, Felipe Voloch, Emil JeřábekNov 9 '11 at 18:18

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center. If this question can be reworded to fit the rules in the help center, please edit the question.

Not a research level question, voting to close. –  Igor Rivin Nov 9 '11 at 14:13
Indeed not research level, though it does lead to the $p$-adic Gamma function (here with $p=5$). –  Noam D. Elkies Nov 9 '11 at 14:18
Computing the first 5 non-zero end digits of (10^12)! is Project Euler problem 160. Clearly this kind of cheating shouldn't be encouraged. –  Guntram Nov 9 '11 at 16:16

This will be the least complete answer I've ever posted, but perhaps somebody else will be able to add to it. Not a complete answer (because I don't find any paper online), but I've heard Jean-Marc Deshouillers speak on his (with others, but I don't recall with whom) proof that the last non-zero base-$p$ digit of $n!$ forms a $q$-automatic sequence. I don't recall the hypothesis on $p$, nor the connection between $p$ and $q$.