![]() |
![]() |
#1 |
P90 years forever!
Aug 2002
Yeehaw, FL
41·199 Posts |
![]()
We have a competitor
![]() Actually its a very nice looking web site. |
![]() |
![]() |
![]() |
#2 |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]()
If I understand correctly, there is only 1 computer devoted to the task of searching all values of p in increasing order. That computer then updates the webpage automatically. It seems very unlikely that he wouldn't know about GIMPS.
Last fiddled with by jinydu on 2008-10-16 at 04:09 |
![]() |
![]() |
![]() |
#3 |
Bemusing Prompter
"Danny"
Dec 2002
California
5×499 Posts |
![]()
It's pretty cool, but it's also a wasteful effort.
He would be better off running Prime95 and updating us about his assignments. ![]() |
![]() |
![]() |
![]() |
#4 |
"Lucan"
Dec 2006
England
194A16 Posts |
![]()
I think he is trying to claim that he was the first to
discover M(21701). |
![]() |
![]() |
![]() |
#5 |
Banned
"Luigi"
Aug 2002
Team Italia
3·1,619 Posts |
![]()
He is indeed... but he had no clue, at that time, that his algorithm was reliable, I guess.
It's all in S-L-O-W Java. Maybe he'll rethink the whole project after the comments he's going to receive. Luigi |
![]() |
![]() |
![]() |
#6 |
"Lucan"
Dec 2006
England
145128 Posts |
![]()
Or maybe he thought the press wouldn't be interested.
One 10M digit prime is interesting. Two and it's getting boring ![]() |
![]() |
![]() |
![]() |
#7 |
Sep 2008
Kristiansand, Norway
11110 Posts |
![]()
Hey, nothing wrong with a little double checking! About 21701 it's anybody's guess.
Also, I notice from his stats it took him 445 seconds to test M21701 (Oct 14, 2008), so I doubt he will find a prize qualifying prime anytime soon ;) |
![]() |
![]() |
![]() |
#8 | |
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
![]()
Most other entertainment is "wasteful", too. :-)
Quote:
Looks like he's having a fine time on his own. ![]() |
|
![]() |
![]() |
![]() |
#9 |
Aug 2008
1268 Posts |
![]()
I agree completely with Cheesehead's comments, and am even amazed at how well they are worded!
I think it's a cool webpage. I considered making something similar and running it for a few days, just to see how far it would get. By coincidence, I've set up a server that replicates the work done by SETI. It actually works extremely efficiently. I've stayed toe-to-toe with them in number of alien contacts made! |
![]() |
![]() |
![]() |
#10 |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
252148 Posts |
![]() |
![]() |
![]() |
![]() |
#11 | |
Undefined
"The unspeakable one"
Jun 2006
My evil lair
5×7×191 Posts |
![]() Quote:
![]() Since we could use the mathematical approach and calculate the efficiency as (number of positive results)/(number of contributing systems). Since both would give the same ratio then it could be said that uigrad's method is of the same efficiency. On the other hand, we could also say that SETI uses millions of computers to generate a certain number of positive results and uigrad uses one computer to generate the same number of positive results. Thus it would appear that uigrad's method is less wasteful and is thus more efficient. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
USA v UK Baton-dropping competition | davieddy | Hobbies | 0 | 2010-07-31 21:08 |
The Tobacco Institute has competition... | ewmayer | Soap Box | 3 | 2009-06-01 15:31 |
GIMPS uses only 1 cpu | Unregistered | Information & Answers | 7 | 2009-01-10 20:01 |
Maybe we could use the factors themselves as points for competition? | jasong | Factoring | 10 | 2006-03-05 22:14 |
You just got competition... | OmbooHankvald | Lounge | 4 | 2005-09-03 05:21 |