Short:        Fastest Sieve of Eratosthenes prime test
Author:       madmax@uni-paderborn.de (Dirk Held)
Uploader:     madmax uni-paderborn de (Dirk Held)
Type:         misc/math
Architecture: m68k-amigaos

Replaces  misc/math/aYaSieve
Version:  1.3


Just to end(?) this contest "Who writes the fastest Sieve of Eratosthenes"

                 Tatahh ! Here comes .... AndYetAnotherSieveNT
                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

               (the fastest prime-number computer at this time)
                  ((well ... was just kidding last time.;-))
              [NT := (Next|Nice)Try | NewTechnology | Nose-Tip(ahead)]


On  my system (A4k40+FPU+MMU,25 MHz, 16 MB RAM) it tests primes upto
240.000.000 in about 223.3 seconds !
100.000.000 in about  88.1 seconds,
 10.000.000 in about   7.5 seconds,
  1.000.000 in less than 0.6 seconds

So itīs about 6% faster and 3% larger than the previous Version.

The time cost ist about O(n*1.1) = O(n), this means, if the Programm calcs to a
10 times higher Number, the Program needs 11 times longer. The Program needs about
Number DIV 16 Bytes Memory.

So this Implementation of the Sieve of Eratosthenes is (still) about 4% faster, needs
the same RAM, and has (sniff) 3.8 times the size of the similar Program YaYaSieve.

Usage: aYaSieveNT [-(?|h|v|t)] Number

        -? -h   prints Usage ;-)
        -v      Verbose Mode (all Primes are printed....)
        -t      Test Mode : checks, if Number is Prime
        Number  to test 2..Number for primality (Number < 2^32 ;-)

aYaSieveNT is completely written in *pure* Amiga Modula-II. The amiga version is
compiled with "Amiga Modula-2 Compiler 68881, 4.301d, 19.06.94, Đ AMSoft"
This is NOT a trick, and it isnīt S*N! either.

This Program runs on every Amiga with Kick 2.0

The source ain't nevertheless available (YET). I WILL NOT *sell*, but publish it
later for free. If you are interested contact me: madmax@uni-paderborn.de

It is strictly ALLOWED to produce any aYaSieveNT-like program without
my permission :). (But who really cares about it ? Proggis like these are`n
usefull to factorise LARGE numbers (i.e. 100 or more digits), so why bother.
Try KillPrime on Aminet instead (Hi Brice:).

                          *IMPORTANT*

NO (more?) BUG

ups, there used to be a Bug (thank you Brice), but itīs already converted to a
feature, before you (Brice) noticed it. Due to internal limitations, my program
at least sieves to 6721, so wYgimtYw (what You get, is more than You wanted).

This readme is just a 1 minutes copycopy draft. :)
If you have questions drop me a mail.

Hellos and Greetings going out to: - everyone, whoīs able to code a at least 10%
                                     faster Version of Eratothenesīs Sieve
                                     (according to Big-o Notation)

                                   - those guys, which prefer a REAL 32 Bit (or
                                     even 64 ??) Maschine

Aetschi-Baetschis and Buuhs going out to: - nobody

                                          - or those guys, which are proud
                                            to cope with a 64K or 640K
                                            Barrier on Systems without an OS.