That's great! In fact, I already knew about the 12223199 and 12215821 factors of p1. Both Ns are composite factors of Mersennes found by P1, and I was looking for the best way to resolve them. Of course I can break them in seconds by throwing a few curves at them, but using P+1 to the original P1 bounds breaks them in a fraction of a second.
The downside is that sometimes you get a "found input number N" and the program halts even if there are more runs to do. Is there a way to make in continue when that happens?
Last fiddled with by Mr. P1 on 20090330 at 07:57
