Slashdot Mirror


New Largest Known Prime Number: 2^57,885,161-1

An anonymous reader writes with news from Mersenne.org, home of the Great Internet Mersenne Prime Search: "On January 25th at 23:30:26 UTC, the largest known prime number, 257,885,161-1, was discovered on GIMPS volunteer Curtis Cooper's computer. The new prime number, 2 multiplied by itself 57,885,161 times, less one, has 17,425,170 digits. With 360,000 CPUs peaking at 150 trillion calculations per second, GIMPS — now in its 17th year — is the longest continuously-running global 'grassroots supercomputing' project in Internet history."

9 of 254 comments (clear)

  1. Wrong by Anonymous Coward · · Score: 5, Informative

    Actually it would be 2 multiplied by itself 57,885,160 times, minus 1.

    1. Re:Wrong by chalsall · · Score: 5, Informative

      As is well known, there is no direct mathematical benefit from finding these primes.

      It is, however, a very useful "driving problem" to developing new algorithms, software, and distributed computing infrastructure which have wide ranging real-world applications.

      Check out the Mersenne Forum where all types of interesting mathematical, software and computer issues are discussed.

  2. Re:Uhhh... by SuricouRaven · · Score: 5, Informative

    2^4-1 = 16-1 = 15.

    5 * 3 = 15.

    Go read it again.

  3. Re:Uhhh... by fredprado · · Score: 4, Informative

    Mathematics does deal with a lot of "disputed" definitions. Mathematics deal even with a lot of "disputed" logic and "disputed" interpretations. Read about the axiom of choice, set Theory in general, Constructivism (mathematics) and Finitism and you will understand that things get quite more complicated than you thought.

  4. A Little More Perfection by 14erCleaner · · Score: 5, Informative

    Since the only known perfect numbers are derived from Mersenne Primes, this means there are also now 48 known perfect numbers. Interestingly, this property of Mersenne Primes was discovered by Euclid about 2000 years before Mersenne was born (time machine, anyone?). Finding a non-Mersenne perfect number would be a huge accomplishment.

    --
    Have you read my blog lately?
  5. Re:Why 2^n-1 by godrik · · Score: 4, Informative

    number of the form 2^n-1 are Mersenne numbers which are much more likely to be prime than a randomly chosen odd number. Also, we have "simple" test for these number to weed out many Mersenne numbers that are not prime. Once you have a Mersenne number that passed the "simple" primality test, there is a good chance that it will really be a prime number.

  6. Re:Why 2^n-1 by Anonymous Coward · · Score: 4, Informative

    There is a very fast primality test for Mersenne numbers, the Lucas–Lehmer primality test.
    2^n+1 is prime only if it's a Fermat prime, n=2^k. None of these are known to be prime for k>4, and there probably aren't any more, whereas there are probably infinitely many Mersenne primes.

  7. Re:CPUs? why not GPUs? by chalsall · · Score: 5, Informative

    Yes. And both are used for GIMPS.

    See the Mersenne Forum's GPU Computing sub-forum for details.

    There are, however, many more CPUs than GPUs out there, so most of the work is still done by CPUs. Two different GPUs using different software (CUDALucas) were used to confirm that 2^57,885,161-1 was prime, in addition to two other CPUs (one using different software than the GIMPS standard Prime95/mprime).