Imagine if every subatomic particle in the universe held its own little universe. And every subatomic particle in those little universes held their own universes... And this continued on as many times as there are subatomic particles in the universe. Now imagine that every one of those subatomic particles in every one of those universes combined to form a single large supercomputer, so that every subatomic particle provided the equivalent of a million 10000 yottahertz P4 machines with over a billion yottabytes of ram per machine. Now imagine if this massive supercomputer began trying to check if 2^(2^13466917 - 1) - 1 is prime using the Lucas-Lehmer test.....
Now envision yourself sitting there and waiting for a very .... very .... very .... long time. But really... 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. Regards, David Meyer ([EMAIL PROTECTED]) Nathan Ranks wrote: > How long would it take to check (2^((2^13466917)-1))-1 which would be > the 39th known prime back in the mersenne number formula (2^p)-1? > _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
