Tilted Forum Project Discussion Community - View Single Post

wombatman · 03-12-2005, 05:34 PM

I'm trying to factor a large (193 digit) number into 2 prime factors. And I'd like to try to use the sieve method to speed this up. Unfortunately, I can't initialize a BigInteger array to a large enough size to do this. Can anyone help me come up with a way around this? As it is, I'm just looping through, adding/subtracting 2 every time, checking whether the new number is prime, and seeing if it divides evenly into the main number (the 193 digit one).

Thanks a ton.

03-12-2005, 05:34 PM	#1 (permalink)
wombatman Insane	[java]Question with the BigInteger class I'm trying to factor a large (193 digit) number into 2 prime factors. And I'd like to try to use the sieve method to speed this up. Unfortunately, I can't initialize a BigInteger array to a large enough size to do this. Can anyone help me come up with a way around this? As it is, I'm just looping through, adding/subtracting 2 every time, checking whether the new number is prime, and seeing if it divides evenly into the main number (the 193 digit one). Thanks a ton.