LYCOS RETRIEVER 
Prime Numbers
built 665 days ago
Proving a number is prime is not done (for large numbers) by trial division. Many mathematicians have worked on primality tests for large numbers, often restricted to specific number forms. This includes Pépin's test for Fermat numbers (1877), Proth's theorem (around 1878), the Lucas–Lehmer test for Mersenne numbers (originated 1856),[1] and the generalized Lucas–Lehmer test. More recent algorithms like APRT-CL, ECPP and AKS work on arbitrary numbers but remain much slower.
Source:
Using a program written by Ernst Mayer, the new Mersenne prime was independently verified by David Willmore using two weeks of computer time donated by Aerial Communications on a 500 MHz Alpha workstation. Ernst Mayer works with Richard Crandall on a variety of number theory projects.
Source:
Eratosthenses was a Greek mathematician who figured out that to find all the prime numbers between two and some large number, you need to remove all the multiples of each number between two and your large number. Start by pressing "2" (skip over "1"), and you'll see all the multiples of two eliminated: 2,4,6,8, etc. Next, click on "3" and so on. At some point the program will stop, and all the prime numbers between 2 and 400 will be colored red. Can you guess the biggest number you will need to click?
Source:
For years Perfectly Scientific Inc. has been producing high quality posters of the largest currently known prime number. Each poster is printed on thick glossy paper and measures 29 inches by 40 inches. Framed and unframed posters dating back to June of 1999 are available for purchase. Prices vary, as each new prime tests the limits of the technology necessary to print these high-resolution posters.
Source:
To find a prime-detecting algorithm that could do the job in polynomial time, researchers had explored a variety of approaches—some based on highly sophisticated mathematics—but with limited success. In 1999, Agrawal decided to try a relatively simple approach that he noticed had been overlooked by others. He enlisted the aid of Kayal and Saxena, who were undergraduate students at the time. Early computer simulations were encouraging, but only this past summer did the team finally work out the complete method and the mathematical proof establishing its theoretical efficiency.
Source:
Skyler’s extraordinary Prime Processing technology traces its foundation to unique insights into the hidden power of prime numbers by Co-Founder and Chief Scientist, Jack LeTourneau, PhD. In industries where speed and complexity of data processing are a competitive necessity, Skyler’s real-time engine provides faster, more efficient decision-making and improved business agility.
Source:
MORE ABOUT
Prime Numbers