[racket] Math library ready for testing

On Tue, Dec 11, 2012 at 12:01 PM, Jens Axel Søgaard
<jensaxel at soegaard.net> wrote:

> Below 60 there are only 16 numbers not divisible by 2, 3 or 5.
> The number of bytes needed to store primality results for the
> first million numbers will therefore be
>       1000000 * 16/60 * 1/8  ~ 33333.3
>
> How much space would be reasonable to use in the library?

Would make sense to have a user-tuneable parameter (with a small
default) for this?
So a prime intensive computation could do (precompute-primes-up-to
(expt 10 9) ).

What do Mathematica, Maple, etc, do in this case?

P.