|
Project Information
|
A program that implements an arbitrary-precision integer. Arithmetic operations included: addition, subtraction, multiplication, division, modulo, left shift, and right shift. Integers can be constructed from ints and well formed strings. As a plus we compute the 20th Mersenne prime (a number of the form 2n-1) to push our implementation on correctness with large data. Along with the 20th, we have also computed the 30th Mersenne prime but takes too long to be considered for extra credit. |