Technical information on Maple integer representation (for 32-bit). Small positive integers are represented to base 10000, so the square of a value will fit in a machine word.
Large positive integers are represented to base 2^32. The maximum integer representable is about 2^2147483488. It is not arbitrarily large because Maple uses a header that encodes the type and length of data in a single machine word. For 32-bit architectures, the length is encoded in 26 bits. Best wishes, John John Randall wrote: > The long integer quote was for Python. Maple can calculate 3^7830457 in > about a minute. > > Best wishes, > > John > > bill lam wrote: >>>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 >> > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
