20060607, 21:50  #1 
"Jason Goatcher"
Mar 2005
5×701 Posts 
Any open problems out there where a brute force attack would help, but no DC program?
I know the answer's probably yes, which is the reason I'm asking.

20060607, 22:09  #2 
"Nancy"
Aug 2002
Alexandria
2,467 Posts 
I don't understand the question
Alex 
20060607, 22:15  #3  
Jun 2003
7·23·29 Posts 
Quote:
[Is my translation accurate?] 

20060607, 22:19  #4 
Sep 2002
2·331 Posts 
Any ( Math ) theorems/problems where a distributed computing
brute force attack (exhaustive search) would prove/solve it, but no distributed computing system, such Prime95 with Primenet for finding Mersenne primes, has been developed and deployed. This is my interpretation of jasong's question. Hopefully it is close to what he ment. Dan 
20060607, 23:59  #5  
Aug 2005
Brazil
362_{10} Posts 
Quote:


20060609, 00:39  #6  
"Jason Goatcher"
Mar 2005
5×701 Posts 
Quote:
Sorry for the trouble. Last fiddled with by akruppa on 20060609 at 18:27 Reason: Thread title changed 

20060609, 02:54  #7 
"Phil"
Sep 2002
Tracktown, U.S.A.
10001011101_{2} Posts 
The "Beal" conjecture (although Bob Silverman has pointed out that it predates the association with Beal's name), if false, can probably only be disproved by finding a counterexample. On the other hand, if it is true, a computer search will never find a counterexample. With a $100,000 prize offered for either a proof or a counterexample, it seems likely that several people with good ideas for an organized search may have kept their ideas to themselves rather than organize a distributed computing project.

20060609, 07:30  #8 
Jun 2003
61E_{16} Posts 
There is also magic square of squares and several other open problems. But none of them are likely to have a solution, so there is no point wasting cycles. It is better to wait for a genius to find the proof.

20060624, 04:05  #9  
Jun 2003
2×3^{3}×29 Posts 
Low weight proth search?
Quote:
(may be search for primes under 1M instead of 2M) I have about 5000 good candidates with weight under 40 with me, if any one is interested. (I am only working on 4 of them, the rest are free to be taken) Thank you Last fiddled with by Citrix on 20060624 at 04:20 

20060624, 18:35  #10 
Dec 2005
2·7 Posts 
Perfect Numver
Is there any organized search for an odd perfect number?

20060624, 21:17  #11  
"William"
May 2003
New Haven
2×3^{2}×131 Posts 
Quote:
There is an ECM server to work on the next roadblock, and there are ECM servers to work on smaller factorizations of interest, and there is a page of composites suitable for NFS factorizations. I've sought to maintain a pretty low profile because it generates ill will to recruit to a project that cannot be properly supported, and it's not going to be supported until things calm down at work. http://oddperfect.org William 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Force FFTsize to be used  kruoli  Software  4  20171117 18:14 
Force 1st time primality test with mprime  Uncle Lumpy  Software  5  20170311 03:27 
Gravity Force of a Spherical Shell  davieddy  Puzzles  29  20120827 12:26 
force prime95 to get higher exponents?  joblack  PrimeNet  6  20090425 15:16 
force prime95 to update  starrynte  PrimeNet  4  20081011 23:04 