PS: Double factorial and primorial

[bodrato at mail.dm.unipi.it]

Il Mar, 20 Dicembre 2011 8:03 am, bodrato at mail.dm.unipi.it ha scritto:
> Il Lun, 19 Dicembre 2011 9:15 pm, Niels Möller ha scritto:
>> primes up to n, you need to first create a list of primes up to sqrt(n),
>> and represent it in any convenient way which lets you iterate over it
>
>> Above sqrt(n), do the sieving blockwise. Create a bitmap of a suitable
>> blocksize (it should fit in the cache), let this bitmap represent some

> If we really want a prime_count function in GMP I can write a more clever

... the same applies to my current implementation of the primorial...

-- 
http://bodrato.it/