You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Given that you only need primes up to the square root of x to sieve x, there are faster ways of sieving a range than sieving every prime from zero through its upper bound. Like, you could jump straight to it once you have enough primes to sieve it.
The text was updated successfully, but these errors were encountered:
Given that you only need primes up to the square root of
x
to sievex
, there are faster ways of sieving a range than sieving every prime from zero through its upper bound. Like, you could jump straight to it once you have enough primes to sieve it.The text was updated successfully, but these errors were encountered: