Article View: comp.lang.pascal.misc
Article #11Re: Tough FACTORIAL math problem...
From: Dik T. Winter
Date: Sun, 25 Feb 1996 01:46
Date: Sun, 25 Feb 1996 01:46
24 lines
1533 bytes
1533 bytes
In article <188178796wnr@thermoteknix.co.uk> alasdair@thermoteknix.co.uk writes: You should be a bit more careful about placing smileys. > > A more interesting problem would be to generalise this > and seek the rightmost non-zero digit of n! in base b > for arbitrary n and b>2 ;-). > > Thoughts anyone? Indeed, an interesting question. You first of course have to factorize your base in order to make it efficient. But factorization is, eh..., difficult. (Oh, well, as long as the base is less than 60 decimal digits, the factorization will only take a few minutes, but as the base grows...) > > I guess for a really general problem we should > allow n real - last digit of Gamma(0.5)... Yes. I programmed that a few years ago. The program is still running, but I hope it will finish in due time. I could try to find the billionth digit. Does that count? -- dik t. winter, cwi, kruislaan 413, 1098 sj amsterdam, nederland, +31205924098 home: bovenover 215, 1025 jn amsterdam, nederland; http://www.cwi.nl/~dik/
Technical Details
Message-ID:
<DnB690.66v@cwi.nl>Path:
arc1-ca.pugleaf.net!cwi.nl!dikReferences:
<4gbsir$opr@axl02it.ntc.nokia.com> <4gintg$1f7@antares.dfma.com> <188178796wnr@thermoteknix.co.uk>Show Full Headers
Complete Article Headers
Newsgroups: comp.lang.pascal.misc,comp.lang.c++,comp.lang.c,comp.lang.pascal.borland Path: arc1-ca.pugleaf.net!cwi.nl!dik From: dik@cwi.nl (Dik T. Winter) Subject: Re: Tough FACTORIAL math problem... Message-ID: <DnB690.66v@cwi.nl> Sender: news@cwi.nl (The Daily Dross) Nntp-Posting-Host: chrysant.cwi.nl Organization: CWI, Amsterdam References: <4gbsir$opr@axl02it.ntc.nokia.com> <4gintg$1f7@antares.dfma.com> <188178796wnr@thermoteknix.co.uk> Date: Sun, 25 Feb 1996 01:46:12 GMT