20210916, 15:40  #23 
Sep 2009
2^{2}×607 Posts 
I've miserably failed to find a poly for this c113:
Code:
13388164029832178605174690994702863628597531043917231628629707028750338026569517034134903882342648685574248816951 Has anyone any idea if it's something about this c113 (it's part of 45^2751, Aurifeuillian M factor)? Or how to make poly selection work? In this size range I just want something I can throw numbers at and expect them to get factored without manual intervention. 
20210916, 19:27  #24  
Dec 2020
5·11 Posts 
Quote:
Code:
P74 = 23253040074809224483773311933322964126803314914606413239037385569218598601 P39 = 575759728051043642495256241438391908351 

20210917, 15:35  #25 
Sep 2009
4574_{8} Posts 
Did yafu use QS or GNFS? If GNFS what version of msieve did it use? I suspect the msieve versions I tried have some bounds set wrongly for number in this size range.
I did manage to find a poly for it with Msieve v. 1.54 (SVN 1022M) and a GTX 460. So you've saved me the job of factoring it with that. But I'm more concerned that other GNFS jobs in this size range will fail and I don't want to have to manually intervene every time it happens. 
20210918, 11:14  #26 
Dec 2020
5×11 Posts 
I *think* it uses msieve 1.53. At least that's what in the ggnfs_dir that yafu.ini points to.

20210918, 13:05  #27  
"Ed Hall"
Dec 2009
Adirondack Mtns
2·3·877 Posts 
Quote:
Edit: The above is for linux. For supplied Windows binaries, I would guess you'd ned to see if the "v" option works. Last fiddled with by EdH on 20210918 at 13:09 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Msieve failed to polyselect  firejuggler  Msieve  3  20181001 13:47 
Base method of montgomery polyselect implementation  csg  Homework Help  2  20171213 07:04 
Playing with CADO's individual polyselect binaries  Dubslow  CADONFS  22  20160704 19:54 
To CPU or to GPU: stage1 polyselect research  Karl M Johnson  Msieve  8  20111112 19:46 
Questions  joblack  Math  10  20090501 19:52 