mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Hardware > GPU Computing

Reply
 
Thread Tools
Old 2013-09-08, 17:52   #23
TheMawn
 
TheMawn's Avatar
 
May 2013
East. Always East.

32778 Posts
Default

Quote:
What we could do is to search for it, no matter how high it is.
As opposed to what?
TheMawn is offline   Reply With Quote
Old 2013-09-08, 18:34   #24
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

165468 Posts
Default

Quote:
Originally Posted by lbh134679 View Post
The best way to prove MM127 is composite is to find a factor. What we could do is to search for it, no matter how high it is.
The chance of success is exceedingly low -- roughly about 1%. If that does not deter you, join the group running the mmff program. Your help will be appreciated.
Prime95 is online now   Reply With Quote
Old 2013-09-08, 19:16   #25
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by Prime95 View Post
The chance of success is exceedingly low -- roughly about 1%. If that does not deter you, join the group running the mmff program. Your help will be appreciated.
How do you figure that? It seems to me that we can keep on searching until we either find a factor or decide that an LL is feasible. Granted, we may never have a computer that succeeds in either of those tasks, but I don't see why there's a limit to how far we can push the bounds, and thus, the probability of a factor (converging to 1, when we must find a factor because we've tried all possibilities).

(the current bit level is ~184, so for every extra bit, which is double the effort of the last, a ~1/184 chance of a factor should be expected)

Last fiddled with by Mini-Geek on 2013-09-08 at 19:20
Mini-Geek is offline   Reply With Quote
Old 2013-09-08, 19:57   #26
Prime95
P90 years forever!
 
Prime95's Avatar
 
Aug 2002
Yeehaw, FL

2·53·71 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
How do you figure that?
We've TFed to 2^184 and the going is getting slow (took about a year to get the last bit level done). In the near term, we can do 2 maybe 3 more bit levels for about a 1% chance.
Prime95 is online now   Reply With Quote
Old 2013-09-08, 20:17   #27
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

103×113 Posts
Default

Quote:
Originally Posted by Batalov View Post
There's a very likable Coursera class on right now, so I guess some of the terminology simply rubs in. You see, the professor makes a clear distinction there - between utterances, linguistic acts, speech acts, and finally arguments. (and that's is even before the discussion of strength and validity an arguments. That is some utterances are not linguistic acts, not all linguistic acts are speech acts, and not all of those are even entering arguments. It's loads of fun! I recommend joining if it is still open.)
Being a libertarian, I believe any utterances, (non)linguistic acts, (non)speech acts and entering (or not) arguments between consenting adults are no one else's business.
ewmayer is offline   Reply With Quote
Old 2013-09-08, 20:31   #28
Robish
 
"Rob Gahan"
Aug 2013
Ireland

1001002 Posts
Smile

Quote:
Originally Posted by Prime95 View Post
The chance of success is exceedingly low -- roughly about 1%. If that does not deter you, join the group running the mmff program. Your help will be appreciated.
I would like to have a go, can you give me a link to the group pls?

Cheers

Rob.
Robish is offline   Reply With Quote
Old 2013-09-08, 20:50   #29
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

224058 Posts
Default

http://mersenneforum.org/forumdisplay.php?f=99
for all sorts of information, and
http://www.doublemersennes.org/
Batalov is offline   Reply With Quote
Old 2013-09-08, 20:53   #30
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by Prime95 View Post
We've TFed to 2^184 and the going is getting slow (took about a year to get the last bit level done). In the near term, we can do 2 maybe 3 more bit levels for about a 1% chance.
Ok, gotcha.

Last fiddled with by Mini-Geek on 2013-09-08 at 20:53 Reason: Batalov beat me to the punch
Mini-Geek is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Nuke attack - run or hide? MooMoo2 Soap Box 40 2018-01-19 23:48
Let's attack the Bayesian-ECM-bounds again fivemack Math 33 2017-02-10 00:10
Attack of the Cosmic Rays S485122 Hardware 3 2010-08-24 01:19
Attack of the Killer Zombies ewmayer Lounge 12 2007-01-30 05:56
Factoring Double mersennes Citrix Miscellaneous Math 2 2005-10-04 08:08

All times are UTC. The time now is 04:13.


Sat Jul 17 04:13:13 UTC 2021 up 50 days, 2 hrs, 1 user, load averages: 3.26, 2.66, 2.25

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.