[racket] Math library ready for testing

On Tue, Dec 11, 2012 at 05:56:03PM +0100, Pierpaolo Bernardi wrote:
> On Tue, Dec 11, 2012 at 5:11 PM, Stephen Bloch <sbloch at adelphi.edu> wrote:
> 
> 
> > How many primes are below ten million?  A hundred million?  At some 
> > point storing the primes will take less memory than storing 
> > primality flags, but that point may be above the size of tables we 
> > can realistically store today.

With the density of primes up to n asumptotically tending to 1/ln n, you 
might find that the increasing sparseness of primes is eaten up by the 
increasingly larger number of digits used to express the primes.  I 
don't know how mich gzipping the lise would help.

-- hendrik