## 45th and 46th Mersenne Primes Confirmed 47 47

kahunak writes to alert us that GIMPS has announced that the 45th and 46th Mersenne primes have been confirmed. The EFF's $100,000 award, for the first prime over 10 million digits in length, will probably be claimed. (We discussed no. 45 when it was announced.)

## Re:So (Score:4, Funny)

Hang on, I'm trying to type it in, but it takes longer because i'm using sms

## Re:So (Score:5, Funny)

The $100k award is not enough to cover the cost of sending the number through sms...

## Re:So (Score:4, Insightful)

Even if sent in the form: (2^n)-1?

## Re: (Score:3, Funny)

Yes, the rates the carriers charge for SMS's have risen *that* much...

## Re: (Score:1)

## Re:So (Score:5, Interesting)

Now, assuming you can SMS at lightning speed and input 3 characters per second on a non qwerty keyboard (which is pretty dang fast if this story is to be believed http://www.engadget.com/2004/11/17/new-world-record-for-fastest-text-messaging/ [engadget.com] ) typing that out will take roughly 926 hours or 38.5 days.

Now I'm not a doctor, but you'd also have to factor in the chance for physical, and mental harm from this extended bout of texting. No sleep, no food or water, and definitly no slashdot for 38.5 days, not to mention the incedible amount of stress placed upon the joints, tendons, and muscles of your thumbs and arms.

I say no thank you sir, no thank you indeed. Good luck in your epic endeavor!

## Re: (Score:1)

hmmmm, think I'll outsource the job then.

## Re: (Score:2)

Don't forget accounting for human errors.

## Re:So (OT) (Score:1)

Actio personalis monitur cum persona. (Dead men don't sue)

That should be moritur, with an r.

## Re: (Score:2)

You can type numbers on a numeric keypad with one hand. So eating, drinking and other activities while smsing this message are still quite possible. Heck, sms is designed to be single-hand friendly.

## Re: (Score:1)

## Re: (Score:2)

## Re: (Score:2)

Dr. Arroway to Michael Kitz: You want to classify the prime numbers?

(From Contact by Carl Sagan)

## Re:Prime Post! (Score:5, Interesting)

Not quite. In fact I will hereby reveal to the world the exact beginning and the exact ending of the

47th Mersenne prime(not just the 45th or the 46th, really the 47th!) as written in binary notation.Not kidding, dead serious, this is the real thing:

11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 ... ... ... 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111 11111111

Mersenne numbers are by definition 2^n-1, which means that in binary notation every such number is a sequence of ones.

## Re: (Score:2, Interesting)

## Re: (Score:2)

True, but it would be strange that there would be a limited amount of Mersenne primes using un unlimited amount of primes. But this could be the case. Still, we are at millions of digits now and we have 2 new ones so I am guessing that there are infinite.

## Re: (Score:2)

Since the length of the number in base-10 is a little more than 10 million digits, and 10^3 is roughly 2^10, does this mean n is as low as 33-35 million?

## Re: (Score:3, Interesting)

Nevermind, checked Wikipedia. The largest currently known n is 32,582,657 so apparently my reasoning is correct.

## Re: (Score:1, Flamebait)

(#24992811)

Prime factors:

3

2776979

fail

## Re: (Score:3, Informative)

(#24992811)

Prime factors:

3 2776979

UID.

fail

Sweet Christ, you managed to not only be wrong, but at the same time un-ironically use an awful 4chan meme to do it.

## Re: (Score:2)

first: he was talking about the post not his UID

second:

His UID factors into

109 4127(semiprime)

you fail

troll

## Re: (Score:1)

## Re: (Score:2)

How the hell can he predict whether his post is the second one or not? Unless you struck a deal with /. admins or omniscient you can never know. But somehow you are capable of convienently forgetting this fact.

troll

## Just missed the prize myself! (Score:2)

Now these show-offs have gone ahead and spoiled it for the rest of us.

## Why Mersenne Primes Matter (Score:4, Informative)

Not knowing why Mersenne primes matter, I looked it up on The Ultimate Source Of Truth [wikipedia.org]. From The Fine Article [wikipedia.org]:

Out of those, I only knew about the connection with pseudorandom number generators, which I became interested in after writing my deadbeef random number generator [inglorion.net].

## This doesn't matter so much (Score:4, Interesting)

## Re:This doesn't matter so much (Score:5, Interesting)

Knowledge of whether or not there are infinitely many Mersenne primes would probably not be interesting even to most pure mathematicians -- it's sort of a bizarre question that seems disconnected from the rest of mathematics. What would be interesting would be the actual methods used to prove this. In practice almost every question involving the existence/non-existence of certain types of primes is one we already know the answer to.

The reason for this lies in the prime number theorem, which says that the proportion of numbers less than N which are prime is about 1/Log(N). Unless there's some compelling reason to believe otherwise, you can guess the answer to many problems involving primes by replacing them with a set randomly chosen with the same probability.

For example, a randomly chosen number near 2^p-1 will be prime with probability about proportional to 1/p. Since the sum of 1/p diverges, we expect there to be infinitely many Mersenne primes (and can even guess their number, though this requires a bit more careful analysis to take care of the observation that Mersenne numbers don't have small prime factors, but this should only increase their number).

The same trick allows us to guess the answer for twin primes (sum diverges, so there should be infinitely many) and Fermat primes (primes of the form 2^(2^n)+1 -- the sum converges, so there should be only finitely many). But none of these are really rigorous proofs, because they're all based on the fundamental assumption that the primes are somehow pseudorandom.

Depending on the method of attack, a proof of the infinitude of Mersenne Primes may also shed light on how accurate or inaccurate the pseudorandomness assumption is. I would consider that to be a VERY interesting question.

## Unfortunately these primes can't be published... (Score:4, Funny)

## Re: (Score:2, Insightful)

... because they coincidentally correspond to two of Britney Spears's songs encoded as mp3 files at 128kb and the RIAA won't allow such copyright infringement! Double ouch!

If that's the case, no great loss, we wouldn't want to see (or hear) them anyway!

## Re: (Score:3, Funny)

This just in: Britney Spears is actually a weapon sent by aliens to enslave the Earth through hidden prime number telepathic messages.

News at eleven.

## Re: (Score:2)

## poor bruce (Score:1)