mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Msieve

Reply
 
Thread Tools
Old 2013-08-26, 23:56   #122
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

2×34×13 Posts
Default

Yes, you are right. I got these two threads confused.
frmky is online now   Reply With Quote
Old 2013-08-27, 00:44   #123
firejuggler
 
firejuggler's Avatar
 
Apr 2010
Over the rainbow

23·52·13 Posts
Default

When i'm working on -nps of frmky, I sometime get the line
Code:
poly 12000048 376871999634151963 54459810153912782101909120209246657
poly 12000048 550823574178211821 54459810153912781740531311604282959
line minimize failed
poly 12000048 483290353796105167 54459810153912782069489787201019936
poly 12000048 330555862632842411 54459810153912781975255654553967780
Does that mean the size optimisation failed? or something else?
firejuggler is offline   Reply With Quote
Old 2013-08-27, 11:27   #124
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

DD516 Posts
Default

It means the size optimization on that particular example was numerically unstable enough that the optimization gave up and used the current output as the answer. Probably it isn't good enough though.
jasonp is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Polynomial Discriminant is n^k for an n-1 degree polynomial carpetpool Miscellaneous Math 14 2017-02-18 19:46
Help choosing motherboard please. Flatlander GPU Computing 4 2011-01-26 08:15
Choosing the best CPU for sieving siew Factoring 14 2010-02-27 10:07
MPQS: choosing a good polynomial ThiloHarich Factoring 4 2006-09-05 07:51
Choosing amount of memory azhad Software 2 2004-10-16 16:41

All times are UTC. The time now is 00:52.


Sat Jul 17 00:52:45 UTC 2021 up 49 days, 22:40, 1 user, load averages: 1.32, 1.47, 1.40

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.