Segmented Sieve

razibcse · Post by **razibcse** » Sun Oct 26, 2003 8:48 pm

I found that segmented sieve can be used to find large primes and it's more time & space efficient than the conventional one...but I didn't find any implementation or explanation...can somebody explain this method to me please...

Razib

Sajid · Post by **Sajid** » Sun Oct 26, 2003 10:04 pm

Sieve is efficient, but for soo much prime numbers generation. it may exceeded memory limit, isnt it?

so, what will I do for generate primes for very very large numbers ?

Larry · Post by **Larry** » Sun Oct 26, 2003 10:26 pm

Use a randomized algorithm.

Sajid · Post by **Sajid** » Sun Oct 26, 2003 10:28 pm

What is the Randomized algorithm? Plz, eXplain.

Russell John · Post by **Russell John** » Thu Oct 30, 2003 3:06 pm

Sajid wrote:What is the Randomized algorithm? Plz, eXplain.

Randomized algorithm: any algorithm that makes some random (or pseudorandom) choices.

Sajid · Post by **Sajid** » Thu Oct 30, 2003 3:14 pm

Russell, Thanx , but still its not clear to me.
Can you give any eXample?

Maarten · Post by **Maarten** » Thu Oct 30, 2003 7:07 pm

Check out for example, the Rabin test, or Lehmer's primality test (use google)