Is there any way to find prime number upto 10^9 or more in 1 second?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Is there any way to find prime number upto 10^9 or more in 1 second?
Name |
---|
Yes. It can be easily using Meisell-Lehmer algorithm to calculate the numbers of prime up to n in O(n^{2/3}).
or you can see F.Four Divisors.
I don't know much about this algorithm. Can you make a tutorial about it please ?
Yeap. Lehmer_algorithm or Efficient Prime Counting with the Meissel-Lehmer Algorithm
Updated blog link ( previous one doesn't work ) :
Efficient prime counting with the Meissel-Lehmer algorithm
If you want to enumerate all the primes upto 10^9 in 1 second, Segment Sieve of Eratosthenes plus Wheel Factorization will help a lot.
An example using primes 2, 3, 5, 7, 11, 13, code
How about using
Bitwise Segment Sieve of Eratosthenes
. Is it better than that ?what about for 10^18?
https://codeforces.com/blog/entry/22317
Thanks a lot for giving link of this blog.