There only a slight error with your logic...
For the exponent1165, the root is *not* 3413 bits long, but more like
5825000bits long. Perhaps you forgot exponents add, not
multiply.
Okay, next time I'll open my mouth a little
wider, so I can fit both feet inside.
Sorry all, sometimes
Who needs to? I have code which tries any number up to 2^95 as a
factor of a Mersenne number with an exponent up to approx. 600
million, using less than 1 KByte of code space and 32 bytes of data
storage. It executes in a time proportional to the logarithm of the
exponent - for an
