@ram
I wanted a rematch >_<
you know that there are sequence of numbers and recursive algorithms
that always match to primes, with certain parameters. I think that's a
better way to get primes faster, the time to get the next prime would
be near to O(c). In fact I tried one of those, but because this series
don't give all the primes (they skip) it reached overflow very quickly
(around the third second).
And if what you said is becuase the weird look of my last code,
actually is something to don't touch, it can't be improved, only
replaced with something better.
If you like the challenges, you can try { http://www.topcoder.com/ },
join and visit the arena.
@CK
you said you were doing an algorithm too, what do you think of using
Sophie Germain numbers, or Fermat numbers? I think we will need to use
a code for long number computation, but you have to say if the
challenge is worth of it.
