[b][red]This message was edited by DarQ at 2004-2-4 11:20:34[/red][/b][hr]
i just started a week ago coding C, and i love it already! especially the fact that what i code in winNT, can be compiled on my linux box without a problem
But i have a question now to which i haven't found an answer yet.
today i made a thing that finds prime numbers. As the numbers grow larger, the proccess takes longer, but there is a trick for that
The problem now is, that i want to exceed the storage capacity of unsigned longs.. use numbers of about 10 MILLION digits.
now, 10 million might be a bit too much for now, but an unsigned long has certainly not enough digits.
can anyone kick my in the right direction?
NEW url--> http://mark.space.servehttp.com
0 · ·