At 06:33 PM 1999/06/21 -0500, "Willmore, David" <[EMAIL PROTECTED]> wrote:
>Ahhh, because the smallest factor must be <= the sqrt() of the number!
>Sorry, Gordon, I was wondering the same thing when you asked this. :)
Um, no. For exponents of current interest, p~=7,000,000,
Mp=2^p-1 has p bits, and sqrt(Mp) has p/2 bits, or ~3,500,000,
while factoring "only" goes to ~63 bits.
Factoring depth is determined by the lesser of:
factor<=sqrt(Mp)
how far it pays to go (when factoring further yields less than LLtesting)
numerical limit of available code
Ken
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
