Re: [math-fun] How can I accurately calculate (p/q)^n mod 1, for large n

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.