20060921, 07:51  #34  
May 2005
2^{3}·7·29 Posts 
Quote:
Quote:


20060921, 21:33  #35 
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. 
20060926, 17:36  #36 
May 2005
658_{16} Posts 
I'm just curious if there is any feasible way to prove GQ(p) prime for p>10^6?

20070925, 06:08  #38 
"Jason Goatcher"
Mar 2005
3×7×167 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? 
20070925, 17:20  #39 
Aug 2002
Buenos Aires, Argentina
550_{16} Posts 
You can find known factorizations of Fermat numbers at http://www.prothsearch.net/fermat.html . The last one was found on August.

20070925, 19:16  #40  
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Quote:
Um, yeah, I've seen that. I mean is the search ongoing and how would I join? 

20070925, 20:03  #41 
Aug 2002
Buenos Aires, Argentina
2^{4}×5×17 Posts 
Well, http://www.prothsearch.net/status.html is updated. For example look at the bottom of http://www.prothsearch.net/range8.html

20070925, 22:05  #42 
"Jason Goatcher"
Mar 2005
3·7·167 Posts 
Thanks, Alperton, I guess I should have looked harder.
Sorry about that. 
20071003, 04:54  #43 
"Jason Goatcher"
Mar 2005
3×7×167 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? 