Revision as of 12:12, 16 June 2002 editAxelBoldt (talk | contribs)Administrators44,507 edits +multiplication algorithm link← Previous edit | Revision as of 21:55, 10 January 2003 edit undoJakeVortex (talk | contribs)Extended confirmed users2,058 editsm perl math::bigintNext edit → | ||
Line 1: | Line 1: | ||
A '''bignum''' system in a ] or program allows internal representation of arbitrarily large ]s or arbitrarily precise ]s. Numbers are typically stored as (ratios of) digit lists which can grow using dynamically allocated memory. | A '''bignum''' system in a ] or program allows internal representation of arbitrarily large ]s or arbitrarily precise ]s. Numbers are typically stored as (ratios of) digit lists which can grow using dynamically allocated memory. | ||
First implemented in ], bignum facilities are available in most modern ] and in many other languages (], ], ], ]). The ]/] ] offered bignum facilities as a collection of ]. The ] | First implemented in ], bignum facilities are available in most modern ] and in many other languages (], ], ], ], ]). The ]/] ] offered bignum facilities as a collection of ]. The ] | ||
is a free ] library that offers bignum features. All ]s contain bignum facilities. | is a free ] library that offers bignum features. All ]s contain bignum facilities. | ||
Revision as of 21:55, 10 January 2003
A bignum system in a computer or program allows internal representation of arbitrarily large integers or arbitrarily precise rational numbers. Numbers are typically stored as (ratios of) digit lists which can grow using dynamically allocated memory.
First implemented in MacLISP, bignum facilities are available in most modern LISPs and in many other languages (Java, Perl, Ruby, Python, Squeak). The VAX/VMS operating system offered bignum facilities as a collection of string functions. The GNU Multi-Precision Library is a free C library that offers bignum features. All computer algebra systems contain bignum facilities.
Bignum systems often employ fast multiplication algorithms.