James' World 2

Click the link below the picture

.

Thousands of computers across the world are currently scouring the number line in a scavenger hunt for rare mathematical gems. Prime number enthusiasts, looking for larger and larger numbers that are divisible only by 1 and themselves, muster vast amounts of computing power and algorithmic ingenuity in hopes of etching their name into the scrolls of math history.

The latest entry comes from Luke Durant, a researcher in San Jose, Calif. Durant’s discovery overturned the former record holder, which sat uncontested for nearly six years, an unprecedentedly long reign in the modern search for ever larger prime numbers. The gap makes sense: as primes grow, they spread further apart, making each new find harder than the last.

The new prime contains a mind-boggling 41,024,320 digits. To put that in perspective, the estimated number of atoms in the observable universe clocks in at around 80 digits. Every additional digit increases a number by 10 times, so the size of the new prime lives far beyond human intelligibility. Primes play a major role in pure math, where they’re main characters in a field called number theory, and in practice, where, for example, they underlie widely used encryption algorithms. A prime with 41 million digits won’t immediately join the ranks of useful numbers, but for now, it adds a feather in the cap of a community that longs to apprehend the colossal.

Durant’s success stems in part from new clever software from the Great Internet Mersenne Prime Search and in part from heavy-duty hardware and computational muscle that he personally mobilized for the pursuit. By assembling a “cloud supercomputer” spanning 17 countries, he ended a long tradition of personal computers discovering primes.

Prime numbers are often called the “building blocks of math” because every whole number greater than 1 has a fingerprint as the product of a unique collection of primes. For example, 15 is the product of the primes 5 and 3, whereas 13 cannot be subdivided like this because 13 is prime. The study of these numbers dates back at least to the ancient Greeks. In 300 B.C.E. Euclid proved in his textbook Elements that infinitely many primes exist, and mathematicians, both professional and amateur, have relished the hunt for them ever since.

While the first string of primes—2, 3, 5, 7, 11, and so on—is easy to find, the task gets considerably more challenging as the numbers get larger. For millennia, people found primes by hand—until 1951, when computers took over the search. But even silicon bounty hunters struggle to spot primes in the far reaches of the number line because testing the primality of an enormous number is nontrivial. To cope, researchers deploy every little optimization trick they can to speed up their tests or narrow their hunting ground, thereby boosting their chances of finding a new prime.

Consider the number 99,400,891. How would you determine whether or not it’s prime? You could simply divide it by every smaller number and check if it has any divisors (in addition to 1 and itself). But that’s nearly 100 million cases to check for a relatively puny eight-digit number. You would save significant work by realizing that you don’t need to check every number up to the target, just the prime numbers. Why? You only need to find one divisor (one number that cleanly divides 99,400,891 with no remainder). We know that any nonprime divisor could be further broken down into its prime factors—if your target is divisible by 15, then it’s also divisible by the primes 5 and 3, so you only need to check the latter to determine primality. Further savings would come from the insight that you don’t need to check every smaller prime either, only those up to the square root of 99,400,891 (the number that when multiplied by itself gives you this eight-digit result). If none of those smaller primes divide it cleanly, then you can stop looking because the product of any two numbers larger than the square root of 99,400,891 will exceed it. These efficiency tricks slash our search drastically, from around 100 million numbers to only 1,228 (the number of primes less than the square root of 99,400,891). For those curious, 99,400,891 = 9,967 × 9,973, so it’s not prime.

Those shortcuts did wonders for an eight-digit number, but how did Durant reach 41,024,320 digits? To graduate the search from the merely massive to the truly gargantuan, he and many other seekers focus on particular types of prime numbers. Mersenne primes, named for Marin Mersenne, the French theologian who studied them in the 17th century, take a special form. You get them by multiplying 2 by itself some number of times and then subtracting 1, as described in the equation 2ⁿ – 1. Mersenne noticed that when you plug in different values for n, you sometimes get a prime number. Specifically, 2ⁿ – 1 can only yield a prime when n itself is prime, and even then it’s not guaranteed. What makes Mersenne primes special from a prime hunter’s perspective is that we know a fast method (called the Lucas-Lehmer primality test) for checking whether numbers of the form 2ⁿ – 1 are prime. That test is much faster than any known general methods for numbers without that special form.

The Lucas-Lehmer test fuels the Great Internet Mersenne Prime Search project, which launched in 1996 and enables any volunteer to download a free code that searches for Mersenne primes to run on their computers. The crowdsourced approach and the focus on Mersenne primes have proved successful. The seven largest known primes are all Mersenne primes and were all found by participants of the project. Note that smaller unknown primes certainly exist, but because we don’t know efficient methods for checking them, they’ll remain in the shadows for now.

.

.

.

Click the link below for the article:

.

__________________________________________