Page **1** of **1**

### Segmented Sieve

Posted: **Sun Oct 26, 2003 8:48 pm**

by **razibcse**

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

Posted: **Sun Oct 26, 2003 10:04 pm**

by **Sajid**

**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 ?

Posted: **Sun Oct 26, 2003 10:26 pm**

by **Larry**

Use a randomized algorithm.

Posted: **Sun Oct 26, 2003 10:28 pm**

by **Sajid**

**What is the Randomized algorithm? Plz, eXplain.**

Posted: **Thu Oct 30, 2003 3:06 pm**

by **Russell John**

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

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

Posted: **Thu Oct 30, 2003 3:14 pm**

by **Sajid**

**Russell, Thanx , but still its not clear to me. **

Can you give any eXample?

Posted: **Thu Oct 30, 2003 7:07 pm**

by **Maarten**

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