[NBKPrimeSieve] Sieve primes in a range

[oscbyspro]

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.

[oscbyspro]

Hm. I'll skip this one for now. Inspiration is fleeting when you don't need it.