Quote:
Originally Posted by ZFR
One last question: when Prime95 does the P-1 algorithm, that time-consuming part of it would be the exponentiation of 3 (and modulo n)? The gcd itself is pretty fast comparatively, right?
|
Yes and yes. Well, there is also the stage 2.