In P1, if all factors p of N are p≡1 (mod m) for some m, then N≡1 (mod m), and we can include m in the stage 1 exponent by exponentiating by N1, without actually knowing what m is. GMPECM does that, so that for example for cyclotomic numbers Φ_{m}(x), the known factor m in p1 is always included, without the user having to specify m via the go parameter.
For P+1, we adapt this to exponentiating by N^{2}1 in stage 1. This way, if all factors are p≡±1 (mod m) for some m, we are certain to include m in the exponent.
In your two cases, N^{2}1 happens to be divisible by 12223199 and 12215821, respectively, so these to primes got included in stage 1 even though they are greater than B1.
Alex
Last fiddled with by akruppa on 20090330 at 22:49
Reason: typos
