Re: Euler problem #48

by anton@[EMAIL PROTECTED] (Anton Ertl) May 8, 2008 at 10:28 AM

Bernd Paysan <bernd.paysan@[EMAIL PROTECTED]
> writes:
>In Gforth with a 2GHz Athlon64, it takes about
>1.5ms to run 1000t. I guess iForth64 should do it in less than 1ms, even
>when the division for the modulus might be the limiting factor.

If you timed it with the development version of gforth-fast, I doubt
it.  I guesstimate that the program spends more then 1ms on UM/MOD on
your machine.

>&10000000000 Constant mod#
>
>: *mod ( a b -- c )  um* mod# um/mod drop ;

Wasn't there a way to do integer division (and consequently compute
the modulus) by multiplication with the inverse?

- anton
-- 
M. Anton Ertl  http://www.complang.tuwien.ac.at/anton/home.html
comp.lang.forth FAQs: http://www.complang.tuwien.ac.at/forth/faq/toc.html
     New standard: http://www.forth200x.org/forth200x.html
   EuroForth 2008:
http://www.complang.tuwien.ac.at/anton/euroforth/ef08.html