(may be) stupid idea for speed of mersenneLLT
Hi all. I have an idea how to may be speed or slow down LL test. I just dont know how FFT multiplication behaves with even larger numbers.
you could test 2 or more numbers at same time:
example for the iterations with 3 exponents p,q,r:
S(0) = 4
S(n+1) = S(n)^22 mod (2^p1 * 2^q1 * 2^p1)
test p,q,r like always:
S(p2) mod (2^p1)
S(q2) mod (2^q1)
S(r2) mod (2^r1)
hmm i guess it will cost more time with larger numbers, but since i'm not sure... :)
