Does Primenet end the factoring search for a number the moment a factor is found?
Or does it go through every possible factor even if one or more factors are found even early in a search on a particular exponent?

[QUOTE=piforbreakfast;563323]Or does it go through every possible factor even if one or more factors are found even early in a search on a particular exponent?[/QUOTE]
Twopart question. The answer to the first question is "Yes". The complete answer to the second question is far too complicated to get into here. But the short answer is also "Yes", but by other Parties. P.S. Sorry; writing far too much legalize at the moment... 
[QUOTE=chalsall;563329]Twopart question.
The answer to the first question is "Yes". The complete answer to the second question is far too complicated to get into here. But the short answer is also "Yes", but by other Parties. P.S. Sorry; writing far too much legalize at the moment...[/QUOTE] Now I'm more intrigued by the "far too complicated" bit than by my original question. Please elaborate. 
The Prime95 software will normally stop when it finds a factor.
There is an secondary effort that PrimeNet coordinates that look for more factors for the lowest nonprimes. There are attempts to fully factor the smallest of the numbers. There are a few individuals that are working on getting every factor found at each bit level, as well. Part of the effort to fully factor all of the lowest number is doing a PRP test on the remaining 'cofactor'. If it shows that the cofactor is composite, then there will be efforts to find more factors. General order TF, then P1, then ECM, then if there are more factors yet to be found, "bigger guns" may be brought to bear. 
All times are UTC. The time now is 03:34. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2021, Jelsoft Enterprises Ltd.