Slashdot Mirror

← Back to Stories (view on slashdot.org)

New Mersenne Prime Discovered, Largest Known Prime Number: 2^74,207,281 - 1 (mersenne.org)

Posted by Soulskill on from the that's-my-phone-number dept.

Dave Knott writes: The Great Internet Mersenne Prime Search (GIMPS) has discovered a new largest known prime number, 2^74,207,281-1, having 22,338,618 digits. The same GIMPS software recently uncovered a flaw in Intel's latest Skylake CPUs, and its global network of CPUs peaking at 450 trillion calculations per second remains the longest continuously-running "grassroots supercomputing" project in Internet history. The prime is almost 5 million digits larger than the previous record prime number, in a special class of extremely rare prime numbers known as Mersenne primes. It is only the 49th known Mersenne prime ever discovered, each increasingly difficult to find.

4 of 132 comments (clear)

  1. Re:"each increasingly difficult to find." by Pseudonym · · Score: 4, Informative

    Here you go: S. Wagstaff, "Divisors of Mersenne numbers," Math. Comp., 40:161 (January 1983) 385--397. MR 84j:10052

    It's true that we don't know for sure, but it's not true that we have no fucking idea.

    --
    sub f{($f)=@_;print"$f(q{$f});";}f(q{sub f{($f)=@_;print"$f(q{$f});";}f});
  2. Re:PrimeCoins by DesertNomad · · Score: 4, Informative

    this is likely true as the number 1 is not a prime number. https://primes.utm.edu/notes/f...

  3. Re:Rare Primes? by Anonymous Coward · · Score: 5, Informative

    It's not so much that Mersenne numbers are much more likely to be prime than other odd numbers of their size. It's that there is a special-purpose primality test just for Mersenne numbers that is tons more efficient than verifying other primes of similar size.

  4. Re:"each increasingly difficult to find." by Petronius+Arbiter · · Score: 4, Informative

    Math is also fascinating because of how it can often work around impossibility proofs.

    E.g., what class of polynomials is solvable depends on what elementary functions are allowed. With Jacobi theta functions, you can exactly solve quintics.

    http://mathoverflow.net/questi...

    For another example, with cosine and acos, you can exactly solve cubic polynomials, w/o using cube roots. Better, if the solutions are real, then the solution does not require imaginary numbers, unlike if you solve with cube roots.