ANTS
2006
Springer
14 years 3 months ago
2006
Springer
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...