100000x | (5x^24999) %~ (2x^99994) %~ !100000x
Granted, !100000x is large, but it's something shy of 1 million
digits. After calculating the factorial (which takes about 15 minutes
as a standalone operation) shouldn't the divisions and residue be
fairly straightforward/not memory hungry?
Or is it just a coincidence that I happen to have found, that !100000x
will barely fit in memory, and the extra operations tip it over the
edge?
regards,
Geoff
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
