[REBOL] Re: Fw: prime solution
From: lmecir:mbox:vol:cz at: 15-Aug-2002 16:01
Are you saying that you implemented the algorithm
in rebol? If so, that's pretty clever.
> Hi Charles,
> thanks for the info. Using Rebol I found out, that it is unlikely that the
> algorithm will be faster than a brute force approach for numbers smaller
> than 706'044'139 (except for the powers).
Not exactly. I tried to simulate only the While part of the algorithm. I
don't know the Fast Fourier
Multiplication the article mentioned (though a slower version can be
implemented without it). Moreover, the
algorithm looks impractical for Rebol - see the number mentioned - and
that number is only a lower bound! A more realistic lower bound estimate is: