I was working on calculating prime pairs, but I have reached a cap. Using integer, and even with long, Java won't reach the length that I want (infinity!)
I do realize that this is very CPU intensive, but that's beside the point (I can just have the prog run on the CS lab machines for days in the background). What I'm asking, is there a Java class that will support numbers larger than that, to theoretically infinite size? Or do I have to define my own class, linking together series of digits and dividing/moding them in sequence? Am I overlooking some obvious Java util class?
Thanks,
Josh
I do realize that this is very CPU intensive, but that's beside the point (I can just have the prog run on the CS lab machines for days in the background). What I'm asking, is there a Java class that will support numbers larger than that, to theoretically infinite size? Or do I have to define my own class, linking together series of digits and dividing/moding them in sequence? Am I overlooking some obvious Java util class?
Thanks,
Josh