The Great Internet Mersenne Prime Search (GIMPS) project has scored its 14th consecutive victory, discovering the largest prime number so far. The number, 2 to the power of 57,885,161 minus 1, is a digit that's 17,425,170 digits long. That's big enough that if you want to see the full text, you'll have to brace yourself for a 22.5MB download. GIMPS, a cooperative project splitting the search across thousands of independent computers, announced the find yesterday after it had been confirmed by other checks. At present, there are 98,980 people and 574 teams involved in the GIMPS project; their 730,562 processors perform about 129 trillion calculations per second. http://news.cnet.com/8301-1001_3-57567844-92/amateur-effort-finds-new-largest-prime-number/

Really don't see a reason for this to be news I swear I saw it on yahoo or the AP and was just thinking why does anyone even care.

Wait what good is this for? Aren't there infinite prime numbers? Must we find them all? Ignorant math person here. I'm only on Cal 2.

How would it do that? I would assume it has to do with making the cpu calculate it but if your testing for errors and such why not simply make the cpu count towards infinity for X amount of time?