Well, here I am with another C oriented question. To put it simply, what if an unsigned long long int data type just isn't enough? If you want a specific example of why I need this;

 

I made a program that generates Fibonacci Numbers. You can input how many numbers you want generated. Unfortunately, I can't generate more than 94 of them, because then the numbers are just too big for the data type to remember. How can I get around that? I know it must be possible, otherwise how could we know for example that the biggest prime number (yet found I mean) is [math]2^{32,582,657}-1[/math]?

 

Thanks in advance for any help

C does not naturally support large integer numbers, as far as I know. So you either have to write the structures for large integers yourself, get some module doing that from the internet or switch to a programming language that supports large integers.

Ok, thanks.

 

Any links for the modules, while I'm at it?

http://gmplib.org/

 

 

or take a look at some of the stuff here - http://www.google.co.uk/search?q=C+precision+number+library&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a

Thanks