>>>>> "Andreas" == Andreas Eder <Andreas.Eder@t-online.de> writes:
Andreas> But then, it shouldn't matter much, because haipart isn't used in many
Andreas> places and I prefer the clarity over a few microseconds in speed any
Andreas> time.
Fixed the typo to haipart and committed the change. Will think about
whether to change it to the commented version, which is clearer.
>>
>> There's a few other silly things in clmacs too like
Andreas> I can't imagine the count argument to be used at all, but I haven't
Andreas> looked at the code yet. All this should be cleaned up.
Some of these have been cleaned up. I may have broken support for
lucid, but I don't think we claim support for that Lisp anymore.
Andreas> I haven't decided what to do yet. Currently a few small primes are
Andreas> directly tested against, then I do a few Miller-Rabin
Andreas> tests. Afterwards the Lucas-PseudoPrimality test makes things clear for
Andreas> all numbers < 10^16. If the number has not yet been proved composite
Andreas> by all this chances are good that it really is prime (against the
Andreas> compostion of Lucas and Miller-Rabin tests no counterexample is known,
Andreas> though we only know for sure up to 10^16). Then it is time for either
Andreas> an ECC-PrimeProver or the APRCL Test. Both can really prove a number
Andreas> prime. And if you need a certificate, then there is the Pratt-Test.
Andreas> At the moment I'm still in the middle of the work. I hope I can finish
Andreas> it soon :-)
This sounds quite nice. Is this intended to be done in Lisp? Cool!
Ray