[Trashman]

Hi!
I need to work with very large numbers, say over 100 digits. C's "unsigned long long" only support 64 bits (2^64). The numbers I need to work with is about 2^257. All digits matter, because I'm trying to prove that the numbers are primes (Mersenne primes). I'm thinking of storing the numbers as strings (as there is no limit on array's - I will need a lot of memory but that is not a problem but I can't figure out how to do the needed math. Help?

[parallax]

If you want a pre-made library for this (it's called "Arbitrary precision"), try GMP or PARI. PARI will do stuff with complex numbers as well (I think).

If you're looking to do it yourself (it's fun), check out ext/bcmath for ideas in the PHP source code. (I think that's the path)