Mathematician: Finding 17M-digit prime number like climbing Everest
Computer that discovered latest Mersenne prime did 57M calculations over 39 days
Computerworld - The mathematician who found the largest known prime number said the discovery last month was like climbing Mount Everest or landing on the moon.
The prime number, which is more than 17 million digits long, won't make computers run faster or help scientists develop better rockets. However, searching for the number was an exhilarating journey for Curtis Cooper, a mathematician at the University of Central Missouri.
If this prime number --2 57,885,161 minus 1, or 2 to the power of 57,885,161 minus 1 - was typed out in a standard Times Roman 12-point font, it would span more than 30 miles. It also would fill more than six Bibles.
It is the third prime number discovery he has made, and Cooper said the discovery isn't any less exciting. He said the feat, for a mathematician, was like climbing Mount Everest, because it was a goal he set out to achieve because he wanted to, not because he needed to.
"We've been working on this for years," Cooper told Computerworld. "We probably finish 50, 60 or 70 numbers per day, and for years we didn't find anything. Then on Jan. 25 we hit the jackpot. It's truly like looking for a needle in a haystack."
The Great Internet Mersenne Prime Search (GIMPS), a 16-year-old project that uses a grid of computers provided by volunteers to find large prime numbers, announced Tuesday that Cooper discovered the 48th known Mersenne prime.
A prime number is a whole number that can be divided only by one and itself. A Mersenne prime number is a class of primes named after Marin Mersenne, a 17th century French monk who studied the rare numbers more than 350 years ago.
Mersenne primes are extremely rare. With this discovery, only 48 are known. Each Mersenne prime is increasingly difficult to find.
Mersenne Primes are 2 raised to the x power, minus 1. For instance, the number 3 is a Mersenne prime number because it can be written as 2 squared, minus one. Number 7 is also a Mersenne prime number because it's 2 cubed, minus one.
To find this new Mersenne prime, Cooper used 1,000 computers on his university campus in Warrensburg, Mo. Each computer checked individual numbers. Dual-core machines could check two numbers at once.
The computer that discovered this 17 million-digit prime is a Dell desktop running an Intel dual-core processor. Sitting in the university's modern language lab, the computer spent 39 days running 57 million calculations to test the number.
- Agility & Scalability for Oracle EBS R12 and RAC on VMware vSphere 5 This white paper outlines extensive performance and scalability testing of Oracle EBS applications on a Vblock™ Systems with vSphere 5.
- Oracle and VCE: The Next Step in Integrated Computing Platforms In this ESG Lab review you will learn how a VCE system driven by Oracle, delivers the perfect blend of high performance and...
- Migrate Oracle Apps from RISC/UNIX to Virtualized x86 Ready to move Oracle to a virtualized environment? This brief explains how true converged infrastructure can help you migrate from a RISC/UNIX environment...
- Step Out of the Bull's-Eye Learn about the evolution of targeted attacks, the latest in security intelligence, and strategic steps to keep your business safe.
- Keep Servers Up and Running and Attackers in the Dark An SSL/TLS handshake requires at least 10 times more processing power on a server than on the client. SSL renegotiation attacks can readily...
- On Demand: Mastering the Art of Mobile Content Management Mobile device usage in the enterprise has skyrocketed, and it continues to escalate. IT must answer to users who demand access to their... All High Performance Computing White Papers | Webcasts