Abstract
Big integers differ from standard integers in that they are of arbitrary size; the number of digits used is limited only by the memory available. In this chapter we look at how big integers are represented in memory and how to perform arithmetic with them. We also discuss some implementations which might be of use when using programming languages that do not support big integers natively. Next we examine rational arithmetic with big integers. Finally, we conclude with some advice on when it might be advantageous to use big integers and rational numbers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Crandall R., Pomerance C., Prime Numbers: a Computational Perspective, Springer (2005).
Comba P., Exponentiation Cryptosystems on the IBM PC. IBM Systems Journal 29, 4:526–536 (1990).
Karatsuba, A., Ofman, Y., Multiplication of Many-Digital Numbers by Automatic Computers, Proceedings of the USSR Academy of Sciences 145: 293–294 (1962). Translation in the academic journal Physics-Doklady, 7, pp. 595–596 (1963).
Schönhage, D., Strassen, V., Schnelle multiplikation grosser zahlen, Computing, 7(3–4), 281–292 (1971).
Saracino D., Abstract Algerbra: A First Course, Addison-Wesley (1980).
Bracewell, R., The Fourier transform and its applications, New York: McGraw-Hill (1986).
Knuth, D., The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley Professional (2014).
Burnikel, C., Ziegler, J., Im Stadtwald, D., Fast recursive division (1998).
Granlund, T., gmp – GNU multiprecision library, Version 6.0.0 (2014).
Barrett, P., Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor, Advances in Cryptology – CRYPTO’ 86. Lecture Notes in Computer Science 263. pp. 311–323 (2006).
Jebelean T., An algorithm for exact division, Journal of Symbolic Computation, volume 15, 169–180 (1993).
Sussman, G. Steele, Jr, G., The First Report on Scheme Revisited, Higher-Order and Symbolic Computation 11 (4): 399–404 (1998).
Abelson, H., Sussman, G., Structure and interpretation of computer programs, 2nd Ed, MIT Press (1996).
Kelsey, R., Clinger, W., Rees, J. (eds.), Revised5 Report on the Algorithmic Language Scheme, Higher-Order and Symbolic Computation, Vol. 11, No. 1, (1998).
Heath T., The Thirteen Books of Euclid’s Elements, 2nd ed. (Facsimile. Original publication: Cambridge University Press, 1925), Dover Publications (1956).
Diffie, W., Hellman, M., New directions in cryptography, Information Theory, IEEE Transactions on, 22(6), 644–654 (1976).
Rivest, R., Shamir, A., Adleman, L., A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21(2), 120–126 (1978).
The PARIÂ Group, PARI/GP version 2.7.0, Bordeaux, 2014, http://pari.math.u-bordeaux.fr/.
Adler C., Kneusel R., Younger, B., Chaos, Number Theory, and Computers, Journal of Computational Physics, 166, 165–172 (2001).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Kneusel, R.T. (2015). Big Integers and Rational Arithmetic. In: Numbers and Computers. Springer, Cham. https://doi.org/10.1007/978-3-319-17260-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-17260-6_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17259-0
Online ISBN: 978-3-319-17260-6
eBook Packages: Computer ScienceComputer Science (R0)