20221220, 13:45  #45  
Apr 2020
2^{2}×3×79 Posts 
Quote:


20221220, 13:57  #46  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
2·7·263 Posts 
Quote:
Second, SNFS difficulty is 334.143 is equivalent to GNFS difficulty 223 or 224, so this means SNFS difficulty 3*x is equivalent to GNFS difficulty 2*x? 

20221220, 14:21  #47  
Jun 2012
3×1,303 Posts 
Quote:


20221220, 14:38  #48  
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
2×7×263 Posts 
Quote:
Last fiddled with by sweety439 on 20221220 at 14:38 

20221220, 16:33  #49  
Jun 2012
F45_{16} Posts 
Quote:


20221220, 19:34  #50  
Apr 2020
3B4_{16} Posts 
Quote:
Had it been down to me, your original post would have ended up in the "more offtopic" thread along with other posts where you have demonstrated a spectacular lack of reading comprehension. Quote:
Quote:


20221221, 04:27  #51 
Dec 2022
312_{10} Posts 
There's clearly no easy and definite rule here. I suspect that number, like this, fell very near the line between the two. If anyone's disappointed by not getting a record GNFS, well there are more potential large GNFS candidates; not sure if any good ones would be quite the right size though. Clearing those 'small' composites is not going to be extinct.
Last fiddled with by Andrew Usher on 20221221 at 04:28 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Polynomial selection  Max0526  NFS@Home  9  20170520 08:57 
Updated polynomial selection  jasonp  Msieve  65  20110501 19:06 
GNFS polynomial selection  Unregistered  Information & Answers  3  20110416 14:24 
2^8771 polynomial selection  fivemack  Factoring  47  20090616 00:24 
Polynomial selection  CRGreathouse  Factoring  2  20090525 07:55 