### Ahs_58's blog

By Ahs_58, history, 5 years ago,

Is there any way to find prime number upto 10^9 or more in 1 second?

• +13

 » 5 years ago, # | ← Rev. 5 →   +30 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.
•  » » 5 years ago, # ^ |   0 Thank You
•  » » 3 years ago, # ^ |   0 How about using Bitwise Segment Sieve of Eratosthenes. Is it better than that ?