Quote:
Originally Posted by tha
Code:
M5000473 has a factor: 209330976360004991784025594343086488165867134495557474039114517517233285534935270447

Actually, your factor is highly composite and is the product of the following factors:
7760734097,
33273147343,
998404440127,
236614851647663,
49063162886176471,
69941149552602344167.
All of these factors were known! Maybe the 276 bits are too much for the server.
Ignoring the BSextension of P1, you'll never had found that factor if it wasn't composite, because
\[2 \cdot kp + 1 = 209330976360004991784025594343086488165867134495557474039114517517233285534935270447\]
with
\[k = 3^3 \cdot 7 \cdot 113 \cdot 673 \cdot 1456253911501367260035342432108965873325923379588222150307120692354091,\]
so one would need B1 = 673 and B2 = 1456253911501367260035342432108965873325923379588222150307120692354091 to find that factor.
You could have added the known factors to your worktodo line, e.g.
Pminus1=N/A,1,2,exponent,1,B1,B2,bitsFactored,"knownFactor1,knownFactor2" etc.