Slashdot Mirror


SB Project Announces 4th-Largest Known Prime

alien88 writes "The Seventeen or Bust project announced today that they have discovered the fourth largest prime on record. The prime is 1,521,561 digits long and is their sixth discovery since the start of the project. They now have 11 multipliers left to prove that k = 78,557 is the smallest Sierpinski number. Randy Sundquist of Team ExtremeDC's computer discovered the number on December 6th."

2 of 39 comments (clear)

  1. This didn't make the main page??? by Anonymous Coward · · Score: 5, Interesting

    Wow! I'm surprised ... coming on the heels of GIMPS 6+ million digit prime. At 1.5+ million digits, it's not only the world's 4th largest known prime, but is the FIRST known prime with more than 1 million digits that's not a Mersenne prime (not of the form 2^p-1)! This is important because the primality of this form, k*2^n+1, (while still allowing some optimizations) is much harder to check than the Mersennes and their close cousins, the Generalized Fermats, who together occupy the other 7 positions in the top 8 largest known primes!

    Greg

  2. Primes and our universe by BallPeenHammer · · Score: 5, Interesting
    From http://www.prothsearch.net/sierp.html

    "The Sierpinski Problem: Definition and Status In 1960 Waclaw Sierpinski (1882-1969) proved the following interesting result.

    Theorem [S]. There exist infinitely many odd integers k such that k*2n + 1 is composite for every n > 1.

    A multiplier k with this property is called a Sierpinski number. The Sierpinski problem consists in determining the smallest Sierpinski number. In 1962, John Selfridge discovered the Sierpinski number k = 78557, which is now believed to be in fact the smallest such number.

    Conjecture. The integer k = 78557 is the smallest Sierpinski number.

    To prove the conjecture, it suffices to exhibit a prime k*2n + 1 for each k less than 78557. By August 1997, this had been done for all except the following 21 values of k less than 78557. As long as a prime is not found for a listed k, that k might be considered a potential Sierpinski number. However, as the conjecture suggests, in the long run a prime is expected to emerge for each of these k."

    So, what these folks have done is found a prime for another candidate k less than 78557.

    I find the search for primes -- and for more complicated results, like this one, that use primes -- to be fascinating. There is something so pure about this world of mathematics. (As Kronecker is quoted as saying, "God made the integers; all else is the work of Man.") This kind of study says something very deep about the nature of the universe we live in.

    If there are other intelligent beings in the universe, it is fascinating to contemplate that -- no matter what other differences we may have -- they may be finding out these same facts about pure mathematics. It's a language we have in common.