This is the life! I refer to contributing to an E-mail list. Two days in and I solicit a response from from the horse's mouth by broadcasting a silly oversight!
> At 08:55 AM 10/24/2006, david eddy wrote: > >I'm mystified. > > > >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? > > Both are correct. You are right there are twice as many factors to test. > However, the benchmark times how long it takes to test a small fixed > size subset of factors of that size. In his haste to delete the table of times, George also deleted: << When I did the benchmark test in Prime95 (v24.14), the screen output asserted that all these times referred to factoring M35,000,011. >> This is the first of the two items in "both" I presume. > > >The only feature I understand is the jump at 64 bits, since the division > >suddenly gets harder. > > Again you are correct. Welcome back from your vacation. I note that your list of "available" double check exponents started at 18,000,000. Consulting primenet, their allocation is already well into these. THX 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
