🚀 go-pugleaf

>>>>> jos@and.nl (Jos A. Horsmeier) (JAH) writes:

JAH> In article <wzenrwg142.fsf@stego.cs.ruu.nl>, piet@stego.cs.ruu.nl wrote:
JAH> |>>>>> thecrow@iconn.net (The Crow) (TC) writes:
JAH> |
JAH> |TC> Here is what I am trying to do, I want to find the last NON-ZERO digit
JAH> |TC> of a given factorial. For instance,
JAH> |
JAH> |TC> 5! = 120
JAH> |
JAH> |TC> so the last non-zero digit is 2. I want to be able to do this up to
JAH> |TC> 1000. Problem is, no matter how huge of a data-type you use, there
JAH> |TC> isn't any way for the computer to handle 1000!, it is however possible

JAH> |A little thinking before coding solves this problem very easily:
JAH> |
JAH> |Let N be then number whose factorial you are considering.
JAH> |
JAH> |What you want is the number of trailing zeroes + 1. 

JAH> [ clever solution of not-the-posters-problem deleted ... ]

JAH> No, that's not what he wanted. A little reading before thinking before
JAH> coding may come in handy sometimes ;-) What the original poster wants
JAH> is the value of the rightmost non-zero digit of n!. 

Sorry, I guess that I wrongly interpreted the meaning of the word "find" in
the original question. 
-- 
Piet van Oostrum <piet@cs.ruu.nl>
http://www.cs.ruu.nl/~piet