I seem to recall that Pari GP is pretty fast at this sort of thing. I haven't tried it in a while, but it's easly accessible at: http://pari.math.u-bordeaux.fr/ At 05:20 PM 4/23/2011, Dan Asimov wrote:

Maybe I should be more specific.

Mathematica can do a loop of length 10000, say calculating

100*Floor[Mod[(3/2)^k,1]]

for 10001 <= k < 20000,

but when I try to do something like that for a loop of size 100,000 or 1,000,000, it seems to take forever (or hang, I'm not sure which).

--Dan

Sometimes the brain has a mind of its own.