Path: utzoo!utgpu!jarvis.csri.toronto.edu!neat.cs.toronto.edu!moraes
Newsgroups: news.software.b
From: moraes@cs.toronto.edu (Mark Moraes)
Subject: Re: dbz caveat
Message-ID: <89Oct17.000220edt.3270@neat.cs.toronto.edu>
References: <1139@svx.SV.DG.COM> <1989Sep26.223014.13868@ddsw1.MCS.COM> <9668@b-tech.ann-arbor.mi.us> <6512@ficc.uu.net> <9680@b-tech.ann-arbor.mi.us> <1989Oct14.062717.15420@twwells.com> <675@wet.UUCP> <1989Oct16.043012.2938@twwells.com>
Date: 17 Oct 89 04:02:51 GMT

In news.software.b you write:

>As I recall, you need a prime number. So, you have to find some prime
>number larger than the one you just computed. If you just want to
>throw darts to find a prime number, you can use the "factor" program
>(on Microport, anyway). Alternately, there are factoring programs on
>the net. Or you can look in a table of primes, likely available in the
>reference section of your local library.

On BSD machines, /usr/games/primes is a useful source -- just remember
to pipe the output through head or a pager -- it runs on forever
otherwise...

According to our version, numbers for the next few years:

100003
200003
400009
800011
1600033
3200003
6400013
12800009
25600013
51200027
102400007
204800017