2^n+1 - Page 4

Cruelty · 2006-09-21, 07:51

Quote:

Originally Posted by Jean Penné

Many congrats, Cruelty, for this discovery! I hope the official verification result will come very soon!

I have already verified it with PFGW on different machine

Quote:

Originally Posted by Jean Penné

As a final remark, would you note that testing both GM and GQ (by setting TestGQ=1 in the ini file) has no additional cost for the LLR test, but indeed, the trial factoring eliminates less candidates (GM and GQ must have a small factor).

OK, I will start looking also for GQ, but then it will probably take me ~4 months to fill the gaps

Kosmaj · 2006-09-21, 21:33

Congratulations to Cruelty on the new record Gaussian Mersenne norm! It's only the 12th norm with more than 1000 digits, and the first megabit one. :surprised

And the first one found using LLR!

BTW, I'd like to suggest that posts about this find (and GM) be moved to a new thread.

Cruelty · 2006-09-26, 17:36

I'm just curious if there is any feasible way to prove GQ(p) prime for p>10^6?

Cruelty · 2006-11-16, 21:55

Original message moved here.

jasong · 2007-09-25, 06:08

What is the status of the Fermat Numbers factoring project? It seems the website http://www.fermatsearch.org/ had it's last update back in 2005.

Also, the program I downloaded had the option to attach to a server. Was there a central server at some point?

alpertron · 2007-09-25, 17:20

You can find known factorizations of Fermat numbers at http://www.prothsearch.net/fermat.html . The last one was found on August.

jasong · 2007-09-25, 19:16

Quote:

Originally Posted by alpertron

You can find known factorizations of Fermat numbers at http://www.prothsearch.net/fermat.html . The last one was found on August.

<-----Obligatory smiley face, so I don't seem harsh.

Um, yeah, I've seen that. I mean is the search ongoing and how would I join?

alpertron · 2007-09-25, 20:03

Well, http://www.prothsearch.net/status.html is updated. For example look at the bottom of http://www.prothsearch.net/range8.html

jasong · 2007-09-25, 22:05

Thanks, Alperton, I guess I should have looked harder.

Sorry about that.

jasong · 2007-10-03, 04:54

I did some stuff for the Fermat search project involving trying to find "small" primes of the form k*2^n+1. They sent me the username and password, but I forgot it. But, from what I think I remember about the username and password they supplied, it was a generic combination that was applied to everybody. Possibly implemented to prevent hackers.

Since I'm already a user there, and assuming I'm right about the generic username password, could someone please PM it to me?

2006-11-16, 21:55	#37
Cruelty May 2005 2×809 Posts	Original message moved here. Last fiddled with by Cruelty on 2006-11-16 at 21:58

2006-09-21, 21:33	#35
Kosmaj Nov 2003 2×1,811 Posts	Congratulations to Cruelty on the new record Gaussian Mersenne norm! It's only the 12th norm with more than 1000 digits, and the first megabit one. :surprised And the first one found using LLR! BTW, I'd like to suggest that posts about this find (and GM) be moved to a new thread.

2006-09-26, 17:36	#36
Cruelty May 2005 2×809 Posts	I'm just curious if there is any feasible way to prove GQ(p) prime for p>10^6?

2007-09-25, 06:08	#38
jasong "Jason Goatcher" Mar 2005 5×701 Posts	What is the status of the Fermat Numbers factoring project? It seems the website http://www.fermatsearch.org/ had it's last update back in 2005. Also, the program I downloaded had the option to attach to a server. Was there a central server at some point?

2007-09-25, 17:20	#39
alpertron Aug 2002 Buenos Aires, Argentina 2447₈ Posts	You can find known factorizations of Fermat numbers at http://www.prothsearch.net/fermat.html . The last one was found on August.

2007-09-25, 20:03	#41
alpertron Aug 2002 Buenos Aires, Argentina 1,319 Posts	Well, http://www.prothsearch.net/status.html is updated. For example look at the bottom of http://www.prothsearch.net/range8.html

2007-09-25, 22:05	#42
jasong "Jason Goatcher" Mar 2005 3505₁₀ Posts	Thanks, Alperton, I guess I should have looked harder. Sorry about that.

2007-10-03, 04:54	#43
jasong "Jason Goatcher" Mar 2005 5·701 Posts	I did some stuff for the Fermat search project involving trying to find "small" primes of the form k*2^n+1. They sent me the username and password, but I forgot it. But, from what I think I remember about the username and password they supplied, it was a generic combination that was applied to everybody. Possibly implemented to prevent hackers. Since I'm already a user there, and assuming I'm right about the generic username password, could someone please PM it to me?