mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2006-06-07, 21:50   #1
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

5×701 Posts
Default 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.
jasong is offline   Reply With Quote
Old 2006-06-07, 22:09   #2
akruppa
 
akruppa's Avatar
 
"Nancy"
Aug 2002
Alexandria

2,467 Posts
Default

I don't understand the question

Alex
akruppa is offline   Reply With Quote
Old 2006-06-07, 22:15   #3
axn
 
axn's Avatar
 
Jun 2003

7·23·29 Posts
Default

Quote:
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?]
axn is online now   Reply With Quote
Old 2006-06-07, 22:19   #4
dsouza123
 
dsouza123's Avatar
 
Sep 2002

2·331 Posts
Default

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
dsouza123 is offline   Reply With Quote
Old 2006-06-07, 23:59   #5
fetofs
 
fetofs's Avatar
 
Aug 2005
Brazil

36210 Posts
Default

Quote:
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"?
fetofs is offline   Reply With Quote
Old 2006-06-09, 00:39   #6
jasong
 
jasong's Avatar
 
"Jason Goatcher"
Mar 2005

5×701 Posts
Default

Quote:
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.

Last fiddled with by akruppa on 2006-06-09 at 18:27 Reason: Thread title changed
jasong is offline   Reply With Quote
Old 2006-06-09, 02:54   #7
philmoore
 
philmoore's Avatar
 
"Phil"
Sep 2002
Tracktown, U.S.A.

100010111012 Posts
Default

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.
philmoore is offline   Reply With Quote
Old 2006-06-09, 07:30   #8
Citrix
 
Citrix's Avatar
 
Jun 2003

61E16 Posts
Default

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 is offline   Reply With Quote
Old 2006-06-24, 04:05   #9
Citrix
 
Citrix's Avatar
 
Jun 2003

2×33×29 Posts
Default Low weight proth search?

Quote:
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

Last fiddled with by Citrix on 2006-06-24 at 04:20
Citrix is offline   Reply With Quote
Old 2006-06-24, 18:35   #10
PrimeCrazzy
 
PrimeCrazzy's Avatar
 
Dec 2005

2·7 Posts
Default Perfect Numver

Is there any organized search for an odd perfect number?
PrimeCrazzy is offline   Reply With Quote
Old 2006-06-24, 21:17   #11
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

2×32×131 Posts
Default

Quote:
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 10300 to 10500 will require only easy factorizations and a lot of bookkeeping. We've contributed about 3300 factors to Brent's list of factors for an±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
wblipp is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Force FFT-size to be used kruoli Software 4 2017-11-17 18:14
Force 1st time primality test with mprime Uncle Lumpy Software 5 2017-03-11 03:27
Gravity Force of a Spherical Shell davieddy Puzzles 29 2012-08-27 12:26
force prime95 to get higher exponents? joblack PrimeNet 6 2009-04-25 15:16
force prime95 to update starrynte PrimeNet 4 2008-10-11 23:04

All times are UTC. The time now is 12:26.

Mon Aug 10 12:26:43 UTC 2020 up 24 days, 8:13, 3 users, load averages: 1.38, 1.74, 1.86

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.