Divisibility and Arithmetic
Samuel S. Wagstaff
Abstract
Samuel S. Wagstaff
Abstract
This chapter concerns the simplest part of number theory, which is the study of integers or whole numbers. We also tell how to perform arithmetic with the very large integers used in cryptography. The reader may consult one of the many excellent number theory texts such as [ 78 ], [ 98 ] or [ 51 ] for more details or alternate proofs. The text by Rosen [ 99 ] has the same computational flavor as this book.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This chapter concerns the simplest part of number theory, which is the study of integers or whole numbers. We also tell how to perform arithmetic with the very large integers used in cryptography. The reader may consult one of the many excellent number theory texts such as [ 78 ], [ 98 ] or [ 51 ] for more details or alternate proofs. The text by Rosen [ 99 ] has the same computational flavor as this book.
Key concepts: Divisibility rule, Arithmetic, Mathematics, Computer science, Discrete mathematics