Any open problems out there where a brute force attack would help, but no DC program?

[jasong]

I know the answer's probably yes, which is the reason I'm asking.

[akruppa]

I don't understand the question

Alex

[axn]

Originally Posted by akruppa

I don't understand the question

Alex

Are there any theorems (conjectures / open problems) which could use brute force computations but currently no DC effort is underway?

[Is my translation accurate?]

[dsouza123]

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

[fetofs]

Originally Posted by dsouza123

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

Can I ask the same question appending to the last part "where no DC program has been deployed and isn't really needed"?

[jasong]

Originally Posted by akruppa

I don't understand the question

Alex

I apologize. "theorem" is indeed the wrong word. "open problems" would be a better fit.

Sorry for the trouble.

[philmoore]

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.

[Citrix]

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.

[Citrix]

Originally Posted by fetofs

Can I ask the same question appending to the last part "where no DC program has been deployed and isn't really needed"?

Would any of you be interested in organizing/starting/working on a project to search for low weight proth k's that yield a huge prime. This would be the same as http://www.mersenneforum.org/showthread.php?t=5789 ,but on the +1 side.
(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

[PrimeCrazzy]

Is there any organized search for an odd perfect number?

[wblipp]

Originally Posted by PrimeCrazzy

Is there any organized search for an odd perfect number?

"Organized" would be generous. I've been swamped with my regular job and unable to get as organized as I'd like. We have been able to figure out the large, roadblock factorizations that limit the ability of extending the Brent, Cohen, and te Riehl method, and we have factored enough of these that extension from their bound of 10³⁰⁰ to 10⁵⁰⁰ will require only easy factorizations and a lot of bookkeeping. We've contributed about 3300 factors to Brent's list of factors for aⁿ±1.

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