mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   News (https://www.mersenneforum.org/forumdisplay.php?f=151)
-   -   Holy new Mersenne prime, Batman! (M47 related) (https://www.mersenneforum.org/showthread.php?t=10564)

ixfd64 2008-09-16 22:46

Here's another article from [i]Scientific American[/i]: [url]http://www.sciam.com/blog/60-second-science/post.cfm?id=big-and-bigger-new-prime-numbers-cl-2008-09-16[/url]

ATH 2008-09-16 22:53

[QUOTE=akruppa;142690]Not unexpectedly, they are not a part of a twin prime pair and don't disprove the NMC.

5^2*859 | 2^37156667-3
297253337 | 2^37156667+1

191 | 2^43112609-3
86225219*5259738299*5949540043*12482997260297 | 2^43112609+1

Congrats everyone!

Alex[/QUOTE]

No need to check 2^p+1 ? :) Since it would have to be a fermat prime.

Perfectnumbers+1 are not prime either:

p=37156667: 2^(p-1)*(2^p-1)+1 factors: 7,11,44753,202577,1282451377
p=43112609: 2^(p-1)*(2^p-1)+1 factors: 7,211,70121,71647,1846524311
checked up to 10^10.

ATH 2008-09-16 22:55

[QUOTE=R.D. Silverman;142683]It would be nice, from a mathematical point of view, if GIMPS were to
stop looking for NEW primes (now that we have a prime > 10M digits)
and instead were to work on filling in the GAPS.[/QUOTE]

I would like to finish the gaps too, but thats considered "poaching", since old slow computers working on low first time numbers. If someone decides something, I'm interested.

Damian 2008-09-16 23:47

[QUOTE=ewmayer;142798]The article in post #727 above says he only ran his PC 6-8 hours a day due to high electricity costs.[/QUOTE]

He was amazingly unlucky given he has been amazingly lucky.

Does that makes any sense?

ATH 2008-09-17 00:20

[QUOTE=akruppa;142690]5^2*859 | 2^37156667-3
297253337 | 2^37156667+1

191 | 2^43112609-3
86225219*5259738299*5949540043*12482997260297 | 2^43112609+1[/QUOTE]

3 | 2^37156667+1
3 | 2^43112609+1

Actually operating modulo 3:
2[sup]odd[/sup]+1 = 2*2[sup]even[/sup]+1 = 2*(2^2)[sup]even/2[/sup]+1 = 2*1[sup]even/2[/sup]+1 = 0 (mod 3)

jinydu 2008-09-17 01:02

The first known million digits prime was discovered on June 1, 1999. The $50,000 EFF prize was awarded on April 6, 2000, 310 days later.

At that rate, the $100,000 EFF prize will be awarded on June 29, 2009.

Does anyone know when the M38 discovery was published and in what journal?

argilo 2008-09-17 01:30

Listen to Jeff Gilchrist!
 
For those interested in hearing the interview with Jeff Gilchrist, go to [url]http://www.cbc.ca/radio/[/url] and click on the "Pacific" link beside "Listen Live - Radio One". Jeff will be on approximately 20 minutes from now.

Batalov 2008-09-17 01:49

Great show, Jeff! I've listened to the whole number... :smile: (rewound all the other stuff though)
"...you can continue now..."
Very nice!
Thanks!

P.S. I guess I have a time machine! Nah, I rented it from CBC... just go to [URL]http://www.cbc.ca/asithappens/latestshow.html[/URL] and use all three parts. The marker for the 1st part would be about 22:00 into the part, then ~15:30 into the 2nd part and the very end of part III.

argilo 2008-09-17 01:50

One minute until Jeff's segment. (See listening instructions in my previous post.)

ixfd64 2008-09-17 02:09

In case anyone hasn't seen my post in the other thread, I've started an article on Wikinews: [url]http://en.wikinews.org/wiki/Two_largest_known_prime_numbers_discovered_just_two_weeks_apart;_one_qualifies_for_$100k_prize[/url]

Feel free to improve it, but please make sure it's accurate!

jinydu 2008-09-17 02:29

[QUOTE=jinydu;142835]
Does anyone know when the M38 discovery was published and in what journal?[/QUOTE]

Never mind, I think I found it. "On the Discovery of the 38th Known Mersenne Prime" by George Woltman. It is on page 367 of Volume 37.4, November 1999 issue, of the Fibonacci Quarterly.


All times are UTC. The time now is 21:49.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.