It’s all a matter of adequate storage and algorithms to treat numbers as smaller parts. Let’s assume you have a compiler in which an int can only be 0 through 99 and you want to handle numbers up to 999999 (we’ll only worry about positive numbers here to keep it simple). You do that by … Read more
While looking for an big integer library for an ElGamal crypto implementation I tested several libraries with the following results: I recommend this one: Tom Wu’s jsbn.js (http://www-cs-students.stanford.edu/~tjw/jsbn/) Comprehensive set of functions and fast Leemon Baird’s big integer library (http://www.leemon.com/crypto/BigInt.js) Comprehensive set of functions and pretty fast BUT: Negative number representation is buggy! bignumber.js (https://github.com/MikeMcl/bignumber.js) … Read more
A fun challenge. 🙂 I assume that you want integers of arbitrary length. I suggest the following approach: Consider the binary nature of the datatype “int”. Think about using simple binary operations to emulate what the circuits in your CPU do when they add things. In case you are interested more in-depth, consider reading this … Read more
You can use the BigInteger class for integers and BigDecimal for numbers with decimal digits. Both classes are defined in java.math package. Example: BigInteger reallyBig = new BigInteger(“1234567890123456890”); BigInteger notSoBig = new BigInteger(“2743561234”); reallyBig = reallyBig.add(notSoBig);