20041126, 19:16  #1  
Sep 2002
106_{16} Posts 
Useless p1 work
Quote:
all b1's are smaller than m so they assume that the largest factor of p1 is m and they don't reach it. what a waste! Joss 

20041126, 20:55  #2  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
29AF_{16} Posts 
Quote:
Paul 

20041126, 21:21  #3 
Sep 2002
2·131 Posts 
So I see!
I tested 2^2511 b1=2 b2=2 and found the factor 27271151 Tks xilman You're right, b1 is actually b1+m There was no wasted cycle. I pushed the too early. Joss 
20041128, 13:21  #4  
"Richard B. Woods"
Aug 2002
Wisconsin USA
1111000001100_{2} Posts 
Quote:
27271151  1 = 2 Γ 5^2 Γ 41 Γ 53 Γ 251 

20041128, 13:28  #5 
"Richard B. Woods"
Aug 2002
Wisconsin USA
2^{2}·3·641 Posts 
Pminus1=79299433,660000,3465000,0,0
This will find any factor of 2^792994331 where factor = 2 * k * 79299433 + 1 and k has largest factor =< 3465000 and all other factors =< 660000. Actually, there are stage 2 extensions such that some k with largest factor =< (3465000 * a small integer) will be found, in certain cases. Last fiddled with by cheesehead on 20041128 at 13:31 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Posts that seem less than useless, or something like that  jasong  Forum Feedback  1050  20190429 00:50 
Fedora gedit for bash has become useless  EdH  Linux  11  20160513 15:36 
Useless SSE instructions  __HRB__  Programming  41  20120707 17:43 
Useless DC assignment  lycorn  PrimeNet  16  20090908 18:16 