Re: [isabelle] Computing divisors

> If one first generates the appropriate number of prime numbers with
> Eratosthenes' sieve, one can, of course, avoid unnecessary divisibility
> tests, but at the cost of the time and memory overhead of computing the
> sieve, so I am not sure whether that is a good tradeoff for practical
> situations.

I am definitely not sure either.  You'll find out such things during the
progress of your work…



PGP available:

Attachment: signature.asc
Description: OpenPGP digital signature

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.