Short: Computes prime numbers fast - V1.3
Author: grimm@physnet.uni-hamburg.de (Oliver Grimm)
Uploader: grimm physnet uni-hamburg de (Oliver Grimm)
Type: misc/math
Version: 1.3
Architecture: m68k-amigaos
FastPrim computes prime numbers using a method called the Sieve
of Eratosthenes, and it is, as far as I know, quite fast.
It takes about 12 seconds to calculate the 78498 prime numbers
below one million.
It should work on any Amiga, but it doesn't have any graphical
user interface. So use the shell ...