![]() |
![]() |
#1 |
"Bob Silverman"
Nov 2003
North of Boston
22·1,889 Posts |
![]()
Doesn't anyone care to comment on the p77 just found by Sam??
|
![]() |
![]() |
![]() |
#2 |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
1177010 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2·11·463 Posts |
![]()
Nothing on NUMBRTHRY or on PaulZ's ...or even Sam's own site.
"It's hard to make predictions, especially about the future." ~Y.B. Anyway, it is smaller than p79. Let's wait for a p80! |
![]() |
![]() |
![]() |
#4 | |
Jun 2005
lehigh.edu
40016 Posts |
![]() Quote:
yet inserted" extension files. Maybe an Euler or Bernoulli? Sam was saying that purdue has 90K cores suitable for distributed sieving (small factor bases, maybe?). Not sure how many have enough memory for the large B1's he's been using, but it's certainly more that the c. 9K+ cores on the two clusters from the terragrid grant. -Bruce Yes, N188, the new 1st place Top10 of 2013. Last fiddled with by bdodson on 2013-06-20 at 02:20 Reason: the Bernoulli |
|
![]() |
![]() |
![]() |
#5 | |
"Bob Silverman"
Nov 2003
North of Boston
166048 Posts |
![]() Quote:
I have 14 cores available half-time plus another 8 from older machines. |
|
![]() |
![]() |
![]() |
#6 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×11×463 Posts |
![]()
N(188) c193, that was a good one!
That was a hole left after all the reasonable questions "Why factor N(200) cofactor, when there are smaller holes?" - "Because... you know..." It is unclear though is NFS would have been faster than an appropriate amount of ECM curves (if not for luck). Because Sam is factoring similarly sized numbers now regularly with gnfs, it was probably pre-testing before running gnfs. |
![]() |
![]() |
![]() |
#7 |
Oct 2004
Austria
2×17×73 Posts |
![]()
Congratulations!!
|
![]() |
![]() |
![]() |
#8 |
"Daniel Jackson"
May 2011
14285714285714285714
11000000012 Posts |
![]()
B1 of 1 BILLION?! Wow! I never expected it to be that hard. And 90,000 cores is quite moderate for a supercomputer. Try doing it on the worlds fastest supercomputer and it'll be factored even quicker.
Last fiddled with by Stargate38 on 2013-06-21 at 13:12 |
![]() |
![]() |
![]() |
#9 | |
Tribal Bullet
Oct 2004
5×23×31 Posts |
![]() Quote:
(If NFS@Home tried to use all of the supercomputer we've been spending time on, our quota would last maybe half a day) |
|
![]() |
![]() |
![]() |
#10 |
Bemusing Prompter
"Danny"
Dec 2002
California
2,503 Posts |
![]()
It would be nice if they'd put even a small percentage of those cores towards GIMPS.
![]() |
![]() |
![]() |
![]() |
#11 |
Feb 2012
Paris, France
A216 Posts |
![]()
Nice!!
By the way I didn't see any comment on the P76 reported about 3 weeks ago by Ryan P. (factor of 176^176+175^175 found with B1=26e7) and it doesn't appear in the top-50. We only need a P74 and a P78 to have all P7x... |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Request for comments | ET_ | FermatSearch | 5 | 2016-07-03 10:58 |
How do you look at previous comments on Youtube? | jasong | jasong | 0 | 2012-08-19 20:02 |
low-value comments cleared out of FFT thread | Maximus | Math | 15 | 2011-11-08 19:38 |
Unusual error - comments George? | PhilF | Software | 2 | 2006-04-26 20:19 |
Comments on ElevenSmooth Introduction, Please | wblipp | ElevenSmooth | 0 | 2003-11-24 04:55 |