> Testing this number would take at least 2^(2^13466917 - 1) - 1 bits of > storage. The supercomputer described above would not even come > close to having enough RAM to store that. If it did, the LL test would > then require approximately 2^13466917 - 1 massive iterations. If the > computer above could do each iteration in > 0.000000000000000000000000000000000000000000000000000000000000001 > seconds, the amount of seconds required to complete the task would > still be significantly more than 4,000,000 digits. Thats > incomprehensible.
I bet the answer is "42"... _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
