I'm mystified. When I did the benchmark test in Prime95 (v24.14), the screen output asserted that all these times referred to factoring M35,000,011.
Best time for 58 bit trial factors: 40.217 ms. Best time for 59 bit trial factors: 40.172 ms. Best time for 60 bit trial factors: 40.231 ms. Best time for 61 bit trial factors: 40.305 ms. Best time for 62 bit trial factors: 76.467 ms. Best time for 63 bit trial factors: 76.608 ms. Best time for 64 bit trial factors: 169.511 ms. Best time for 65 bit trial factors: 172.125 ms. Best time for 66 bit trial factors: 175.240 ms. Best time for 67 bit trial factors: 175.982 ms. The number of factors of 2^p - 1 to try up to 2^m goes as (2^m)/p Why don't the times follow suit? The only feature I understand is the jump at 64 bits, since the division suddenly gets harder. I think they must have been changing p. Suggestions welcome David Eddy _________________________________________________________________ Be one of the first to try Windows Live Mail. http://ideas.live.com/programpage.aspx?versionId=5d21c51a-b161-4314-9b0e-4911fb2b2e6d _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
