![]() |
![]() |
#34 | ||
May 2005
110010111002 Posts |
![]() Quote:
![]() Quote:
![]() |
||
![]() |
![]() |
![]() |
#35 |
Nov 2003
1110001001102 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. |
![]() |
![]() |
![]() |
#36 |
May 2005
22·11·37 Posts |
![]()
I'm just curious if there is any feasible way to prove GQ(p) prime for p>10^6?
![]() |
![]() |
![]() |
![]() |
#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? |
![]() |
![]() |
![]() |
#39 |
Aug 2002
Buenos Aires, Argentina
149710 Posts |
![]()
You can find known factorizations of Fermat numbers at http://www.prothsearch.net/fermat.html . The last one was found on August.
|
![]() |
![]() |
![]() |
#40 | |
"Jason Goatcher"
Mar 2005
350710 Posts |
![]() Quote:
![]() Um, yeah, I've seen that. I mean is the search ongoing and how would I join? |
|
![]() |
![]() |
![]() |
#41 |
Aug 2002
Buenos Aires, Argentina
3×499 Posts |
![]()
Well, http://www.prothsearch.net/status.html is updated. For example look at the bottom of http://www.prothsearch.net/range8.html
|
![]() |
![]() |
![]() |
#42 |
"Jason Goatcher"
Mar 2005
3×7×167 Posts |
![]()
Thanks, Alperton, I guess I should have looked harder.
Sorry about that. ![]() |
![]() |
![]() |
![]() |
#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? |
![]() |
![]() |