>Long integers > These represent numbers in an unlimited range, subject to available >(virtual) memory only. For the purpose of shift and mask operations, a >binary representation is assumed, and negative numbers are represented >in a variant of 2's complement which gives the illusion of an infinite >string of sign bits extending to the left.
This finally gives hint why Maple can compute 2^7830457 much quicker than J. It remained to try 3^7830457 on Maple. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
